oj.uz

Submission #862270

# Submission time Handle Problem Language Result Execution time Memory
862270 2023-10-17T21:51:24 Z TAhmed33 Osumnjičeni (COCI21_osumnjiceni) C++
0 / 110
 269 ms 1884 KB 
#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 q;
	cin >> q;
	while (q--) {
		int l, r;
		cin >> l >> r;
		set <pair <int, int>> cur;
		cur.insert(arr[l]);
		int cnt = 1;
		for (int i = l + 1; i <= r; i++) {
			auto x = cur.lower_bound({arr[i].second + 1, 0});
			if (x == cur.begin()) {
				cur.insert(arr[i]);
				continue;
			}
			x--;
			auto l = *x;
			if (l.first >= arr[i].first && l.first <= arr[i].second) {
				cur.clear(); cnt++;
			} else if (l.second >= arr[i].first && l.second <= arr[i].second) {
				cur.clear(); cnt++;
			}
			cur.insert(arr[i]);
		}
		cout << cnt << '\n';
	}
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 1884 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 269 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 269 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 261 ms 1884 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 1884 KB Output isn't correct
2 Halted 0 ms 0 KB -