Submission #1159591

#TimeUsernameProblemLanguageResultExecution timeMemory
1159591lopkusHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++20
0 / 100
3095 ms16500 KiB
#include <bits/stdc++.h> #define int long long using namespace std; signed main() { ios::sync_with_stdio(false); cin.tie(0); int n, q; cin >> n >> q; vector<int> a(n + 1); for(int i = 1; i <= n; i++) { cin >> a[i]; } while(q--) { int l, r, x; cin >> l >> r >> x; int ok = 1; vector<int> b = a; sort(b.begin() + l, b.begin() + r + 1); for(int i = l; i <= r; i++) { int idx = - 1; for(int j = i; j <= r; j++) { if(b[i] == a[j]) { idx = j; break; } } while(idx > i) { if(a[idx] + a[idx - 1] > x) { ok = 0; } swap(a[idx], a[idx - 1]); idx -= 1; } } cout << ok << "\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...