Submission #1093940

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1093940	2024-09-28T06:24:02 Z	stdfloat	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	8 / 100	3000 ms	39248 KB

sortbooks

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);

	int n, q;
	cin >> n >> q;

	vector<int> a(n);
	for (auto &i : a)
		cin >> i;

	while (q--) {
		int l, r, k;
		cin >> l >> r >> k; l--; r--;

		bool tr = true;
		for (int i = l; i < r && tr; i++) {
			for (int j = i + 1; j <= r && tr; j++)
				if (a[i] > a[j]) tr = (a[i] + a[j] <= k);
		}

		cout << tr << '\n';
	}
}

Subtask #1

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 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	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	12 ms	348 KB	Output is correct
9	Correct	4 ms	468 KB	Output is correct
10	Correct	5 ms	348 KB	Output is correct

Subtask #2

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 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	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	12 ms	348 KB	Output is correct
9	Correct	4 ms	468 KB	Output is correct
10	Correct	5 ms	348 KB	Output is correct
11	Correct	9 ms	348 KB	Output is correct
12	Correct	82 ms	344 KB	Output is correct
13	Correct	58 ms	348 KB	Output is correct
14	Correct	119 ms	600 KB	Output is correct
15	Correct	82 ms	600 KB	Output is correct
16	Execution timed out	3075 ms	556 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-

Subtask #3

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	316 ms	27472 KB	Output is correct
2	Correct	325 ms	39140 KB	Output is correct
3	Correct	326 ms	38968 KB	Output is correct
4	Correct	333 ms	39248 KB	Output is correct
5	Execution timed out	3034 ms	14220 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-

Subtask #4

0 / 17.0

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

Subtask #5

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 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	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	12 ms	348 KB	Output is correct
9	Correct	4 ms	468 KB	Output is correct
10	Correct	5 ms	348 KB	Output is correct
11	Correct	9 ms	348 KB	Output is correct
12	Correct	82 ms	344 KB	Output is correct
13	Correct	58 ms	348 KB	Output is correct
14	Correct	119 ms	600 KB	Output is correct
15	Correct	82 ms	600 KB	Output is correct
16	Execution timed out	3075 ms	556 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-

Subtask #6

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 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	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	12 ms	348 KB	Output is correct
9	Correct	4 ms	468 KB	Output is correct
10	Correct	5 ms	348 KB	Output is correct
11	Correct	9 ms	348 KB	Output is correct
12	Correct	82 ms	344 KB	Output is correct
13	Correct	58 ms	348 KB	Output is correct
14	Correct	119 ms	600 KB	Output is correct
15	Correct	82 ms	600 KB	Output is correct
16	Execution timed out	3075 ms	556 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-