This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
void solve(){
int n;
cin>>n;
int a,b;
for(int i = 0;i<n-1;i++)cin>>a>>b;
int m;
cin>>m;
pair<int,int> arr[m];
for(auto &i:arr)cin>>i.first>>i.second;
sort(arr,arr+m);
int maxR = 0,minL = 0;
bool flag = true;
for(auto &i:arr){
if(i.first>i.second){
if(minL>i.second)flag = false;
if(maxR>i.second)flag = false;
minL = max(minL,i.second);
}
else{
if(maxR>i.second)flag = false;
maxR = max(maxR,i.second);
}
}
if(flag)cout<<"Yes\n";
else cout<<"No\n";
return;
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t;
cin>>t;
while(t--)solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |