제출 #1184765

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1184765		elotelo966	Curtains (NOI23_curtains)	C++20	9 / 100	1595 ms	1864 KiB

curtains

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define OYY LLONG_MAX
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define fi first
#define se second
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define pb push_back
#define lim 1000005

const int mod=1000000007;

int n,m,q;

int curtains[lim][2];

int32_t main(){
	faster
	cin>>n>>m>>q;
	
	for(int i=1;i<=m;i++){
		cin>>curtains[i][0]>>curtains[i][1];
	}
	
	while(q--){
		vector<bool> cur(n+1,0);
		int l,r;cin>>l>>r;
		for(int i=1;i<=m;i++){
			if(l<=curtains[i][0] && curtains[i][0]<=r && l<=curtains[i][1] && curtains[i][1]<=r){
				for(int j=curtains[i][0];j<=curtains[i][1];j++)cur[j]=1;
			}
		}
		
		bool cev=1;
		
		for(int i=1;i<=n && cev;i++){
			if(l<=i && i<=r){
				if(!cur[i])cev=0;
			}
			else{
				if(cur[i])cev=0;
			}
		}
		
		if(cev)cout<<"YES"<<'\n';
		else cout<<"NO"<<'\n';
	}
	
	return 0;
}

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