Submission #1200007

#	Time	Username	Problem	Language	Result	Execution time	Memory
1200007		zsombor	Gift Exchange (JOI24_ho_t4)	C++20	50 / 100	2595 ms	6212 KiB

Main

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int n, q;
vector <int> a(6e5, 0);
vector <int> b(6e5, 0);
vector <int> x;
vector <int> y;

void solve() {
	int l, r;
	cin >> l >> r;
	x.resize(r - l + 1);
	y.resize(r - l + 1);
	for (int i = 0; i <= r - l; i++) {
		x[i] = a[l + i];
		y[i] = b[l + i];
	}
	sort(x.begin(), x.end());
	sort(y.begin(), y.end());
	for (int i = l; i <= r; i++) {
		int z = 0;
		z += lower_bound(x.begin(), x.end(), b[i]) - x.begin();
		z += y.end() - lower_bound(y.begin(), y.end(), a[i]);
		if (z == r - l) { cout << "No\n"; return; }
	}
	cout << "Yes\n";
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= n; i++) cin >> b[i];
	cin >> q;
	while (q--) solve();
}

• Subtask 1: 4 / 4
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 31 / 31
• Subtask 5: 0 / 8
• Subtask 6: 0 / 12
• Subtask 7: 0 / 18
• Subtask 8: 0 / 12