Submission #365938

#TimeUsernameProblemLanguageResultExecution timeMemory
365938sobaTrampoline (info1cup20_trampoline)C++14
0 / 100
183 ms49260 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...