Submission #692395

#	Time	Username	Problem	Language	Result	Execution time	Memory
692395		Lextyle	Trampoline (info1cup20_trampoline)	C++17	100 / 100	316 ms	28704 KiB

trampoline

#include <bits/stdc++.h>
#pragma warning(disable : 4996)
#pragma warning(disable : 6031)
#define USACO freopen("moocast.in", "r", stdin); freopen("moocast.out", "w+", stdout)
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define ll long long
using namespace std;

ll binpow(ll a, ll x, ll m) {
	ll ans = 1, md = a % m;
	for (int i = 0; i < 63; i++) {
		if (x & ((ll)1 << i)) ans = (ans * md) % m;
		md = (md * md) % m;
	}
	return ans;
}

vector<ll> gcd(ll a, ll b) {
	if (b == 0) {
		return { a, 1, 0 };
	}
	vector<ll> d = gcd(b, a % b);
	return { d[0], d[2], d[1] - d[2] * (a / b) };
}

ll lcm(ll a, ll b) {
	return a * b / gcd(a, b)[0];
}
pair<int, int> p[200000];
int f[200000], binlft[32][200001];

void solve() {
	int r, c, n, T;
	cin >> r >> c >> n;
	for (int i = 0; i < n; i++) cin >> p[i].first >> p[i].second;
	sort(p, p + n);
	for (int i = 0; i < n; i++) {
		int j = lower_bound(p, p + n, pair<int, int>{p[i].first + 1, p[i].second}) - p;
		if (j == n || p[j].first > p[i].first + 1) f[i] = n;
		else f[i] = j;
	}
	for (int i = 0; i < n; i++) binlft[0][i] = f[i];
	for (int i = 0; i <= 30; i++) binlft[i][n] = n;
	for (int k = 1; k <= 30; k++) {
		for (int i = 0; i < n; i++) binlft[k][i] = binlft[k - 1][binlft[k - 1][i]];
	}
	cin >> T;
	while (T--) {
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		if (x1 > x2) {
			cout << "No\n";
			continue;
		}
		if (x1 == x2) {
			if (y1 <= y2) cout << "Yes\n";
			else cout << "No\n";
			continue;
		}
		x2--;
		int green = lower_bound(p, p + n, pair<int, int>{ x1, y1 }) - p, dist = x2 - x1;
		if (green == n || p[green].first != x1) {
			cout << "No\n";
			continue;
		}
		for (int bit = 30; bit >= 0; bit--) {
			if (dist & (1 << bit)) green = binlft[bit][green];
		}
		if (green != n && p[green].second <= y2) cout << "Yes\n";
		else cout << "No\n";
	}
}

int main() {
	//USACO;
	fastIO;
	solve();
}

Compilation message (stderr)

trampoline.cpp:2: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    2 | #pragma warning(disable : 4996)
      | 
trampoline.cpp:3: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    3 | #pragma warning(disable : 6031)
      |

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