Advertisement
fc-UNI_2015

p3) Not So Mobile

Feb 6th, 2016
63
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.88 KB | None | 0 0
  1.  
  2. #include<bits/stdc++.h>
  3. #define all(x) x.begin(), x.end()
  4. #define pb(x) push_back(x)
  5. #define cout2(x, y) cout << x << " " << y << endl
  6. #define N 100005
  7.  
  8. using namespace std;
  9.  
  10. /*(peso, balanceado?)*/
  11. pair<long long, bool> solve(){
  12.  
  13.     long long wl, wr;
  14.     long long dl, dr;
  15.  
  16.     pair<long long, int> izq, der;
  17.     scanf("%lld%lld%lld%lld", &wl, &dl, &wr,  &dr);
  18.  
  19.     if(wl == 0)izq = solve();
  20.     else izq = make_pair(wl, 1);
  21.  
  22.     if(wr == 0)der = solve();
  23.     else der = make_pair(wr, 1);
  24.  
  25.     if(izq.second == true && der.second == true && izq.first * dl == der.first * dr)return make_pair(izq.first + der.first, true);
  26.     else return make_pair(izq.first + der.first, false);
  27. }
  28.  
  29. int main(){
  30.  
  31.     int tc = 0;
  32.     scanf("%d", &tc);
  33.    
  34.     while(tc--){
  35.        
  36.         pair<long long, int>res = solve();
  37.        
  38.         if(res.second == 1)printf("YES\n");
  39.         else printf("NO\n");
  40.        
  41.         if(tc > 0)puts("");
  42.     }
  43.  
  44. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement