Submission #683320

#TimeUsernameProblemLanguageResultExecution timeMemory
683320FatihSolakHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
17 / 100
3072 ms34944 KiB
#include <bits/stdc++.h> #define N 1000005 using namespace std; int a[N]; void solve(){ int n,m; cin >> n >> m; for(int i = 1;i<=n;i++){ cin >> a[i]; } for(int i = 1;i<=m;i++){ int l,r,k; cin >> l >> r >> k; set<int> s; bool ok = 1; for(int i = r;i>=l;i--){ if(s.size() && *s.begin() < a[i]){ int val = a[i] + *prev(s.lower_bound(a[i])); if(val > k) ok = 0; } s.insert(a[i]); } cout << ok << '\n'; } } int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); #ifdef Local freopen("in.txt","r",stdin); freopen("out.txt","w",stdout); #endif int t=1; //cin>>t; while(t--){ solve(); } #ifdef Local cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds "; #endif }
#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...