Submission #498689

#TimeUsernameProblemLanguageResultExecution timeMemory
498689AbdurahmonHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
17 / 100
3051 ms13220 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; ll t[1000000]; void solve() { int l,r,k;ll m=0; cin>>l>>r>>k; l--;r--; for(int c=l;c<=r;c++) { if(t[c]<m) { if(t[c]+m>k&&c>0) { cout<<"0\n";return; } } else { m=t[c]; } } cout<<"1\n"; } int main() { ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); int n,m; cin>>n>>m; for(int c=0;c<n;c++) { cin>>t[c]; } while(m--) { solve(); } }
#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...