Submission #775567

#	Time	Username	Problem	Language	Result	Execution time	Memory
775567		pulsatio	Trampoline (info1cup20_trampoline)	C++14	0 / 100	2063 ms	4844 KiB

trampoline

#include <bits/stdc++.h>

using namespace std;


int r,c,n,t;

vector<int> adj[200*200];


int id(int i,int j){
	return i*c + j;
}

bool dfs(int u,int x){
	 
	if(u == x) return true;
	for(int v:adj[u]){
		if(dfs(v,x))
			return true;
	}
	return false;
}

int main(){

	cin >> r >> c >> n;

	for(int i = 0; i < r; i++){
		for(int j = 0; j < c - 1; j++){
			adj[id(i,j)].push_back(id(i,j+1));
		}
	}
	int x,y,a,b;
	for(int i = 0; i < n; i++){
		cin >> x >> y;
		x--,y--;
		if(x < r-1)
			adj[id(x,y)].push_back(id(x+1,y));
	}

	cin >> t;

	while(t--){
		cin >> x >> y >> a >> b;
		
		if(dfs(id(x-1,y-1), id(a-1,b-1)))
			cout << "Yes\n";
		else
			cout << "No\n";

	}

	return 0;
}

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