#include <bits/stdc++.h>
using namespace std;
void solve() {
int r, c;
cin >> r >> c;
int n;
cin >> n;
map<int, vector <int>> mp;
set <pair<int, int>> s;
set <int> xs;
for(int i = 0; i < n; i ++) {
int a, b;
cin >> a >> b;
a --;
b --;
#define pb push_back
xs.insert(a);
mp[a].pb(b);
}
int T;
cin >> T;
while(T --) {
pair <int, int> start, end;
cin >> start.first >> start.second >> end.first >> end.second;
start.first --;
start.second --;
end.first --;
end.second --;
if(start.first == end.first) {
cout << "Yes\n";
continue;
}
int temp = start.second;
for(int i = start.first; i < end.first; i ++) {
if(xs.count(i) == 0) {
// cout << i << " ";
cout << "No\n";
goto end;
}
}
for(int i = start.first; i < end.first; i ++) {
vector <int> pos = mp[i];
int where = *(lower_bound(pos.begin(), pos.end(), i) + 1);
if(where < temp or where > end.second) {
cout << "No\n";
// cout << i << " ";
goto end;
}
temp = where;
}
cout << "Yes\n";
end:;
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int Q = 1;
//cin >> Q;
while (Q --) {
solve();
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
332 KB |
expected YES, found NO [1st token] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
199 ms |
2036 KB |
expected YES, found NO [3rd token] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2080 ms |
2552 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
332 KB |
expected YES, found NO [1st token] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2077 ms |
12856 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |