Submission #497602

#	Time	Username	Problem	Language	Result	Execution time	Memory
497602		ergagan	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	30 / 100	1026 ms	18388 KiB

sortbooks

//я так много думал, что опять попал
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define f first
#define s second
#define left(v) v + v
#define right(v) v + v + 1
#define ub upper_bound
#define lb lower_bound
#define pll pair<ll,ll>


//17 SEVENTEEN
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;

const long double Pi = acos(-1.0);
const ll dx[] = {0,0,1,-1};
const ll dy[] = {1,-1,0,0};
const ll N = (ll) 1e6 + 17;
const ll M = (ll) 5e3 + 69;
const ll inf = (ll) 1e14 + 3;
const ll mod = (ll) 1e9 + 7;
ll sq(ll x) { return x * x; }

ll zxc = 1, k, a[N], b[N], p[N];

void solve() {
    ll n, q;
    cin >> n >> q;
    for(ll i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for(ll i = 1; i <= n; i++) {
        p[i] = p[i - 1];
        if(a[i] > a[i + 1]) p[i]++;
//        cout << p[i] << " ";
    }
    if(n <= M) {
        while(q--) {
            ll l, r, k;
            cin >> l >> r >> k;

            ll ok = 1;
            set<ll> st;
            st.insert(a[l]);
            for(ll i = l + 1; i <= r; i++) {
                if(*st.rbegin() > a[i] && *st.rbegin() + a[i] > k) { ok = 0; break; }
                st.insert(a[i]);
            }

            cout << ok << "\n";
        }
        return;
    }
    while(q--) {
        ll l, r, k;
        cin >> l >> r >> k;
        cout << !(p[r - 1] - p[l - 1]) << "\n";
    }
}

int main(/*Уверенно*/) {
ios_base::sync_with_stdio(0);
    cin.tie(0);
/*
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
*/
//    cin >> zxc;
    while(zxc--) {
        solve();
    }
  	return 0;
}
// さよならさ いかなくちゃ

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