Submission #344951

#	Time	Username	Problem	Language	Result	Execution time	Memory
344951		kkk	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	8 / 100	3066 ms	3692 KiB

sortbooks

#include<iostream>
#include<cstring>
#define endl '\n'
using namespace std;
long long a[100003],d[100003],used[5002];

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    long long n,m,l,r,k,lpr=0,rpr,i,j;
    bool p;
    cin>>n>>m;rpr=n-1;
    for(i=0;i<n;i++)
    {
        cin>>d[i];
    }
    for(i=0;i<m;i++)
    {
        cin>>l>>r>>k;
        l--;r--;
        for(j=lpr;j<=rpr;j++)
        {
            a[j]=d[j];
        }
        lpr=l;rpr=r;
        p=true;
        while(p)
        {
            p=false;
            for(j=l;j<r;j++)
            {
                if(a[j]>a[j+1]&&a[j]+a[j+1]<=k){swap(a[j],a[j+1]);p=true;}
                else if(a[j]>a[j+1]&&a[j]+a[j+1]>k){p=false;break;}
            }
        }
        if(l==r ){cout<<1<<endl;continue;}
      
        bool t=false;
        for(j=l+1;j<=r;j++)
        {
            if(a[j]<a[j-1]){cout<<0<<endl;t=true;break;}
        }
        if(!t)cout<<1<<endl;


    }

}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23