제출 #1027730

#제출 시각아이디문제언어결과실행 시간메모리
1027730vjudge1Trampoline (info1cup20_trampoline)C++17
23 / 100
2036 ms54184 KiB
#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;

vector<int> v[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;
	for(auto a:v[x]){
		if(a<y || a>ty)continue;
		cev+=f(x+1,a,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].push_back(y);
	}
	
	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 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...