Submission #1040312

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1040312	2024-08-01T00:53:45 Z	vjudge1	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	17 / 100	3000 ms	14184 KB

sortbooks

#include<bits/stdc++.h>
#define INF 1e18
#define fi first
#define se second
#define FOR(i, k, n) for(ll i = k; i <= n; i++)
#define FOR1(i, k, n) for(ll i = k; i >= n; i--)
#define pb push_back
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vi vector<int>
#define pii pair<int, int>
#define vii vector<pii>
#define ll long long
#define vll vector<ll>
#define pll pair<ll, ll>
#define re return 0
#define mii map<int, int>
#define input "BAI1.inp"
#define output "BAI1.out"
#define rf 	freopen(input, "r", stdin); freopen(output, "w", stdout)
using namespace std;
const int maxn = 1e6 + 5;
const int mod = 1e9 + 7;
int a[maxn];
int main()
{
	fastio;
	int n, m;
	cin >> n >> m;
	FOR(i, 1, n)
		cin >> a[i];
	while(m--)
	{
		int l, r, x;
		cin >> l >> r >> x;
		int ans = 0;
		int maxx = a[l];
		FOR(i, l + 1, r)
		{
			if(a[i] < maxx)
				ans = max(ans, maxx + a[i]);
			else
				maxx = a[i];
		}
		cout << (ans <= x) << "\n";
	}
	re;
}

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	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	1 ms	492 KB	Output is correct
8	Correct	0 ms	352 KB	Output is correct
9	Correct	0 ms	360 KB	Output is correct
10	Correct	0 ms	352 KB	Output is correct

Subtask #2

9.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	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	1 ms	492 KB	Output is correct
8	Correct	0 ms	352 KB	Output is correct
9	Correct	0 ms	360 KB	Output is correct
10	Correct	0 ms	352 KB	Output is correct
11	Correct	2 ms	348 KB	Output is correct
12	Correct	4 ms	360 KB	Output is correct
13	Correct	4 ms	608 KB	Output is correct
14	Correct	6 ms	608 KB	Output is correct
15	Correct	6 ms	604 KB	Output is correct
16	Correct	10 ms	604 KB	Output is correct
17	Correct	8 ms	592 KB	Output is correct
18	Correct	10 ms	548 KB	Output is correct

Subtask #3

0 / 13.0

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

Subtask #4

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1419 ms	2896 KB	Output is correct
2	Execution timed out	3052 ms	2224 KB	Time limit exceeded
3	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	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	1 ms	492 KB	Output is correct
8	Correct	0 ms	352 KB	Output is correct
9	Correct	0 ms	360 KB	Output is correct
10	Correct	0 ms	352 KB	Output is correct
11	Correct	2 ms	348 KB	Output is correct
12	Correct	4 ms	360 KB	Output is correct
13	Correct	4 ms	608 KB	Output is correct
14	Correct	6 ms	608 KB	Output is correct
15	Correct	6 ms	604 KB	Output is correct
16	Correct	10 ms	604 KB	Output is correct
17	Correct	8 ms	592 KB	Output is correct
18	Correct	10 ms	548 KB	Output is correct
19	Execution timed out	3024 ms	5860 KB	Time limit exceeded
20	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	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	1 ms	492 KB	Output is correct
8	Correct	0 ms	352 KB	Output is correct
9	Correct	0 ms	360 KB	Output is correct
10	Correct	0 ms	352 KB	Output is correct
11	Correct	2 ms	348 KB	Output is correct
12	Correct	4 ms	360 KB	Output is correct
13	Correct	4 ms	608 KB	Output is correct
14	Correct	6 ms	608 KB	Output is correct
15	Correct	6 ms	604 KB	Output is correct
16	Correct	10 ms	604 KB	Output is correct
17	Correct	8 ms	592 KB	Output is correct
18	Correct	10 ms	548 KB	Output is correct
19	Execution timed out	3011 ms	14184 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-