This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define OYY LLONG_MAX
#define mod 998244353
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define lim 2505
#define fi first
#define se second
int r,c;
int v[lim][lim];
int dp[lim][lim];
inline int f(int x,int y,int tx,int ty){
if(x>r || y>c)return 0;
if(x==tx && y==ty)return 1;
if(~dp[x][y])return dp[x][y];
int cev=0;
if(v[x][y]){
cev+=f(x+1,y,tx,ty);
}
cev+=f(x,y+1,tx,ty);
return dp[x][y]=cev;
}
int32_t main(){
faster
int n;cin>>r>>c>>n;
FOR{
int x,y;cin>>x>>y;
v[x][y]=1;
}
int q;cin>>q;
while(q--){
int x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
for(int i=1;i<=r;i++){
for(int j=1;j<=c;j++){
dp[i][j]=-1;
}
}
int tut=f(x1,y1,x2,y2);
if(tut)cout<<"Yes"<<'\n';
else cout<<"No"<<'\n';
}
return 0;
}
# | 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... |