oj.uz

Submission #767917

# Submission time Handle Problem Language Result Execution time Memory
767917 2023-06-27T09:30:42 Z qwerasdfzxcl Two Dishes (JOI19_dishes) C++17
100 / 100
 4997 ms 237408 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{
	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){
			treeB[i] = 1;
			return;
		}
 
		int m = (l+r)>>1;
		init(i<<1, l, m, a); init(i<<1|1, m+1, r, a);
	}
 
	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 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];
	}
 
	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;

struct Fenwick{
	ll a[1001000], tree[1001000];
	int sz;

	void update(int p, ll x){
		ll d = x - a[p];
		a[p] = x;
		while(p<=sz){
			tree[p] += d;
			p += p&-p;
		}
	}

	ll sum(int p){
		ll ret = 0;
		while(p){
			ret += tree[p];
			p ^= p&-p;
		}
		return ret;
	}
}treeV;
 
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(){
	treeV.sz = n+1;
	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);
		}

		treeV.update(i, W[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 + (treeV.sum(x) - treeV.sum(buf[idx].s)); // 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 += (treeV.sum(x) - treeV.sum(buf[idx].s)); // 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) + treeV.a[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);
	treeV.update(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){
	treeV.update(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 480 ms 86276 KB Output is correct
2 Correct 390 ms 86136 KB Output is correct
3 Correct 209 ms 79436 KB Output is correct
4 Correct 326 ms 83984 KB Output is correct
5 Correct 27 ms 47372 KB Output is correct
6 Correct 443 ms 85192 KB Output is correct
7 Correct 88 ms 56024 KB Output is correct
8 Correct 90 ms 71428 KB Output is correct
9 Correct 220 ms 79508 KB Output is correct
10 Correct 459 ms 88784 KB Output is correct
11 Correct 190 ms 79160 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 47440 KB Output is correct
2 Correct 27 ms 47376 KB Output is correct
3 Correct 21 ms 47448 KB Output is correct
4 Correct 28 ms 47444 KB Output is correct
5 Correct 26 ms 47436 KB Output is correct
6 Correct 24 ms 47468 KB Output is correct
7 Correct 25 ms 47468 KB Output is correct
8 Correct 27 ms 47456 KB Output is correct
9 Correct 25 ms 47472 KB Output is correct
10 Correct 26 ms 47436 KB Output is correct
11 Correct 21 ms 47448 KB Output is correct
12 Correct 26 ms 47444 KB Output is correct
13 Correct 23 ms 47444 KB Output is correct
14 Correct 23 ms 47460 KB Output is correct
15 Correct 30 ms 47332 KB Output is correct
16 Correct 25 ms 47388 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 47440 KB Output is correct
2 Correct 27 ms 47376 KB Output is correct
3 Correct 21 ms 47448 KB Output is correct
4 Correct 28 ms 47444 KB Output is correct
5 Correct 26 ms 47436 KB Output is correct
6 Correct 24 ms 47468 KB Output is correct
7 Correct 25 ms 47468 KB Output is correct
8 Correct 27 ms 47456 KB Output is correct
9 Correct 25 ms 47472 KB Output is correct
10 Correct 26 ms 47436 KB Output is correct
11 Correct 21 ms 47448 KB Output is correct
12 Correct 26 ms 47444 KB Output is correct
13 Correct 23 ms 47444 KB Output is correct
14 Correct 23 ms 47460 KB Output is correct
15 Correct 30 ms 47332 KB Output is correct
16 Correct 25 ms 47388 KB Output is correct
17 Correct 25 ms 47852 KB Output is correct
18 Correct 22 ms 47824 KB Output is correct
19 Correct 25 ms 47860 KB Output is correct
20 Correct 29 ms 47828 KB Output is correct
21 Correct 30 ms 47848 KB Output is correct
22 Correct 28 ms 47860 KB Output is correct
23 Correct 26 ms 47828 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 47440 KB Output is correct
2 Correct 27 ms 47376 KB Output is correct
3 Correct 21 ms 47448 KB Output is correct
4 Correct 28 ms 47444 KB Output is correct
5 Correct 26 ms 47436 KB Output is correct
6 Correct 24 ms 47468 KB Output is correct
7 Correct 25 ms 47468 KB Output is correct
8 Correct 27 ms 47456 KB Output is correct
9 Correct 25 ms 47472 KB Output is correct
10 Correct 26 ms 47436 KB Output is correct
11 Correct 21 ms 47448 KB Output is correct
12 Correct 26 ms 47444 KB Output is correct
13 Correct 23 ms 47444 KB Output is correct
14 Correct 23 ms 47460 KB Output is correct
15 Correct 30 ms 47332 KB Output is correct
16 Correct 25 ms 47388 KB Output is correct
17 Correct 25 ms 47852 KB Output is correct
18 Correct 22 ms 47824 KB Output is correct
19 Correct 25 ms 47860 KB Output is correct
20 Correct 29 ms 47828 KB Output is correct
21 Correct 30 ms 47848 KB Output is correct
22 Correct 28 ms 47860 KB Output is correct
23 Correct 26 ms 47828 KB Output is correct
24 Correct 245 ms 83324 KB Output is correct
25 Correct 181 ms 78772 KB Output is correct
26 Correct 277 ms 88756 KB Output is correct
27 Correct 230 ms 78740 KB Output is correct
28 Correct 331 ms 81236 KB Output is correct
29 Correct 182 ms 79156 KB Output is correct
30 Correct 720 ms 86444 KB Output is correct
31 Correct 79 ms 55940 KB Output is correct
32 Correct 138 ms 73440 KB Output is correct
33 Correct 439 ms 82584 KB Output is correct
34 Correct 515 ms 84792 KB Output is correct
35 Correct 690 ms 86320 KB Output is correct
36 Correct 695 ms 86196 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 47440 KB Output is correct
2 Correct 27 ms 47376 KB Output is correct
3 Correct 21 ms 47448 KB Output is correct
4 Correct 28 ms 47444 KB Output is correct
5 Correct 26 ms 47436 KB Output is correct
6 Correct 24 ms 47468 KB Output is correct
7 Correct 25 ms 47468 KB Output is correct
8 Correct 27 ms 47456 KB Output is correct
9 Correct 25 ms 47472 KB Output is correct
10 Correct 26 ms 47436 KB Output is correct
11 Correct 21 ms 47448 KB Output is correct
12 Correct 26 ms 47444 KB Output is correct
13 Correct 23 ms 47444 KB Output is correct
14 Correct 23 ms 47460 KB Output is correct
15 Correct 30 ms 47332 KB Output is correct
16 Correct 25 ms 47388 KB Output is correct
17 Correct 25 ms 47852 KB Output is correct
18 Correct 22 ms 47824 KB Output is correct
19 Correct 25 ms 47860 KB Output is correct
20 Correct 29 ms 47828 KB Output is correct
21 Correct 30 ms 47848 KB Output is correct
22 Correct 28 ms 47860 KB Output is correct
23 Correct 26 ms 47828 KB Output is correct
24 Correct 245 ms 83324 KB Output is correct
25 Correct 181 ms 78772 KB Output is correct
26 Correct 277 ms 88756 KB Output is correct
27 Correct 230 ms 78740 KB Output is correct
28 Correct 331 ms 81236 KB Output is correct
29 Correct 182 ms 79156 KB Output is correct
30 Correct 720 ms 86444 KB Output is correct
31 Correct 79 ms 55940 KB Output is correct
32 Correct 138 ms 73440 KB Output is correct
33 Correct 439 ms 82584 KB Output is correct
34 Correct 515 ms 84792 KB Output is correct
35 Correct 690 ms 86320 KB Output is correct
36 Correct 695 ms 86196 KB Output is correct
37 Correct 282 ms 89092 KB Output is correct
38 Correct 247 ms 79024 KB Output is correct
39 Correct 485 ms 88728 KB Output is correct
40 Correct 464 ms 88796 KB Output is correct
41 Correct 28 ms 47444 KB Output is correct
42 Correct 701 ms 86668 KB Output is correct
43 Correct 459 ms 82680 KB Output is correct
44 Correct 528 ms 84924 KB Output is correct
45 Correct 682 ms 86412 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 47440 KB Output is correct
2 Correct 27 ms 47376 KB Output is correct
3 Correct 21 ms 47448 KB Output is correct
4 Correct 28 ms 47444 KB Output is correct
5 Correct 26 ms 47436 KB Output is correct
6 Correct 24 ms 47468 KB Output is correct
7 Correct 25 ms 47468 KB Output is correct
8 Correct 27 ms 47456 KB Output is correct
9 Correct 25 ms 47472 KB Output is correct
10 Correct 26 ms 47436 KB Output is correct
11 Correct 21 ms 47448 KB Output is correct
12 Correct 26 ms 47444 KB Output is correct
13 Correct 23 ms 47444 KB Output is correct
14 Correct 23 ms 47460 KB Output is correct
15 Correct 30 ms 47332 KB Output is correct
16 Correct 25 ms 47388 KB Output is correct
17 Correct 25 ms 47852 KB Output is correct
18 Correct 22 ms 47824 KB Output is correct
19 Correct 25 ms 47860 KB Output is correct
20 Correct 29 ms 47828 KB Output is correct
21 Correct 30 ms 47848 KB Output is correct
22 Correct 28 ms 47860 KB Output is correct
23 Correct 26 ms 47828 KB Output is correct
24 Correct 245 ms 83324 KB Output is correct
25 Correct 181 ms 78772 KB Output is correct
26 Correct 277 ms 88756 KB Output is correct
27 Correct 230 ms 78740 KB Output is correct
28 Correct 331 ms 81236 KB Output is correct
29 Correct 182 ms 79156 KB Output is correct
30 Correct 720 ms 86444 KB Output is correct
31 Correct 79 ms 55940 KB Output is correct
32 Correct 138 ms 73440 KB Output is correct
33 Correct 439 ms 82584 KB Output is correct
34 Correct 515 ms 84792 KB Output is correct
35 Correct 690 ms 86320 KB Output is correct
36 Correct 695 ms 86196 KB Output is correct
37 Correct 282 ms 89092 KB Output is correct
38 Correct 247 ms 79024 KB Output is correct
39 Correct 485 ms 88728 KB Output is correct
40 Correct 464 ms 88796 KB Output is correct
41 Correct 28 ms 47444 KB Output is correct
42 Correct 701 ms 86668 KB Output is correct
43 Correct 459 ms 82680 KB Output is correct
44 Correct 528 ms 84924 KB Output is correct
45 Correct 682 ms 86412 KB Output is correct
46 Correct 1410 ms 236520 KB Output is correct
47 Correct 1168 ms 191068 KB Output is correct
48 Correct 2448 ms 236696 KB Output is correct
49 Correct 2130 ms 236708 KB Output is correct
50 Correct 4997 ms 225144 KB Output is correct
51 Correct 2633 ms 204852 KB Output is correct
52 Correct 2885 ms 212160 KB Output is correct
53 Correct 4619 ms 224628 KB Output is correct

Subtask #7
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 480 ms 86276 KB Output is correct
2 Correct 390 ms 86136 KB Output is correct
3 Correct 209 ms 79436 KB Output is correct
4 Correct 326 ms 83984 KB Output is correct
5 Correct 27 ms 47372 KB Output is correct
6 Correct 443 ms 85192 KB Output is correct
7 Correct 88 ms 56024 KB Output is correct
8 Correct 90 ms 71428 KB Output is correct
9 Correct 220 ms 79508 KB Output is correct
10 Correct 459 ms 88784 KB Output is correct
11 Correct 190 ms 79160 KB Output is correct
12 Correct 30 ms 47440 KB Output is correct
13 Correct 27 ms 47376 KB Output is correct
14 Correct 21 ms 47448 KB Output is correct
15 Correct 28 ms 47444 KB Output is correct
16 Correct 26 ms 47436 KB Output is correct
17 Correct 24 ms 47468 KB Output is correct
18 Correct 25 ms 47468 KB Output is correct
19 Correct 27 ms 47456 KB Output is correct
20 Correct 25 ms 47472 KB Output is correct
21 Correct 26 ms 47436 KB Output is correct
22 Correct 21 ms 47448 KB Output is correct
23 Correct 26 ms 47444 KB Output is correct
24 Correct 23 ms 47444 KB Output is correct
25 Correct 23 ms 47460 KB Output is correct
26 Correct 30 ms 47332 KB Output is correct
27 Correct 25 ms 47388 KB Output is correct
28 Correct 25 ms 47852 KB Output is correct
29 Correct 22 ms 47824 KB Output is correct
30 Correct 25 ms 47860 KB Output is correct
31 Correct 29 ms 47828 KB Output is correct
32 Correct 30 ms 47848 KB Output is correct
33 Correct 28 ms 47860 KB Output is correct
34 Correct 26 ms 47828 KB Output is correct
35 Correct 245 ms 83324 KB Output is correct
36 Correct 181 ms 78772 KB Output is correct
37 Correct 277 ms 88756 KB Output is correct
38 Correct 230 ms 78740 KB Output is correct
39 Correct 331 ms 81236 KB Output is correct
40 Correct 182 ms 79156 KB Output is correct
41 Correct 720 ms 86444 KB Output is correct
42 Correct 79 ms 55940 KB Output is correct
43 Correct 138 ms 73440 KB Output is correct
44 Correct 439 ms 82584 KB Output is correct
45 Correct 515 ms 84792 KB Output is correct
46 Correct 690 ms 86320 KB Output is correct
47 Correct 695 ms 86196 KB Output is correct
48 Correct 282 ms 89092 KB Output is correct
49 Correct 247 ms 79024 KB Output is correct
50 Correct 485 ms 88728 KB Output is correct
51 Correct 464 ms 88796 KB Output is correct
52 Correct 28 ms 47444 KB Output is correct
53 Correct 701 ms 86668 KB Output is correct
54 Correct 459 ms 82680 KB Output is correct
55 Correct 528 ms 84924 KB Output is correct
56 Correct 682 ms 86412 KB Output is correct
57 Correct 244 ms 85444 KB Output is correct
58 Correct 292 ms 83516 KB Output is correct
59 Correct 346 ms 89272 KB Output is correct
60 Correct 415 ms 85104 KB Output is correct
61 Correct 188 ms 78832 KB Output is correct
62 Correct 26 ms 47464 KB Output is correct
63 Correct 749 ms 87808 KB Output is correct
64 Correct 455 ms 83000 KB Output is correct
65 Correct 595 ms 85676 KB Output is correct
66 Correct 685 ms 87468 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 480 ms 86276 KB Output is correct
2 Correct 390 ms 86136 KB Output is correct
3 Correct 209 ms 79436 KB Output is correct
4 Correct 326 ms 83984 KB Output is correct
5 Correct 27 ms 47372 KB Output is correct
6 Correct 443 ms 85192 KB Output is correct
7 Correct 88 ms 56024 KB Output is correct
8 Correct 90 ms 71428 KB Output is correct
9 Correct 220 ms 79508 KB Output is correct
10 Correct 459 ms 88784 KB Output is correct
11 Correct 190 ms 79160 KB Output is correct
12 Correct 30 ms 47440 KB Output is correct
13 Correct 27 ms 47376 KB Output is correct
14 Correct 21 ms 47448 KB Output is correct
15 Correct 28 ms 47444 KB Output is correct
16 Correct 26 ms 47436 KB Output is correct
17 Correct 24 ms 47468 KB Output is correct
18 Correct 25 ms 47468 KB Output is correct
19 Correct 27 ms 47456 KB Output is correct
20 Correct 25 ms 47472 KB Output is correct
21 Correct 26 ms 47436 KB Output is correct
22 Correct 21 ms 47448 KB Output is correct
23 Correct 26 ms 47444 KB Output is correct
24 Correct 23 ms 47444 KB Output is correct
25 Correct 23 ms 47460 KB Output is correct
26 Correct 30 ms 47332 KB Output is correct
27 Correct 25 ms 47388 KB Output is correct
28 Correct 25 ms 47852 KB Output is correct
29 Correct 22 ms 47824 KB Output is correct
30 Correct 25 ms 47860 KB Output is correct
31 Correct 29 ms 47828 KB Output is correct
32 Correct 30 ms 47848 KB Output is correct
33 Correct 28 ms 47860 KB Output is correct
34 Correct 26 ms 47828 KB Output is correct
35 Correct 245 ms 83324 KB Output is correct
36 Correct 181 ms 78772 KB Output is correct
37 Correct 277 ms 88756 KB Output is correct
38 Correct 230 ms 78740 KB Output is correct
39 Correct 331 ms 81236 KB Output is correct
40 Correct 182 ms 79156 KB Output is correct
41 Correct 720 ms 86444 KB Output is correct
42 Correct 79 ms 55940 KB Output is correct
43 Correct 138 ms 73440 KB Output is correct
44 Correct 439 ms 82584 KB Output is correct
45 Correct 515 ms 84792 KB Output is correct
46 Correct 690 ms 86320 KB Output is correct
47 Correct 695 ms 86196 KB Output is correct
48 Correct 282 ms 89092 KB Output is correct
49 Correct 247 ms 79024 KB Output is correct
50 Correct 485 ms 88728 KB Output is correct
51 Correct 464 ms 88796 KB Output is correct
52 Correct 28 ms 47444 KB Output is correct
53 Correct 701 ms 86668 KB Output is correct
54 Correct 459 ms 82680 KB Output is correct
55 Correct 528 ms 84924 KB Output is correct
56 Correct 682 ms 86412 KB Output is correct
57 Correct 1410 ms 236520 KB Output is correct
58 Correct 1168 ms 191068 KB Output is correct
59 Correct 2448 ms 236696 KB Output is correct
60 Correct 2130 ms 236708 KB Output is correct
61 Correct 4997 ms 225144 KB Output is correct
62 Correct 2633 ms 204852 KB Output is correct
63 Correct 2885 ms 212160 KB Output is correct
64 Correct 4619 ms 224628 KB Output is correct
65 Correct 244 ms 85444 KB Output is correct
66 Correct 292 ms 83516 KB Output is correct
67 Correct 346 ms 89272 KB Output is correct
68 Correct 415 ms 85104 KB Output is correct
69 Correct 188 ms 78832 KB Output is correct
70 Correct 26 ms 47464 KB Output is correct
71 Correct 749 ms 87808 KB Output is correct
72 Correct 455 ms 83000 KB Output is correct
73 Correct 595 ms 85676 KB Output is correct
74 Correct 685 ms 87468 KB Output is correct
75 Correct 1065 ms 221156 KB Output is correct
76 Correct 1447 ms 208428 KB Output is correct
77 Correct 1807 ms 237408 KB Output is correct
78 Correct 2080 ms 221180 KB Output is correct
79 Correct 4909 ms 230080 KB Output is correct
80 Correct 2641 ms 208496 KB Output is correct
81 Correct 3347 ms 216536 KB Output is correct
82 Correct 4678 ms 228768 KB Output is correct
83 Correct 4516 ms 228832 KB Output is correct