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,a,b;
ll l[N],r[N],s[N],e[N];
ll tmp[N];
ll ans[N][N];
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m >> q;
	for(int i=1; i<=m; i++) {
		cin >> l[i] >> r[i];
		ans[l[i]][r[i]] = true;
	}
	for(int i=1; i<=m; i++) {
		for(int j=1; j<l[i]; j++) {
			if(ans[j][l[i]-1]) {
				ans[j][r[i]] = true;
			}
		}
	}
	while(q--) {
		cin >> a >> b;
		if(ans[a][b]) 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... |