#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, m, k, t;
ll d[1007][1007];
char a[1007][1007];
void clear_me(){
for(int i = 0; i <= n; i++)
for(int j = 0; j <= m;j ++)
d[i][j] = 0;
}
int main(){
cin >> n >> m >> k;
for(int i = 0; i <= n; i++)
for(int j = 0; j <= m; j++)
a[i][j] = 'B';
for(int i = 0; i < k; i++){
ll aa, bb;
cin >> aa >> bb;
a[aa][bb] = 'G';
}
cin >> t;
while(t--){
clear_me();
ll x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
d[x1][y1] = 1;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
if(d[i][j - 1] == 1 || (a[i - 1][j] == 'G' && d[i - 1][j] == 1))
d[i][j] = 1;
}
}
if(d[x2][y2] == 1)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
30 ms |
1612 KB |
200 token(s): yes count is 21, no count is 179 |
2 |
Correct |
27 ms |
1336 KB |
200 token(s): yes count is 70, no count is 130 |
3 |
Correct |
26 ms |
1612 KB |
197 token(s): yes count is 25, no count is 172 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
102 ms |
20264 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
420 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
416 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |