oj.uz

Submission #767838

# Submission time Handle Problem Language Result Execution time Memory
767838 2023-06-27T08:08:24 Z qwerasdfzxcl Two Dishes (JOI19_dishes) C++17
100 / 100
 6034 ms 304192 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

struct Block{
	int s, e;
	ll a0;

	Block(){}
	Block(int _s, int _e, ll _a0): s(_s), e(_e), a0(_a0) {}
};

vector<Block> buf;

struct Seg{
	ll treeV[2202000], V[1101000];
	int treeB[2202000];

	ll lazyBadd[2202000], lazyBidx[2202000];

	void init(int i, int l, int r, ll a[]){
		lazyBadd[i] = 0, lazyBidx[i] = -1;
		if (l==r){
			V[l] = a[l];
			treeV[i] = a[l];
			treeB[i] = 1;
			return;
		}

		int m = (l+r)>>1;
		init(i<<1, l, m, a); init(i<<1|1, m+1, r, a);
		treeV[i] = treeV[i<<1] + treeV[i<<1|1];
	}

	void propagate(int i, int l, int r){
		if (l==r){
			if (lazyBidx[i]!=-1) treeB[i] = lazyBidx[i];
			if (buf[treeB[i]].s==l) buf[treeB[i]].a0 += lazyBadd[i];
		}

		else{
			if (lazyBidx[i]!=-1){
				lazyBidx[i<<1] = lazyBidx[i];
				lazyBadd[i<<1] = 0;
				lazyBidx[i<<1|1] = lazyBidx[i];
				lazyBadd[i<<1|1] = 0;
			}

			lazyBadd[i<<1] += lazyBadd[i];
			lazyBadd[i<<1|1] += lazyBadd[i];
		}

		lazyBidx[i] = -1;
		lazyBadd[i] = 0;
	}

	void update(int i, int l, int r, int p, int v){
		// propagate(i, l, r);
		if (r<p || p<l) return;
		if (l==r){
			treeV[i] = v;
			V[l] = v;
			return;
		}

		int m = (l+r)>>1;
		update(i<<1, l, m, p, v); update(i<<1|1, m+1, r, p, v);
		treeV[i] = treeV[i<<1] + treeV[i<<1|1];
	}

	void updateB(int i, int l, int r, int s, int e, int x){
		propagate(i, l, r);
		if (r<s || e<l) return;
		if (s<=l && r<=e){
			lazyBidx[i] = x;
			propagate(i, l, r);
			return;
		}

		int m = (l+r)>>1;
		updateB(i<<1, l, m, s, e, x); updateB(i<<1|1, m+1, r, s, e, x);
		// treeV[i] = treeV[i<<1] + treeV[i<<1|1];
	}

	void add(int i, int l, int r, int s, int e, int x){
		propagate(i, l, r);
		if (r<s || e<l) return;
		if (s<=l && r<=e){
			lazyBadd[i] += x;
			propagate(i, l, r);
			return;
		}

		int m = (l+r)>>1;
		add(i<<1, l, m, s, e, x); add(i<<1|1, m+1, r, s, e, x);
		// treeV[i] = treeV[i<<1] + treeV[i<<1|1];
	}

	ll queryV(int i, int l, int r, int s, int e){
		// propagate(i, l, r);
		if (r<s || e<l) return 0;
		if (s<=l && r<=e) return treeV[i];

		int m = (l+r)>>1;
		return queryV(i<<1, l, m, s, e) + queryV(i<<1|1, m+1, r, s, e);
	}

	int queryB(int i, int l, int r, int p){
		propagate(i, l, r);
		if (r<p || p<l) return 0;
		if (l==r) return treeB[i];

		int m = (l+r)>>1;
		return queryB(i<<1, l, m, p) | queryB(i<<1|1, m+1, r, p);
	}
}tree;

int n, m;
ll A[1001000], B[1001000], S[1001000], T[1001000], P[1001000], Q[1001000];
ll sumA[1001000], sumB[1001000], W[1001000], mxA[1001000], mxB[1001000];
vector<int> Vp[1001000], Vm[1001000];

void init(){
	for (int i=1;i<=n;i++) sumA[i] = sumA[i-1] + A[i];
	for (int i=1;i<=m;i++) sumB[i] = sumB[i-1] + B[i];

	for (int i=1;i<=n;i++){
		mxB[i] = upper_bound(sumB, sumB+m+1, S[i] - sumA[i]) - sumB - 1;
		
		if (mxB[i]==-1) W[i] = 0;
		else{
			W[i] = P[i];
			if (W[i] > 0) Vp[mxB[i]].push_back(i);
			else if (W[i] < 0) Vm[mxB[i]].push_back(i);
		}
	}
	for (int i=1;i<=m;i++){
		mxA[i] = upper_bound(sumA, sumA+n+1, T[i] - sumB[i]) - sumA - 1;
	}

	// printf("mxB: ");
	// for (int i=1;i<=n;i++) printf("%lld ", mxB[i]);
	// printf("\nmxA: ");
	// for (int i=1;i<=m;i++) printf("%lld ", mxA[i]);
	// printf("\nW: ");
	// for (int i=1;i<=n;i++) printf("%lld ", W[i]);
	// printf("\n");

	buf.emplace_back();
	buf.emplace_back(0, n, 0);
	tree.init(1, 0, n, W);
}


int getidx(int x){
	int ret = tree.queryB(1, 0, n, x);
	if (x > buf[ret].s) tree.queryB(1, 0, n, buf[ret].s);
	return ret;
}

ll calc(int x, int idx = -1){
	if (idx==-1) idx = getidx(x);
	return buf[idx].a0 + tree.queryV(1, 0, n, buf[idx].s+1, x);
}

void split(int x){
	int idx = getidx(x);
	
	if (buf[idx].s==x) return;

	buf.emplace_back(buf[idx].s, x-1, buf[idx].a0);
	buf[idx].a0 += tree.queryV(1, 0, n, buf[idx].s+1, x);
	buf[idx].s = x;

	tree.updateB(1, 0, n, buf.back().s, x-1, (int)buf.size()-1);
}

void merge(int cur, int nxt){
	buf[cur].e = buf[nxt].e;
	tree.updateB(1, 0, n, buf[nxt].s, buf[nxt].e, cur);
}

void refresh(int x){
	int cur = getidx(x);
	int re = buf[cur].e;

	while(true){
		if (re==n) break;
		
		int nxt = getidx(re+1);
		// printf("cur: (%d, %d, %lld) / nxt: (%d, %d, %lld) / w = %lld\n", buf[cur].s, buf[cur].e, buf[cur].a0, buf[nxt].s, buf[nxt].e, buf[nxt].a0, tree.queryV(1, 0, n, buf[cur].e+1, buf[cur].e+1));
		if (calc(re, cur) + tree.V[re+1] >= buf[nxt].a0) re = buf[nxt].e;
		else break;
	}

	tree.updateB(1, 0, n, buf[cur].e+1, re, cur);
	buf[cur].e = re;
}

void updateXp(int x, int w){ // between x-1 and x
	// printf("updateXp: %d\n", x);
	split(x);
	tree.update(1, 0, n, x, w);
}

void updateYp(int x, int q){
	// printf("updateYp: %d %d\n", x, q);
	tree.add(1, 0, n, 0, x, q);
	refresh(x);
}

void updateYm(int x, int q){
	if (x < n) split(x+1);
	tree.add(1, 0, n, 0, x, q);
}

void updateXm(int x){
	tree.update(1, 0, n, x, 0);
	refresh(x-1);
}


int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	cin >> n >> m;
	for (int i=1;i<=n;i++) cin >> A[i] >> S[i] >> P[i];
	for (int i=1;i<=m;i++) cin >> B[i] >> T[i] >> Q[i];

	init();

	for (int y=1;y<=m;y++){
		for (auto &x:Vp[y-1]) updateXp(x, 0);
		
		if (Q[y] > 0 && mxA[y] >= 0) updateYp(mxA[y], Q[y]);
		else if (Q[y] < 0 && mxA[y] >= 0) updateYm(mxA[y], Q[y]);

		for (auto &x:Vm[y-1]) updateXm(x);
		// for (int x=0;x<=n;x++) printf("%lld ", calc(x));
		// printf("\n");
	}

	printf("%lld\n", calc(n));
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 467 ms 88060 KB Output is correct
2 Correct 447 ms 87612 KB Output is correct
3 Correct 206 ms 80972 KB Output is correct
4 Correct 356 ms 85620 KB Output is correct
5 Correct 25 ms 47344 KB Output is correct
6 Correct 440 ms 86684 KB Output is correct
7 Correct 85 ms 55260 KB Output is correct
8 Correct 85 ms 73096 KB Output is correct
9 Correct 264 ms 80920 KB Output is correct
10 Correct 556 ms 90612 KB Output is correct
11 Correct 182 ms 81064 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 47368 KB Output is correct
2 Correct 26 ms 47344 KB Output is correct
3 Correct 31 ms 47440 KB Output is correct
4 Correct 25 ms 47468 KB Output is correct
5 Correct 26 ms 47360 KB Output is correct
6 Correct 25 ms 47440 KB Output is correct
7 Correct 26 ms 47448 KB Output is correct
8 Correct 25 ms 47464 KB Output is correct
9 Correct 30 ms 47468 KB Output is correct
10 Correct 24 ms 47436 KB Output is correct
11 Correct 25 ms 47468 KB Output is correct
12 Correct 24 ms 47428 KB Output is correct
13 Correct 30 ms 47396 KB Output is correct
14 Correct 30 ms 47364 KB Output is correct
15 Correct 25 ms 47408 KB Output is correct
16 Correct 25 ms 47384 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 47368 KB Output is correct
2 Correct 26 ms 47344 KB Output is correct
3 Correct 31 ms 47440 KB Output is correct
4 Correct 25 ms 47468 KB Output is correct
5 Correct 26 ms 47360 KB Output is correct
6 Correct 25 ms 47440 KB Output is correct
7 Correct 26 ms 47448 KB Output is correct
8 Correct 25 ms 47464 KB Output is correct
9 Correct 30 ms 47468 KB Output is correct
10 Correct 24 ms 47436 KB Output is correct
11 Correct 25 ms 47468 KB Output is correct
12 Correct 24 ms 47428 KB Output is correct
13 Correct 30 ms 47396 KB Output is correct
14 Correct 30 ms 47364 KB Output is correct
15 Correct 25 ms 47408 KB Output is correct
16 Correct 25 ms 47384 KB Output is correct
17 Correct 26 ms 47772 KB Output is correct
18 Correct 26 ms 47700 KB Output is correct
19 Correct 31 ms 47864 KB Output is correct
20 Correct 34 ms 47780 KB Output is correct
21 Correct 32 ms 47828 KB Output is correct
22 Correct 29 ms 47820 KB Output is correct
23 Correct 29 ms 47848 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 47368 KB Output is correct
2 Correct 26 ms 47344 KB Output is correct
3 Correct 31 ms 47440 KB Output is correct
4 Correct 25 ms 47468 KB Output is correct
5 Correct 26 ms 47360 KB Output is correct
6 Correct 25 ms 47440 KB Output is correct
7 Correct 26 ms 47448 KB Output is correct
8 Correct 25 ms 47464 KB Output is correct
9 Correct 30 ms 47468 KB Output is correct
10 Correct 24 ms 47436 KB Output is correct
11 Correct 25 ms 47468 KB Output is correct
12 Correct 24 ms 47428 KB Output is correct
13 Correct 30 ms 47396 KB Output is correct
14 Correct 30 ms 47364 KB Output is correct
15 Correct 25 ms 47408 KB Output is correct
16 Correct 25 ms 47384 KB Output is correct
17 Correct 26 ms 47772 KB Output is correct
18 Correct 26 ms 47700 KB Output is correct
19 Correct 31 ms 47864 KB Output is correct
20 Correct 34 ms 47780 KB Output is correct
21 Correct 32 ms 47828 KB Output is correct
22 Correct 29 ms 47820 KB Output is correct
23 Correct 29 ms 47848 KB Output is correct
24 Correct 262 ms 85048 KB Output is correct
25 Correct 190 ms 80560 KB Output is correct
26 Correct 310 ms 90560 KB Output is correct
27 Correct 213 ms 80584 KB Output is correct
28 Correct 379 ms 83188 KB Output is correct
29 Correct 184 ms 80996 KB Output is correct
30 Correct 829 ms 88136 KB Output is correct
31 Correct 77 ms 55276 KB Output is correct
32 Correct 142 ms 75192 KB Output is correct
33 Correct 533 ms 84396 KB Output is correct
34 Correct 590 ms 86468 KB Output is correct
35 Correct 825 ms 88176 KB Output is correct
36 Correct 845 ms 88156 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 47368 KB Output is correct
2 Correct 26 ms 47344 KB Output is correct
3 Correct 31 ms 47440 KB Output is correct
4 Correct 25 ms 47468 KB Output is correct
5 Correct 26 ms 47360 KB Output is correct
6 Correct 25 ms 47440 KB Output is correct
7 Correct 26 ms 47448 KB Output is correct
8 Correct 25 ms 47464 KB Output is correct
9 Correct 30 ms 47468 KB Output is correct
10 Correct 24 ms 47436 KB Output is correct
11 Correct 25 ms 47468 KB Output is correct
12 Correct 24 ms 47428 KB Output is correct
13 Correct 30 ms 47396 KB Output is correct
14 Correct 30 ms 47364 KB Output is correct
15 Correct 25 ms 47408 KB Output is correct
16 Correct 25 ms 47384 KB Output is correct
17 Correct 26 ms 47772 KB Output is correct
18 Correct 26 ms 47700 KB Output is correct
19 Correct 31 ms 47864 KB Output is correct
20 Correct 34 ms 47780 KB Output is correct
21 Correct 32 ms 47828 KB Output is correct
22 Correct 29 ms 47820 KB Output is correct
23 Correct 29 ms 47848 KB Output is correct
24 Correct 262 ms 85048 KB Output is correct
25 Correct 190 ms 80560 KB Output is correct
26 Correct 310 ms 90560 KB Output is correct
27 Correct 213 ms 80584 KB Output is correct
28 Correct 379 ms 83188 KB Output is correct
29 Correct 184 ms 80996 KB Output is correct
30 Correct 829 ms 88136 KB Output is correct
31 Correct 77 ms 55276 KB Output is correct
32 Correct 142 ms 75192 KB Output is correct
33 Correct 533 ms 84396 KB Output is correct
34 Correct 590 ms 86468 KB Output is correct
35 Correct 825 ms 88176 KB Output is correct
36 Correct 845 ms 88156 KB Output is correct
37 Correct 323 ms 90568 KB Output is correct
38 Correct 230 ms 80540 KB Output is correct
39 Correct 576 ms 90560 KB Output is correct
40 Correct 568 ms 90556 KB Output is correct
41 Correct 26 ms 47444 KB Output is correct
42 Correct 831 ms 88292 KB Output is correct
43 Correct 487 ms 84280 KB Output is correct
44 Correct 602 ms 86400 KB Output is correct
45 Correct 851 ms 88240 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 47368 KB Output is correct
2 Correct 26 ms 47344 KB Output is correct
3 Correct 31 ms 47440 KB Output is correct
4 Correct 25 ms 47468 KB Output is correct
5 Correct 26 ms 47360 KB Output is correct
6 Correct 25 ms 47440 KB Output is correct
7 Correct 26 ms 47448 KB Output is correct
8 Correct 25 ms 47464 KB Output is correct
9 Correct 30 ms 47468 KB Output is correct
10 Correct 24 ms 47436 KB Output is correct
11 Correct 25 ms 47468 KB Output is correct
12 Correct 24 ms 47428 KB Output is correct
13 Correct 30 ms 47396 KB Output is correct
14 Correct 30 ms 47364 KB Output is correct
15 Correct 25 ms 47408 KB Output is correct
16 Correct 25 ms 47384 KB Output is correct
17 Correct 26 ms 47772 KB Output is correct
18 Correct 26 ms 47700 KB Output is correct
19 Correct 31 ms 47864 KB Output is correct
20 Correct 34 ms 47780 KB Output is correct
21 Correct 32 ms 47828 KB Output is correct
22 Correct 29 ms 47820 KB Output is correct
23 Correct 29 ms 47848 KB Output is correct
24 Correct 262 ms 85048 KB Output is correct
25 Correct 190 ms 80560 KB Output is correct
26 Correct 310 ms 90560 KB Output is correct
27 Correct 213 ms 80584 KB Output is correct
28 Correct 379 ms 83188 KB Output is correct
29 Correct 184 ms 80996 KB Output is correct
30 Correct 829 ms 88136 KB Output is correct
31 Correct 77 ms 55276 KB Output is correct
32 Correct 142 ms 75192 KB Output is correct
33 Correct 533 ms 84396 KB Output is correct
34 Correct 590 ms 86468 KB Output is correct
35 Correct 825 ms 88176 KB Output is correct
36 Correct 845 ms 88156 KB Output is correct
37 Correct 323 ms 90568 KB Output is correct
38 Correct 230 ms 80540 KB Output is correct
39 Correct 576 ms 90560 KB Output is correct
40 Correct 568 ms 90556 KB Output is correct
41 Correct 26 ms 47444 KB Output is correct
42 Correct 831 ms 88292 KB Output is correct
43 Correct 487 ms 84280 KB Output is correct
44 Correct 602 ms 86400 KB Output is correct
45 Correct 851 ms 88240 KB Output is correct
46 Correct 1579 ms 244688 KB Output is correct
47 Correct 1149 ms 198720 KB Output is correct
48 Correct 2994 ms 244544 KB Output is correct
49 Correct 2996 ms 244604 KB Output is correct
50 Correct 5459 ms 232896 KB Output is correct
51 Correct 2947 ms 213096 KB Output is correct
52 Correct 3236 ms 219960 KB Output is correct
53 Correct 5413 ms 232520 KB Output is correct

Subtask #7
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 467 ms 88060 KB Output is correct
2 Correct 447 ms 87612 KB Output is correct
3 Correct 206 ms 80972 KB Output is correct
4 Correct 356 ms 85620 KB Output is correct
5 Correct 25 ms 47344 KB Output is correct
6 Correct 440 ms 86684 KB Output is correct
7 Correct 85 ms 55260 KB Output is correct
8 Correct 85 ms 73096 KB Output is correct
9 Correct 264 ms 80920 KB Output is correct
10 Correct 556 ms 90612 KB Output is correct
11 Correct 182 ms 81064 KB Output is correct
12 Correct 25 ms 47368 KB Output is correct
13 Correct 26 ms 47344 KB Output is correct
14 Correct 31 ms 47440 KB Output is correct
15 Correct 25 ms 47468 KB Output is correct
16 Correct 26 ms 47360 KB Output is correct
17 Correct 25 ms 47440 KB Output is correct
18 Correct 26 ms 47448 KB Output is correct
19 Correct 25 ms 47464 KB Output is correct
20 Correct 30 ms 47468 KB Output is correct
21 Correct 24 ms 47436 KB Output is correct
22 Correct 25 ms 47468 KB Output is correct
23 Correct 24 ms 47428 KB Output is correct
24 Correct 30 ms 47396 KB Output is correct
25 Correct 30 ms 47364 KB Output is correct
26 Correct 25 ms 47408 KB Output is correct
27 Correct 25 ms 47384 KB Output is correct
28 Correct 26 ms 47772 KB Output is correct
29 Correct 26 ms 47700 KB Output is correct
30 Correct 31 ms 47864 KB Output is correct
31 Correct 34 ms 47780 KB Output is correct
32 Correct 32 ms 47828 KB Output is correct
33 Correct 29 ms 47820 KB Output is correct
34 Correct 29 ms 47848 KB Output is correct
35 Correct 262 ms 85048 KB Output is correct
36 Correct 190 ms 80560 KB Output is correct
37 Correct 310 ms 90560 KB Output is correct
38 Correct 213 ms 80584 KB Output is correct
39 Correct 379 ms 83188 KB Output is correct
40 Correct 184 ms 80996 KB Output is correct
41 Correct 829 ms 88136 KB Output is correct
42 Correct 77 ms 55276 KB Output is correct
43 Correct 142 ms 75192 KB Output is correct
44 Correct 533 ms 84396 KB Output is correct
45 Correct 590 ms 86468 KB Output is correct
46 Correct 825 ms 88176 KB Output is correct
47 Correct 845 ms 88156 KB Output is correct
48 Correct 323 ms 90568 KB Output is correct
49 Correct 230 ms 80540 KB Output is correct
50 Correct 576 ms 90560 KB Output is correct
51 Correct 568 ms 90556 KB Output is correct
52 Correct 26 ms 47444 KB Output is correct
53 Correct 831 ms 88292 KB Output is correct
54 Correct 487 ms 84280 KB Output is correct
55 Correct 602 ms 86400 KB Output is correct
56 Correct 851 ms 88240 KB Output is correct
57 Correct 258 ms 86256 KB Output is correct
58 Correct 318 ms 84724 KB Output is correct
59 Correct 486 ms 90572 KB Output is correct
60 Correct 472 ms 86268 KB Output is correct
61 Correct 174 ms 79988 KB Output is correct
62 Correct 32 ms 47436 KB Output is correct
63 Correct 836 ms 88956 KB Output is correct
64 Correct 493 ms 98016 KB Output is correct
65 Correct 725 ms 101056 KB Output is correct
66 Correct 821 ms 96440 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 467 ms 88060 KB Output is correct
2 Correct 447 ms 87612 KB Output is correct
3 Correct 206 ms 80972 KB Output is correct
4 Correct 356 ms 85620 KB Output is correct
5 Correct 25 ms 47344 KB Output is correct
6 Correct 440 ms 86684 KB Output is correct
7 Correct 85 ms 55260 KB Output is correct
8 Correct 85 ms 73096 KB Output is correct
9 Correct 264 ms 80920 KB Output is correct
10 Correct 556 ms 90612 KB Output is correct
11 Correct 182 ms 81064 KB Output is correct
12 Correct 25 ms 47368 KB Output is correct
13 Correct 26 ms 47344 KB Output is correct
14 Correct 31 ms 47440 KB Output is correct
15 Correct 25 ms 47468 KB Output is correct
16 Correct 26 ms 47360 KB Output is correct
17 Correct 25 ms 47440 KB Output is correct
18 Correct 26 ms 47448 KB Output is correct
19 Correct 25 ms 47464 KB Output is correct
20 Correct 30 ms 47468 KB Output is correct
21 Correct 24 ms 47436 KB Output is correct
22 Correct 25 ms 47468 KB Output is correct
23 Correct 24 ms 47428 KB Output is correct
24 Correct 30 ms 47396 KB Output is correct
25 Correct 30 ms 47364 KB Output is correct
26 Correct 25 ms 47408 KB Output is correct
27 Correct 25 ms 47384 KB Output is correct
28 Correct 26 ms 47772 KB Output is correct
29 Correct 26 ms 47700 KB Output is correct
30 Correct 31 ms 47864 KB Output is correct
31 Correct 34 ms 47780 KB Output is correct
32 Correct 32 ms 47828 KB Output is correct
33 Correct 29 ms 47820 KB Output is correct
34 Correct 29 ms 47848 KB Output is correct
35 Correct 262 ms 85048 KB Output is correct
36 Correct 190 ms 80560 KB Output is correct
37 Correct 310 ms 90560 KB Output is correct
38 Correct 213 ms 80584 KB Output is correct
39 Correct 379 ms 83188 KB Output is correct
40 Correct 184 ms 80996 KB Output is correct
41 Correct 829 ms 88136 KB Output is correct
42 Correct 77 ms 55276 KB Output is correct
43 Correct 142 ms 75192 KB Output is correct
44 Correct 533 ms 84396 KB Output is correct
45 Correct 590 ms 86468 KB Output is correct
46 Correct 825 ms 88176 KB Output is correct
47 Correct 845 ms 88156 KB Output is correct
48 Correct 323 ms 90568 KB Output is correct
49 Correct 230 ms 80540 KB Output is correct
50 Correct 576 ms 90560 KB Output is correct
51 Correct 568 ms 90556 KB Output is correct
52 Correct 26 ms 47444 KB Output is correct
53 Correct 831 ms 88292 KB Output is correct
54 Correct 487 ms 84280 KB Output is correct
55 Correct 602 ms 86400 KB Output is correct
56 Correct 851 ms 88240 KB Output is correct
57 Correct 1579 ms 244688 KB Output is correct
58 Correct 1149 ms 198720 KB Output is correct
59 Correct 2994 ms 244544 KB Output is correct
60 Correct 2996 ms 244604 KB Output is correct
61 Correct 5459 ms 232896 KB Output is correct
62 Correct 2947 ms 213096 KB Output is correct
63 Correct 3236 ms 219960 KB Output is correct
64 Correct 5413 ms 232520 KB Output is correct
65 Correct 258 ms 86256 KB Output is correct
66 Correct 318 ms 84724 KB Output is correct
67 Correct 486 ms 90572 KB Output is correct
68 Correct 472 ms 86268 KB Output is correct
69 Correct 174 ms 79988 KB Output is correct
70 Correct 32 ms 47436 KB Output is correct
71 Correct 836 ms 88956 KB Output is correct
72 Correct 493 ms 98016 KB Output is correct
73 Correct 725 ms 101056 KB Output is correct
74 Correct 821 ms 96440 KB Output is correct
75 Correct 1143 ms 299996 KB Output is correct
76 Correct 1441 ms 287356 KB Output is correct
77 Correct 2233 ms 303480 KB Output is correct
78 Correct 2393 ms 286516 KB Output is correct
79 Correct 6034 ms 304192 KB Output is correct
80 Correct 2991 ms 282176 KB Output is correct
81 Correct 4073 ms 290712 KB Output is correct
82 Correct 5973 ms 274292 KB Output is correct
83 Correct 5971 ms 294444 KB Output is correct