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;
#define ll long long
#define pii pair<ll,ll>
#define pb push_back
#define fi first
#define se second
const ll N = 2003;
ll n,m,q,x,y;
ll s[N],e[N];
ll ans[N][N];
pii a[N];
bool cmp(pii x, pii y) {
return x.se < y.se;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m >> q;
for(int i=1; i<=m; i++) {
cin >> a[i].fi >> a[i].se;
ans[a[i].fi][a[i].se] = true;
}
sort(a+1,a+m+1,cmp);
for(int i=1; i<=m; i++) {
for(int j=1; j<a[i].fi; j++) {
if(ans[j][a[i].fi-1]) {
ans[j][a[i].se] = true;
}
}
}
while(q--) {
cin >> x >> y;
if(ans[x][y]) cout << "YES" << endl;
else cout << "NO" << endl;
}
}
# | 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... |