Submission #1093970

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1093970	2024-09-28T07:44:45 Z	Muhammet	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	13 / 100	323 ms	54908 KB

sortbooks

#include <bits/stdc++.h>

using namespace std;

const int N = 1e6;

int n, m, l[N], r[N], k[N], p[N], a[N];

int main(){
	ios::sync_with_stdio(false); cin.tie(nullptr);
	cin >> n >> m;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
		p[i] = p[i-1] + (a[i] < a[i-1]);
	}
	for(int i = 1; i <= m; i++){
		cin >> l[i] >> r[i] >> k[i];
		if(r[i] - l[i] == 0){
			cout << 1 << '\n';
		}
		else {
			cout << (p[r[i]] - p[l[i]] == 0) << '\n';
		}
	}
}

Subtask #1
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	322 ms	53856 KB	Output is correct
2	Correct	323 ms	54712 KB	Output is correct
3	Correct	309 ms	54608 KB	Output is correct
4	Correct	310 ms	54868 KB	Output is correct
5	Correct	311 ms	54908 KB	Output is correct