Submission #1206346

#TimeUsernameProblemLanguageResultExecution timeMemory
1206346LM1Curtains (NOI23_curtains)C++20
3 / 100
1 ms328 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long #define pii pair<int,int> #define ff first #define ss second #define pb push_back #define vi vector<int> #define fr(i,ii,iii) for(int i=ii;i<iii;i++) const int N=202; int n,m,q; pii p[N]; int f[N]; int main(){ ios_base::sync_with_stdio(NULL);cin.tie(NULL); cin>>n>>m>>q; fr(i,1,m+1)cin>>p[i].ff>>p[i].ss; fr(i,0,q){ int x,y;cin>>x>>y; fr(i,1,n+1)f[i]=0; fr(i,1,m+1){ if(p[i].ff>=x and p[i].ss<=y){ f[p[i].ff]++; f[p[i].ss+1]--; } } fr(i,1,n+1){ f[i]+=f[i-1]; } bool ok=1; fr(i,1,n+1){ if(f[i]==0 and i>=x and i<=y){ ok=0; break; } if(f[i]!=0 and (i<x or i>y)){ ok=0; break; } } cout<<(ok?"YES":"NO")<<"\n"; } } /* 6 2 1 1 2 3 4 1 4 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...