Submission #487989

#	Time	Username	Problem	Language	Result	Execution time	Memory
487989		maks007	Trampoline (info1cup20_trampoline)	C++14	0 / 100	2080 ms	12856 KiB

trampoline

#include <bits/stdc++.h>
 
using namespace std;
 
void solve() {
	int r, c;
	cin >> r >> c;
	int n;
	cin >> n;
	map<int, vector <int>> mp;
	set <pair<int, int>> s;
	set <int> xs;
	for(int i = 0; i < n; i ++) {
		int a, b;
		cin >> a >> b;
		a --;
		b --;
		#define pb push_back
		xs.insert(a);
		mp[a].pb(b);
	}
	int T;
	cin >> T;
	while(T --) {
		pair <int, int> start, end;
		cin >> start.first >> start.second >> end.first >> end.second;
		start.first --;
		start.second --;
		end.first --;
		end.second --;
		if(start.first == end.first) {
			cout << "Yes\n";
			continue;
		}
		int temp = start.second;
		for(int i = start.first; i < end.first; i ++) {
			if(xs.count(i) == 0) {
			//	cout << i << " ";
				cout << "No\n";
				goto end;
			}
 
		}
		for(int i = start.first; i < end.first; i ++) {
			vector <int> pos = mp[i];
			int where = *(lower_bound(pos.begin(), pos.end(), i) + 1);
			if(where < temp or where > end.second) {
				cout << "No\n";
			//	cout << i << " ";
				goto end;
			}
			temp = where;
		}
		cout << "Yes\n";
		end:;
	}
}
 
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int Q = 1;
	//cin >> Q;
	while (Q --) {
		solve();
	}
	return 0;
}

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