Submission #1208954

#TimeUsernameProblemLanguageResultExecution timeMemory
1208954qilbyGift Exchange (JOI24_ho_t4)C++20
50 / 100
2592 ms1864 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; const int N = 1000009; int n, q, a[N], b[N], p[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) cin >> b[i]; cin >> q; while (q--) { int ql, qr; cin >> ql >> qr; for (int i = 1; i <= n + n; i++) p[i] = 0; for (int i = ql; i <= qr; i++) p[a[i]]--, p[b[i]]++; bool bad = 0; int x = 0, lst = 0, k = 0; for (int i = 1; i <= n + n; i++) if (p[i] != 0) { k++; x += p[i]; if (x == 0) { if (lst == k - 2) bad = 1; lst = k; } } cout << (bad ? "No" : "Yes") << "\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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...