Submission #679975

#TimeUsernameProblemLanguageResultExecution timeMemory
679975Hacv16Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
17 / 100
3074 ms4808 KiB
#include <bits/stdc++.h> using namespace std; #define fr first #define sc second typedef long long ll; const int MAX = 1e6 + 10; const int INF = 0x3f3f3f3f; int n, m, a[MAX]; int query(int l, int r, int k){ int mx = a[l], t = 0; for(int i = l + 1; i <= r; i++){ if(mx > a[i]) t = max(t, mx + a[i]); mx = max(mx, a[i]); } return (t <= k); } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m; for(int i = 1; i <= n; i++) cin >> a[i]; while(m--){ int l, r, k; cin >> l >> r >> k; cout << query(l, r, k) << '\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...