제출 #1279403

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1279403		m.zeeshanrashid	Curtains (NOI23_curtains)	C++20	20 / 100	129 ms	10048 KiB

curtains

#ifdef __AVX2__
#pragma GCC target "avx2"
#endif
#pragma GCC optimize "O3"
#pragma GCC optimize "unroll-loops"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 
using namespace std;
#define int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
#define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector

const int mod=998244353;
// const int mod1=998244353;
// const int mod=1e9+7;
const int N=2e5+5;

int iter=1,itera=1;
void solve(){
	int n,m,q;
	cin>>n>>m>>q;
	vec<int>op(n+1,1e10);
	for(int i=1;i<=m;i++){
		int l,r;
		cin>>l>>r;
		op[r]=min(op[r],l);
	}
	vec<int>p(n+1,0);
	if(op[1]==1) p[1]=1;
	for(int i=1;i<=n;i++){
		p[i]=p[i-1];
		if(op[i]>i) continue;
		if(op[i]==1) p[i]++;
		elif(p[i-1]-p[op[i]-2]>0) p[i]++;
	}
	for(int i=1;i<=q;i++){
		int r;
		cin>>r>>r;
		cout<<(p[r]-p[r-1]?"YES":"NO")<<endl;
	}
}
signed main(){
	// freopen("","r",stdin);
	// freopen("","w",stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); 
	cout.tie(NULL);
	cout<<fixed<<setprecision(20);
	// cin>>itera;
	for(iter=1;iter<=itera;iter++) solve();
}

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