oj.uz

Submission #643998

# Submission time Handle Problem Language Result Execution time Memory
643998 2022-09-23T12:49:40 Z ymm Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
 3000 ms 262144 KB 
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

const int N = 1'000'010;

struct node {
	vector<ll> srt;
	ll mxs;
} seg[N<<2];
ll a[N];
int n;

void build(int i=0, int b=0, int e=n)
{
	if (e-b == 1) {
		seg[i].srt = {a[b]};
		seg[i].mxs = 0;
		return;
	}
	build(2*i+1, b, (b+e)/2);
	build(2*i+2, (b+e)/2, e);
	seg[i].mxs = max(seg[2*i+1].mxs, seg[2*i+2].mxs);
	auto it = lower_bound(seg[2*i+2].srt.begin(), seg[2*i+2].srt.end(), seg[2*i+1].srt.back());
	if (it != seg[2*i+2].srt.begin())
		seg[i].mxs = max(seg[i].mxs, *--it);
	seg[i].srt.resize(e-b);
	merge(seg[2*i+1].srt.begin(), seg[2*i+1].srt.end(), seg[2*i+2].srt.begin(), seg[2*i+2].srt.end(), seg[i].srt.begin());
}

pll get(int l, int r, ll pre=0, int i=0, int b=0, int e=n)
{
	if (l <= b && e <= r) {
		ll mxs = seg[i].mxs;
		auto it = lower_bound(seg[i].srt.begin(), seg[i].srt.end(), pre);
		if (it != seg[i].srt.begin())
			mxs = max(mxs, pre + *--it);
		ll mx = max(pre, seg[i].srt.back());
		return {mx, mxs};
	}
	if (r <= b || e <= l)
		return {0, 0};
	auto [pre2, ans1] = get(l, r, pre , 2*i+1, b, (b+e)/2);
	auto [pre3, ans2] = get(l, r, pre2, 2*i+2, (b+e)/2, e);
	return {pre3, max(ans1, ans2)};
}

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	int q;
	cin >> n >> q;
	Loop (i,0,n)
		cin >> a[i];
	build();
	Loop (i,0,q) {
		int l, r, k;
		cin >> l >> r >> k;
		ll mx=0, mxs=0;
		--l;
		Loop (i,l,r) {
			if (a[i] >= mx)
				mx = a[i];
			else
				mxs = max(a[i]+mx, mxs);
		}
		//int x = get(l, r).second;
		cout << (mxs <= k) << '\n';
	}
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 125560 KB Output is correct
2 Correct 55 ms 125548 KB Output is correct
3 Correct 57 ms 125448 KB Output is correct
4 Correct 58 ms 125452 KB Output is correct
5 Correct 68 ms 125572 KB Output is correct
6 Correct 57 ms 125568 KB Output is correct
7 Correct 66 ms 125620 KB Output is correct
8 Correct 57 ms 125632 KB Output is correct
9 Correct 57 ms 125568 KB Output is correct
10 Correct 60 ms 125564 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 125560 KB Output is correct
2 Correct 55 ms 125548 KB Output is correct
3 Correct 57 ms 125448 KB Output is correct
4 Correct 58 ms 125452 KB Output is correct
5 Correct 68 ms 125572 KB Output is correct
6 Correct 57 ms 125568 KB Output is correct
7 Correct 66 ms 125620 KB Output is correct
8 Correct 57 ms 125632 KB Output is correct
9 Correct 57 ms 125568 KB Output is correct
10 Correct 60 ms 125564 KB Output is correct
11 Correct 64 ms 125824 KB Output is correct
12 Correct 63 ms 126308 KB Output is correct
13 Correct 64 ms 126312 KB Output is correct
14 Correct 70 ms 126388 KB Output is correct
15 Correct 67 ms 126420 KB Output is correct
16 Correct 77 ms 126336 KB Output is correct
17 Correct 67 ms 126280 KB Output is correct
18 Correct 74 ms 126352 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 322 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2650 ms 144136 KB Output is correct
2 Execution timed out 3071 ms 145140 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 125560 KB Output is correct
2 Correct 55 ms 125548 KB Output is correct
3 Correct 57 ms 125448 KB Output is correct
4 Correct 58 ms 125452 KB Output is correct
5 Correct 68 ms 125572 KB Output is correct
6 Correct 57 ms 125568 KB Output is correct
7 Correct 66 ms 125620 KB Output is correct
8 Correct 57 ms 125632 KB Output is correct
9 Correct 57 ms 125568 KB Output is correct
10 Correct 60 ms 125564 KB Output is correct
11 Correct 64 ms 125824 KB Output is correct
12 Correct 63 ms 126308 KB Output is correct
13 Correct 64 ms 126312 KB Output is correct
14 Correct 70 ms 126388 KB Output is correct
15 Correct 67 ms 126420 KB Output is correct
16 Correct 77 ms 126336 KB Output is correct
17 Correct 67 ms 126280 KB Output is correct
18 Correct 74 ms 126352 KB Output is correct
19 Execution timed out 3065 ms 167368 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 125560 KB Output is correct
2 Correct 55 ms 125548 KB Output is correct
3 Correct 57 ms 125448 KB Output is correct
4 Correct 58 ms 125452 KB Output is correct
5 Correct 68 ms 125572 KB Output is correct
6 Correct 57 ms 125568 KB Output is correct
7 Correct 66 ms 125620 KB Output is correct
8 Correct 57 ms 125632 KB Output is correct
9 Correct 57 ms 125568 KB Output is correct
10 Correct 60 ms 125564 KB Output is correct
11 Correct 64 ms 125824 KB Output is correct
12 Correct 63 ms 126308 KB Output is correct
13 Correct 64 ms 126312 KB Output is correct
14 Correct 70 ms 126388 KB Output is correct
15 Correct 67 ms 126420 KB Output is correct
16 Correct 77 ms 126336 KB Output is correct
17 Correct 67 ms 126280 KB Output is correct
18 Correct 74 ms 126352 KB Output is correct
19 Runtime error 322 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -