# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
493181 | 2021-12-10T10:20:31 Z | irmuun | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++17 | 0 ms | 0 KB |
#include<bits/stdc++.h> using namespace std; #define ll long long int main(){ ll n,m,w[200001],h[200001],l,r,k,ans,i,j,b,c,mx=0; cin>>n>>m; for(i=1;i<=n;i++){ cin>>w[i]; mx=max(mx,w[i]); h[i]=w[i]; } for(i=1;i<=m;i++){ cin>>l>>r>>k; if(k<mn){ c=1; for(j=l+1;j<=r;j++){ if(w[j+1]<w[j]){ c=0; break; } } cout<<c<<endl; continue; } c=0; while(c==0){ c=1; for(j=l;j<r;j++){ if(w[j]+w[j+1]<=k&&w[j]>w[j+1]){ c=0; swap(w[j],w[j+1]); } } } c=1; for(j=l;j<r;j++){ if(w[j]>w[j+1]){ c=0; break; } } cout<<c<<endl; for(j=l;j<=r;j++){ w[j]=h[j]; } } }