Masha and Bears(翻译+思维)

Description

A family consisting of father bear, mother bear and son bear owns three cars. Father bear can climb into the largest car and he likes it. Also, mother bear can climb into the middle car and she likes it. Moreover, son bear can climb into the smallest car and he likes it. It's known that the largest car is strictly larger than the middle car, and the middle car is strictly larger than the smallest car.

Masha came to test these cars. She could climb into all cars, but she liked only the smallest car.

It's known that a character with size a can climb into some car with size b if and only if a ≤ b, he or she likes it if and only if he can climb into this car and 2a ≥ b.

You are given sizes of bears and Masha. Find out some possible integer non-negative sizes of cars.

Input

You are given four integers V₁, V₂, V₃, V_m(1 ≤ V_i ≤ 100) — sizes of father bear, mother bear, son bear and Masha, respectively. It's guaranteed that V₁ > V₂ > V₃.

Output

Output three integers — sizes of father bear's car, mother bear's car and son bear's car, respectively.

If there are multiple possible solutions, print any.

If there is no solution, print "-1" (without quotes).

Sample Input

Input

50 30 10 10

Output

50 30 10

Input

100 50 10 21

Output

-1

Hint

In first test case all conditions for cars' sizes are satisfied.

In second test case there is no answer, because Masha should be able to climb into smallest car (so size of smallest car in not less than 21), but son bear should like it, so maximum possible size of it is 20.

 

题目意思：熊爸爸，熊妈妈，熊儿子各有一辆车，车的体积是c1,c2,c3,他们一家的体积是v1,v2,v3,Masha的体积是vm。

三辆车严格递减c1>c2>c3 。他们都喜欢各自的车满足条件vi<=ci<=2*vi。Masha三辆车都能进，但是他只喜欢最小的那辆车。

 

解题思路；

这道题很坑很坑，首先我们需要明确一点所给的是各自的体积，而要求的是汽车的体积！有用三层暴力的，其实在多种情况下只求一种，我们完全可以找一种边界情况，熊爸爸，熊妈妈不与Masha产生联系，还要严格递减，那么直接使用最大值就可以。c1=2*v1,c2=2*v2。但到了熊孩子就不一样了，他需要的车和Masha的需求产生了联系，Masha只喜欢最小的车而熊孩子也要最小车，这就使得我们需要对c3做一下判断。如果Masha体积很大，达到vm>2*v3，那么他将不能进入最小的车，不满足情况；但vm<=2*v3时，让c3等于熊孩子和Masha体积重最大的哪一个。这样c1,c2,c3找到了，接下来就是看是否符合条件了。
 我们要对所给的信息进行分析。

1.Masha三辆车都能进，那么一定有vm<=c3。

2.Masha要喜欢最小的那一辆车，那么还要满足2*vm>=c3

3.Masha只喜欢最小的那一辆，那么说明不喜欢最大的和中间大的，那么2*vm<c1，2*vm<c2。

 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 #include <iostream>
 using namespace std;
 typedef long long int LL;
 const LL MAXL(1e6);
 int main()
 {
     int v1,v2,v3,vm;
     int c1,c2,c3;
     while(~scanf("%d%d%d%d",&v1,&v2,&v3,&vm))
     {
         c1=*v1;
         c2=*v2;
         if(vm>*v3)
         {
             printf("-1\n");
             return ;
         }
         c3=max(v3,vm);
         if(vm<=c3&&*vm>=c3&&*vm<c2)
         {
             printf("%d\n%d\n%d\n",c1,c2,c3);
         }
         else
         {
            printf("-1\n");
         }
     }
     return ;
 }