Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- #define all(x) x.begin(), x.end()
- #define pb(x) push_back(x)
- #define cout2(x, y) cout << x << " " << y << endl
- #define N 100005
- using namespace std;
- /*(peso, balanceado?)*/
- pair<long long, bool> solve(){
- long long wl, wr;
- long long dl, dr;
- pair<long long, int> izq, der;
- scanf("%lld%lld%lld%lld", &wl, &dl, &wr, &dr);
- if(wl == 0)izq = solve();
- else izq = make_pair(wl, 1);
- if(wr == 0)der = solve();
- else der = make_pair(wr, 1);
- if(izq.second == true && der.second == true && izq.first * dl == der.first * dr)return make_pair(izq.first + der.first, true);
- else return make_pair(izq.first + der.first, false);
- }
- int main(){
- int tc = 0;
- scanf("%d", &tc);
- while(tc--){
- pair<long long, int>res = solve();
- if(res.second == 1)printf("YES\n");
- else printf("NO\n");
- if(tc > 0)puts("");
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement