Submission #892902

#	Time	Username	Problem	Language	Result	Execution time	Memory
892902		Hhw48	Trampoline (info1cup20_trampoline)	C++14	0 / 100	2047 ms	143440 KiB

trampoline

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
int r,c,n;
int arr[3000][3000];
int memo(int y, int x, int t_y, int t_x){
	if(x>t_x)return 0;
	if(y>t_y)return 0;
	if(x<1||y<1)return 0;
	if(y==t_y && x==t_x){
		return 1;
	}
	else{
		if(arr[y][x]==1){
			return max(memo(y,x+1,t_y,t_x),memo(y+1,x,t_y,t_x));
		}
		else{
			return memo(y,x+1,t_y,t_x);
		}
	}
}
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin>>r>>c>>n;
	memset(arr,0,sizeof(arr));
	for(int i=1; i<=n; i++){
		int x,y;
		cin>>y>>x;
		arr[y][x]=1;
	}
	int t;
	cin>>t;
	while(t--){
		int sy,sx,ey,ex;
		cin>>sy>>sx>>ey>>ex;
		/*
		bool flag=true;
		if(sy==r){
			cout<<"No\n";
			continue;
		}
		for(int i=sx; i<=c; i++){
			if(arr[sy][i]==1 && i<=ex){
				cout<<"Yes\n";
				flag=false;
				break;
			}
		}
		if(flag==true)cout<<"No\n
		*/
		if(memo(sy,sx,ey,ex)==1){
			cout<<"Yes\n";
		}
		else{
			cout<<"No\n";
		}
	}
}

• Subtask 1: 0 / 23
• Subtask 2: 0 / 20
• Subtask 3: 0 / 11
• Subtask 4: 0 / 19
• Subtask 5: 0 / 27