#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll r , c , n , x , y , a, b, t;
cin >> r>> c >> n ;
int next[r+1][c+1] , grid[r+1][c+1]={0};
for(int i = 0 ; i < n ; i++)
{
cin >> x>> y ;
grid[x][y]=1;
}
for(int i = 1 ; i <= r ; i++)
{
x=c+1;
for(int j = c; j>=1 ; j--)
{
next[i][j]=x;
if(grid[i][j])x=j;
}
}
cin >> t;
while(t--)
{
cin>> x >> y >> a >> b ;
int j=y;
int impos=0;
for(int i = x ; i<a ; i++)
{
j=next[i][j];
if(j>b)
{
impos=1;
break;
}
}
if(impos)
{
cout << "No\n";
}
else cout << "Yes\n";
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
7 ms |
620 KB |
expected NO, found YES [13th token] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
183 ms |
49260 KB |
expected YES, found NO [2299th token] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
492 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
492 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
492 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |