Submission #1145025

#	Time	Username	Problem	Language	Result	Execution time	Memory
1145025		thecrazycandy	Trampoline (info1cup20_trampoline)	C++20	0 / 100	2094 ms	9996 KiB

trampoline

#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
using namespace std;
#define sped_up ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
const ll INF = (ll)1e9 + 1, INFL = (ll)1e18 + 1;
const ll mod = (ll)1e9 + 7, MAXN = (ll)1;
int main () {
	sped_up;
	ll n, m, k;
	cin >> n >> m >> k;
	map <ll, vector <ll>> mp;
	for (int i = 1; i <= k; i++) {
		ll x, y;
		cin >> x >> y;
		mp[x].push_back(y);
	}
	for (auto i : mp) {
		sort(i.second.begin(), i.second.end());
	}
	ll q;
	cin >> q;
	while (q--) {
		ll x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		while (x1 < x2) {
			ll no = 1;
			for (auto i : mp[x1]) {
				if (y1 <= i) {
					y1 = i;
					no = 0;
					break;
				}
			}
			if (no == 1) break;
			x1++;
		}
		if (x1 == x2 && y1 <= y2) 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