답안 #497599

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
497599	2021-12-23T10:32:36 Z	ergagan	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	13 / 100	655 ms	22756 KB

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] << " ";
    }
    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
0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	204 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	204 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	539 ms	18000 KB	Output is correct
2	Correct	589 ms	21172 KB	Output is correct
3	Correct	546 ms	21176 KB	Output is correct
4	Correct	655 ms	21152 KB	Output is correct
5	Correct	543 ms	22756 KB	Output is correct