제출 #1071395

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1071395		vjudge1	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	17 / 100	3050 ms	6488 KiB

sortbooks

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sz size
#define mp make_pair
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fre(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define s second
#define f first
#define ii pair<ll,ll>
const ll mod=1e9+7;
const int N=2e5+6;
const ll inf=1e12+5;      
ll n,l,r,m,k,d[N],g[N],mx=-N;
int main() 
{
    ios
    cin>>n>>k;
    for(int i=1;i<=n;++i)
    {
        cin>>d[i];
    }
    while(k--)
    {
        cin>>l>>r>>m;
        ll x=d[l],cnt=0;
        for(int i=l+1;i<=r;++i)
        {
                if(d[i]<x)
                {
                    cnt=max(cnt,d[i]+x);
                }
                else x=d[i];
            }
            if(cnt<=m){
                cout<<1<<"\n";
            }
            else cout<<0<<"\n";
        }
}

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