제출 #1284872

#제출 시각아이디문제언어결과실행 시간메모리
1284872Muhammad_AneeqGift Exchange (JOI24_ho_t4)C++20
10 / 100
2591 ms5908 KiB
#include <bits/stdc++.h> using namespace std; inline void solve() { int n; cin>>n; int a[n]; for (auto& i:a) cin>>i; int b[n]; for (auto&i:b) cin>>i; int q; cin>>q; while (q--) { int l,r; cin>>l>>r; l--;r--; set<int>s,pri; for (int i=l;i<=r;i++) s.insert(a[i]); bool w=1; for (int i=l;i<=r;i++) { bool pr=(s.find(a[i])!=s.end()); s.erase(a[i]); auto z=s.lower_bound(b[i]); if (z!=s.end()) s.erase(*z); else { z=pri.lower_bound(b[i]); if (z!=pri.end()) { pri.erase(*z); } else { w=0; break; } } if (pr) pri.insert(a[i]); } cout<<(w?"Yes":"No")<<endl; } } int main() { ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); int t=1; for (int i=1;i<=t;i++) { solve(); } }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...