Submission #862313

#	Time	Username	Problem	Language	Result	Execution time	Memory
862313		TAhmed33	Osumnjičeni (COCI21_osumnjiceni)	C++98	0 / 110	46 ms	2652 KiB

Main

#include <bits/stdc++.h>
using namespace std;
int main () {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	pair <int, int> arr[n + 1];
	for (int i = 1; i <= n; i++) cin >> arr[i].first >> arr[i].second;
	int nxt[n + 1] = {};
	nxt[n] = n;
	for (int i = n - 1; i >= 1; i--) {
		nxt[i] = n;
		multiset <pair <int, int>> cur;
		cur.insert(arr[i]);
		for (int j = i + 1; j <= n; j++) {
			auto l = cur.lower_bound({arr[j].second + 1, 0});
			if (l == cur.begin()) {
				cur.insert(arr[j]);
				continue;
			}
			l--;
			auto x = *l;
			if (x.second < arr[j].first) {
				cur.insert(arr[j]);
				continue;
			}
			nxt[i] = j - 1; break;
		}
	}
	int q;
	cin >> q;
	while (q--) {
		int l, r;
		cin >> l >> r;
		int cnt = 1;
		for (int i = l + 1; i <= r; i++) if (min(r, nxt[i]) != min(r, nxt[i - 1])) cnt++;
		cout << cnt << '\n';
	}
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 50