Submission #1058422

#TimeUsernameProblemLanguageResultExecution timeMemory
1058422vjudge1Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
17 / 100
3073 ms8264 KiB
#include <bits/stdc++.h> #ifdef LOCAL #include "/home/trcmai/code/tools.h" #define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl; #else #define debug(x...) #endif using namespace std; #define all(a) a.begin(), a.end() #define ll long long #define endl '\n' const int N = 1e6 + 6, LOG = 27, MOD = 1e9 + 7; const ll INF = 1e18; int n,q; ll a[N]; signed main() { cin.tie(0)->sync_with_stdio(0); auto solver=[&](){ cin>>n>>q; for(int i = 1;i <= n;++i) cin>>a[i]; while(q--){ int l,r,k; cin>>l>>r>>k; ll temp = 0,temp2 = a[l]; for (int i = l + 1; i <= r; i++){ if (a[i] >= temp2) temp2 = a[i]; else temp = max(temp, temp2 + a[i]); } cout<<(temp <= k ? 1 : 0)<<endl; } }; int t = 1; // cin>>t; while (t--) solver(); }
#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...