Submission #1206367

#TimeUsernameProblemLanguageResultExecution timeMemory
1206367LM1Curtains (NOI23_curtains)C++20
0 / 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=2002; 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; sort(p+1,p+m+1); fr(i,0,q){ int x,y;cin>>x>>y; bool ok=0,ok1=1,ok2=0; fr(i,1,m+1){ if(p[i].ss==y)ok2=1; if(p[i].ff==x){ ok=1; continue; } if(ok==1){ if(p[i].ff<=p[i-1].ss+1); else ok1=0; } } if(ok==1 and ok1==1 and ok2==1)cout<<"YES\n"; else cout<<"NO\n"; } } /* 6 2 1 1 2 3 4 1 4 l=0,1,2,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...