Submission #1047814

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1047814	2024-08-07T16:11:18 Z	TAhmed33	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++	17 / 100	3000 ms	14416 KB

sortbooks

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 25;
int n, q, a[MAXN];
void solve () {
	cin >> n >> q;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	while (q--) {
		int l, r, x; cin >> l >> r >> x;
		int mx = 0; bool flag = 1;
		for (int i = l; i <= r; i++) {
			mx = max(mx, a[i]);
			if (mx > a[i]) {
				flag &= mx + a[i] <= x;
			}
		}
		cout << flag << '\n';
	}
}		
signed main () {
	ios::sync_with_stdio(0); cin.tie(0);
	int tc = 1; //cin >> tc;
	while (tc--) solve();
}

Subtask #1

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct

Subtask #2

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	2 ms	348 KB	Output is correct
12	Correct	3 ms	348 KB	Output is correct
13	Correct	4 ms	604 KB	Output is correct
14	Correct	6 ms	604 KB	Output is correct
15	Correct	7 ms	600 KB	Output is correct
16	Correct	8 ms	604 KB	Output is correct
17	Correct	6 ms	580 KB	Output is correct
18	Correct	10 ms	348 KB	Output is correct

Subtask #3

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	3074 ms	14416 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1532 ms	4640 KB	Output is correct
2	Execution timed out	3025 ms	4188 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	2 ms	348 KB	Output is correct
12	Correct	3 ms	348 KB	Output is correct
13	Correct	4 ms	604 KB	Output is correct
14	Correct	6 ms	604 KB	Output is correct
15	Correct	7 ms	600 KB	Output is correct
16	Correct	8 ms	604 KB	Output is correct
17	Correct	6 ms	580 KB	Output is correct
18	Correct	10 ms	348 KB	Output is correct
19	Execution timed out	3050 ms	7252 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-

Subtask #6

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	2 ms	348 KB	Output is correct
12	Correct	3 ms	348 KB	Output is correct
13	Correct	4 ms	604 KB	Output is correct
14	Correct	6 ms	604 KB	Output is correct
15	Correct	7 ms	600 KB	Output is correct
16	Correct	8 ms	604 KB	Output is correct
17	Correct	6 ms	580 KB	Output is correct
18	Correct	10 ms	348 KB	Output is correct
19	Execution timed out	3074 ms	14416 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-