Submission #651212

#TimeUsernameProblemLanguageResultExecution timeMemory
651212owoovoHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
30 / 100
3078 ms16896 KiB
#include<bits/stdc++.h> using namespace std; int main(){ cin.tie(0); ios::sync_with_stdio(0); int n,m; cin>>n>>m; int w[1000010],sortfrom[1000010],fm=0; cin>>w[0]; sortfrom[0]=0; for(int i=1;i<n;i++){ cin>>w[i]; if(w[i]<w[i-1]){ fm=i; } sortfrom[i]=fm; } for(int i=0;i<m;i++){ int l,r,k,isok=1; cin>>l>>r>>k; r--; l--; if(sortfrom[r]<=l){ cout<<"1\n"; continue; } set<int> s; for(int j=r;j>=l;j--){ if(!s.empty()){ set<int>::iterator q=s.lower_bound(w[j]); if(q!=s.begin()){ q--; if(w[j]+*q>k){ cout<<"0\n"; isok=0; break; } } } s.insert(w[j]); } if(isok){ cout<<"1\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...