제출 #966333

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
966333		Acanikolic	Curtains (NOI23_curtains)	C++14	24 / 100	1520 ms	57840 KiB

curtains

#include <bits/stdc++.h>
			 				 
#define pb push_back 
			
#define F first
		 
#define S second

#define int long long 
			 
using namespace std;
			 
const int N = 500000 + 10;
			 
const int mod = 998244353;

const int inf = 1e9;

int res[N],mx[N];
vector<int>segs[N];
vector<pair<int,int>>kveri[N];

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

	int n,m,q;
	cin >> n >> m >> q;
	for(int i = 1; i <= m; i++) {
		int l,r;
		cin >> l >> r;
		segs[r].pb(l);
	}
	for(int i = 1; i <= q; i++) {
		int l,r;
		cin >> l >> r;
		kveri[r].pb({l,i});
	}
	for(int i = 1; i <= n; i++) {
		for(auto X : segs[i]) {
			for(int j = X; j <= i; j++) mx[j] = max(mx[j],X);
		}
		for(auto X : kveri[i]) {
			int mn = inf;
			for(int j = X.F; j <= i; j++) {
				mn = min(mn,mx[j]);
			}
			if(mn >= X.F) res[X.S] = 1;
			else res[X.S] = 0;
		}
	}
	for(int i = 1; i <= q; i++) cout << (res[i] == 1 ? "YES\n" : "NO\n");
	return 0;
}

• Subtask 1: 3 / 3
• Subtask 2: 6 / 6
• Subtask 3: 15 / 15
• Subtask 4: 0 / 20
• Subtask 5: 0 / 36
• Subtask 6: 0 / 20