제출 #862329

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
862329		TAhmed33	Osumnjičeni (COCI21_osumnjiceni)	C++98	10 / 110	1062 ms	7276 KiB

Main

#include <bits/stdc++.h>
using namespace std;
bool intersect (pair <int, int> a, pair <int, int> b) {
	return !(a.second < b.first || b.second < a.first);
}
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;
		for (int j = i + 1; j <= n; j++) {
			if (intersect(arr[i], arr[j])) {
				nxt[i] = j - 1;
				break;
			}
		}
		nxt[i] = min(nxt[i], nxt[i + 1]);
	}
	int q;
	cin >> q;
	while (q--) {
		int l, r;
		cin >> l >> r;
		int dp[n + 1] = {};
		for (int i = r; i >= l; i--) {
			if (nxt[i] >= r) {
				dp[i] = 1;
			} else {
				dp[i] = 1 + dp[nxt[i] + 1];
			}
		}
		cout << dp[l] << '\n';
	}
}

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