Submission #1160557

#TimeUsernameProblemLanguageResultExecution timeMemory
116055712345678Curtains (NOI23_curtains)C++20
20 / 100
237 ms50772 KiB
#include <bits/stdc++.h> using namespace std; const int nx=5e5+5; int n, m, q, dp[2][nx], l, r, lst; set<int> s[nx]; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n>>m>>q; for (int i=1; i<=m; i++) cin>>l>>r, s[r].insert(l); for (int st=1; st<=1; st++) { lst=st-1; for (int i=st; i<=n; i++) { auto itr=s[i].lower_bound(st); if (itr!=s[i].end()&&*itr<=lst+1) { lst=i; dp[st][i]=1; } } } while (q--) { cin>>l>>r; if (dp[l][r]) cout<<"YES\n"; else cout<<"NO\n"; } }
#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...