Submission #1314989

#	Time	Username	Problem	Language	Result	Execution time	Memory
1314989		yus1f_m	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	13 / 100	638 ms	18284 KiB

sortbooks

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
const int sz=100001,INF=1000000000;
using namespace std;
void solve()
{
    ll n,m,num,num1,num2,num3,cnt;
    cin>>n>>m;
    vector<ll>nums,idxs;
    for(int i=0;i<n;i++)
    {
        cin>>num;
        nums.pb(num);
    }
    for(int i=0;i<nums.size()-1;i++)
    {
        if(nums[i]>nums[i+1])
        {
            idxs.pb(i);
        }
    }
    for(int i=0;i<m;i++)
    {
        cin>>num1>>num2>>num3;
        cnt=upper_bound(all(idxs),num2-2)-lower_bound(all(idxs),num1-1);
        if(cnt==0)
        {
            cout<<"1\n";
        }
        else
        {
            cout<<"0\n";
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    ll t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
}

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