Submission #878813

#TimeUsernameProblemLanguageResultExecution timeMemory
878813OAleksaHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
17 / 100
3086 ms18788 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define f first #define s second signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int tt = 1; //cin >> tt; while (tt--) { int n, q; cin >> n >> q; vector<int> a(n); for (int i = 0;i < n;i++) cin >> a[i]; while(q--) { int l, r, k; cin >> l >> r >> k; --l, --r; bool ok = 1; int mx = a[l]; for (int i = l + 1;i <= r;i++) { if (mx > a[i]) ok &= (mx + a[i] <= k); else mx = a[i]; } cout << (ok ? 1 : 0) << '\n'; } } return 0; }
#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...