Submission #499750

#	Time	Username	Problem	Language	Result	Execution time	Memory
499750		The_Samurai	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++98	13 / 100	495 ms	30144 KiB

sortbooks

#include <bits/stdc++.h>
#define fcc ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define sqr(a) (a) * (a)
#define all(x) x.begin(), x.end()
#define rall(x) x.rebgin(), x.rend()
#define pb push_back
#define mp make_pair
#define int long long
#define ff first
#define ss second
#define endl "\n"
using namespace std;

typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef set<int> si;
int a[500009], b[500009];

void solve() {
	int n, m, l, r, k;
	
	cin >> n >> m;
	int a[n + 1];
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	a[0] = 0;
	int dp[n + 1];
	dp[0] = 0;
	for (int i = 1; i <= n; i++) {
		dp[i] = dp[i - 1];
		if (a[i] < a[i - 1]) {
			dp[i]++;
		}
	}
	// 9 9 4 2 3 5
	//
	while (m--) {
		cin >> l >> r >> k;
		if (dp[r] - dp[l] == 0) {
			cout << "1\n";
		}
		else {
			cout << "0\n";
		}
	}
}

signed main() {
	fcc;
    int t = 1;
    
//    cin >> t;
    while (t--) {
    	solve();
    	cout << '\n';
  	}
}

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