oj.uz

답안 #767826

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
767826 2023-06-27T08:01:38 Z qwerasdfzxcl Two Dishes (JOI19_dishes) C++17
74 / 100
 5490 ms 245236 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 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){
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 521 ms 88616 KB Output is correct
2 Correct 439 ms 88252 KB Output is correct
3 Correct 199 ms 81700 KB Output is correct
4 Correct 352 ms 86216 KB Output is correct
5 Correct 25 ms 47344 KB Output is correct
6 Correct 493 ms 87312 KB Output is correct
7 Correct 101 ms 55656 KB Output is correct
8 Correct 87 ms 73544 KB Output is correct
9 Correct 198 ms 81676 KB Output is correct
10 Correct 508 ms 90872 KB Output is correct
11 Correct 172 ms 81352 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 47340 KB Output is correct
2 Correct 26 ms 47468 KB Output is correct
3 Correct 24 ms 47404 KB Output is correct
4 Correct 24 ms 47444 KB Output is correct
5 Correct 24 ms 47472 KB Output is correct
6 Correct 25 ms 47408 KB Output is correct
7 Correct 25 ms 47472 KB Output is correct
8 Correct 25 ms 47448 KB Output is correct
9 Correct 27 ms 47348 KB Output is correct
10 Correct 25 ms 47332 KB Output is correct
11 Correct 24 ms 47404 KB Output is correct
12 Correct 24 ms 47340 KB Output is correct
13 Correct 24 ms 47472 KB Output is correct
14 Correct 24 ms 47348 KB Output is correct
15 Correct 24 ms 47440 KB Output is correct
16 Correct 23 ms 47448 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 47340 KB Output is correct
2 Correct 26 ms 47468 KB Output is correct
3 Correct 24 ms 47404 KB Output is correct
4 Correct 24 ms 47444 KB Output is correct
5 Correct 24 ms 47472 KB Output is correct
6 Correct 25 ms 47408 KB Output is correct
7 Correct 25 ms 47472 KB Output is correct
8 Correct 25 ms 47448 KB Output is correct
9 Correct 27 ms 47348 KB Output is correct
10 Correct 25 ms 47332 KB Output is correct
11 Correct 24 ms 47404 KB Output is correct
12 Correct 24 ms 47340 KB Output is correct
13 Correct 24 ms 47472 KB Output is correct
14 Correct 24 ms 47348 KB Output is correct
15 Correct 24 ms 47440 KB Output is correct
16 Correct 23 ms 47448 KB Output is correct
17 Correct 25 ms 47804 KB Output is correct
18 Correct 31 ms 47844 KB Output is correct
19 Correct 27 ms 47948 KB Output is correct
20 Correct 26 ms 47844 KB Output is correct
21 Correct 31 ms 47920 KB Output is correct
22 Correct 29 ms 47780 KB Output is correct
23 Correct 28 ms 47784 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 47340 KB Output is correct
2 Correct 26 ms 47468 KB Output is correct
3 Correct 24 ms 47404 KB Output is correct
4 Correct 24 ms 47444 KB Output is correct
5 Correct 24 ms 47472 KB Output is correct
6 Correct 25 ms 47408 KB Output is correct
7 Correct 25 ms 47472 KB Output is correct
8 Correct 25 ms 47448 KB Output is correct
9 Correct 27 ms 47348 KB Output is correct
10 Correct 25 ms 47332 KB Output is correct
11 Correct 24 ms 47404 KB Output is correct
12 Correct 24 ms 47340 KB Output is correct
13 Correct 24 ms 47472 KB Output is correct
14 Correct 24 ms 47348 KB Output is correct
15 Correct 24 ms 47440 KB Output is correct
16 Correct 23 ms 47448 KB Output is correct
17 Correct 25 ms 47804 KB Output is correct
18 Correct 31 ms 47844 KB Output is correct
19 Correct 27 ms 47948 KB Output is correct
20 Correct 26 ms 47844 KB Output is correct
21 Correct 31 ms 47920 KB Output is correct
22 Correct 29 ms 47780 KB Output is correct
23 Correct 28 ms 47784 KB Output is correct
24 Correct 275 ms 85716 KB Output is correct
25 Correct 217 ms 81188 KB Output is correct
26 Correct 288 ms 91216 KB Output is correct
27 Correct 245 ms 81208 KB Output is correct
28 Correct 345 ms 83720 KB Output is correct
29 Correct 187 ms 81552 KB Output is correct
30 Correct 836 ms 88840 KB Output is correct
31 Correct 84 ms 55628 KB Output is correct
32 Correct 142 ms 75552 KB Output is correct
33 Correct 540 ms 85000 KB Output is correct
34 Correct 624 ms 87168 KB Output is correct
35 Correct 852 ms 88556 KB Output is correct
36 Correct 814 ms 88540 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 47340 KB Output is correct
2 Correct 26 ms 47468 KB Output is correct
3 Correct 24 ms 47404 KB Output is correct
4 Correct 24 ms 47444 KB Output is correct
5 Correct 24 ms 47472 KB Output is correct
6 Correct 25 ms 47408 KB Output is correct
7 Correct 25 ms 47472 KB Output is correct
8 Correct 25 ms 47448 KB Output is correct
9 Correct 27 ms 47348 KB Output is correct
10 Correct 25 ms 47332 KB Output is correct
11 Correct 24 ms 47404 KB Output is correct
12 Correct 24 ms 47340 KB Output is correct
13 Correct 24 ms 47472 KB Output is correct
14 Correct 24 ms 47348 KB Output is correct
15 Correct 24 ms 47440 KB Output is correct
16 Correct 23 ms 47448 KB Output is correct
17 Correct 25 ms 47804 KB Output is correct
18 Correct 31 ms 47844 KB Output is correct
19 Correct 27 ms 47948 KB Output is correct
20 Correct 26 ms 47844 KB Output is correct
21 Correct 31 ms 47920 KB Output is correct
22 Correct 29 ms 47780 KB Output is correct
23 Correct 28 ms 47784 KB Output is correct
24 Correct 275 ms 85716 KB Output is correct
25 Correct 217 ms 81188 KB Output is correct
26 Correct 288 ms 91216 KB Output is correct
27 Correct 245 ms 81208 KB Output is correct
28 Correct 345 ms 83720 KB Output is correct
29 Correct 187 ms 81552 KB Output is correct
30 Correct 836 ms 88840 KB Output is correct
31 Correct 84 ms 55628 KB Output is correct
32 Correct 142 ms 75552 KB Output is correct
33 Correct 540 ms 85000 KB Output is correct
34 Correct 624 ms 87168 KB Output is correct
35 Correct 852 ms 88556 KB Output is correct
36 Correct 814 ms 88540 KB Output is correct
37 Correct 318 ms 91244 KB Output is correct
38 Correct 229 ms 81228 KB Output is correct
39 Correct 552 ms 91068 KB Output is correct
40 Correct 525 ms 90988 KB Output is correct
41 Correct 28 ms 47440 KB Output is correct
42 Correct 807 ms 88668 KB Output is correct
43 Correct 498 ms 84804 KB Output is correct
44 Correct 584 ms 86848 KB Output is correct
45 Correct 796 ms 88696 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 47340 KB Output is correct
2 Correct 26 ms 47468 KB Output is correct
3 Correct 24 ms 47404 KB Output is correct
4 Correct 24 ms 47444 KB Output is correct
5 Correct 24 ms 47472 KB Output is correct
6 Correct 25 ms 47408 KB Output is correct
7 Correct 25 ms 47472 KB Output is correct
8 Correct 25 ms 47448 KB Output is correct
9 Correct 27 ms 47348 KB Output is correct
10 Correct 25 ms 47332 KB Output is correct
11 Correct 24 ms 47404 KB Output is correct
12 Correct 24 ms 47340 KB Output is correct
13 Correct 24 ms 47472 KB Output is correct
14 Correct 24 ms 47348 KB Output is correct
15 Correct 24 ms 47440 KB Output is correct
16 Correct 23 ms 47448 KB Output is correct
17 Correct 25 ms 47804 KB Output is correct
18 Correct 31 ms 47844 KB Output is correct
19 Correct 27 ms 47948 KB Output is correct
20 Correct 26 ms 47844 KB Output is correct
21 Correct 31 ms 47920 KB Output is correct
22 Correct 29 ms 47780 KB Output is correct
23 Correct 28 ms 47784 KB Output is correct
24 Correct 275 ms 85716 KB Output is correct
25 Correct 217 ms 81188 KB Output is correct
26 Correct 288 ms 91216 KB Output is correct
27 Correct 245 ms 81208 KB Output is correct
28 Correct 345 ms 83720 KB Output is correct
29 Correct 187 ms 81552 KB Output is correct
30 Correct 836 ms 88840 KB Output is correct
31 Correct 84 ms 55628 KB Output is correct
32 Correct 142 ms 75552 KB Output is correct
33 Correct 540 ms 85000 KB Output is correct
34 Correct 624 ms 87168 KB Output is correct
35 Correct 852 ms 88556 KB Output is correct
36 Correct 814 ms 88540 KB Output is correct
37 Correct 318 ms 91244 KB Output is correct
38 Correct 229 ms 81228 KB Output is correct
39 Correct 552 ms 91068 KB Output is correct
40 Correct 525 ms 90988 KB Output is correct
41 Correct 28 ms 47440 KB Output is correct
42 Correct 807 ms 88668 KB Output is correct
43 Correct 498 ms 84804 KB Output is correct
44 Correct 584 ms 86848 KB Output is correct
45 Correct 796 ms 88696 KB Output is correct
46 Correct 1588 ms 245236 KB Output is correct
47 Correct 1085 ms 199148 KB Output is correct
48 Correct 3057 ms 245032 KB Output is correct
49 Correct 2715 ms 244968 KB Output is correct
50 Correct 5490 ms 233248 KB Output is correct
51 Correct 2844 ms 213264 KB Output is correct
52 Correct 3219 ms 220140 KB Output is correct
53 Correct 5108 ms 232560 KB Output is correct

Subtask #7
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 521 ms 88616 KB Output is correct
2 Correct 439 ms 88252 KB Output is correct
3 Correct 199 ms 81700 KB Output is correct
4 Correct 352 ms 86216 KB Output is correct
5 Correct 25 ms 47344 KB Output is correct
6 Correct 493 ms 87312 KB Output is correct
7 Correct 101 ms 55656 KB Output is correct
8 Correct 87 ms 73544 KB Output is correct
9 Correct 198 ms 81676 KB Output is correct
10 Correct 508 ms 90872 KB Output is correct
11 Correct 172 ms 81352 KB Output is correct
12 Correct 25 ms 47340 KB Output is correct
13 Correct 26 ms 47468 KB Output is correct
14 Correct 24 ms 47404 KB Output is correct
15 Correct 24 ms 47444 KB Output is correct
16 Correct 24 ms 47472 KB Output is correct
17 Correct 25 ms 47408 KB Output is correct
18 Correct 25 ms 47472 KB Output is correct
19 Correct 25 ms 47448 KB Output is correct
20 Correct 27 ms 47348 KB Output is correct
21 Correct 25 ms 47332 KB Output is correct
22 Correct 24 ms 47404 KB Output is correct
23 Correct 24 ms 47340 KB Output is correct
24 Correct 24 ms 47472 KB Output is correct
25 Correct 24 ms 47348 KB Output is correct
26 Correct 24 ms 47440 KB Output is correct
27 Correct 23 ms 47448 KB Output is correct
28 Correct 25 ms 47804 KB Output is correct
29 Correct 31 ms 47844 KB Output is correct
30 Correct 27 ms 47948 KB Output is correct
31 Correct 26 ms 47844 KB Output is correct
32 Correct 31 ms 47920 KB Output is correct
33 Correct 29 ms 47780 KB Output is correct
34 Correct 28 ms 47784 KB Output is correct
35 Correct 275 ms 85716 KB Output is correct
36 Correct 217 ms 81188 KB Output is correct
37 Correct 288 ms 91216 KB Output is correct
38 Correct 245 ms 81208 KB Output is correct
39 Correct 345 ms 83720 KB Output is correct
40 Correct 187 ms 81552 KB Output is correct
41 Correct 836 ms 88840 KB Output is correct
42 Correct 84 ms 55628 KB Output is correct
43 Correct 142 ms 75552 KB Output is correct
44 Correct 540 ms 85000 KB Output is correct
45 Correct 624 ms 87168 KB Output is correct
46 Correct 852 ms 88556 KB Output is correct
47 Correct 814 ms 88540 KB Output is correct
48 Correct 318 ms 91244 KB Output is correct
49 Correct 229 ms 81228 KB Output is correct
50 Correct 552 ms 91068 KB Output is correct
51 Correct 525 ms 90988 KB Output is correct
52 Correct 28 ms 47440 KB Output is correct
53 Correct 807 ms 88668 KB Output is correct
54 Correct 498 ms 84804 KB Output is correct
55 Correct 584 ms 86848 KB Output is correct
56 Correct 796 ms 88696 KB Output is correct
57 Correct 275 ms 86356 KB Output is correct
58 Correct 287 ms 98860 KB Output is correct
59 Correct 409 ms 102592 KB Output is correct
60 Correct 475 ms 98320 KB Output is correct
61 Correct 342 ms 94672 KB Output is correct
62 Correct 25 ms 47380 KB Output is correct
63 Incorrect 890 ms 102900 KB Output isn't correct
64 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 521 ms 88616 KB Output is correct
2 Correct 439 ms 88252 KB Output is correct
3 Correct 199 ms 81700 KB Output is correct
4 Correct 352 ms 86216 KB Output is correct
5 Correct 25 ms 47344 KB Output is correct
6 Correct 493 ms 87312 KB Output is correct
7 Correct 101 ms 55656 KB Output is correct
8 Correct 87 ms 73544 KB Output is correct
9 Correct 198 ms 81676 KB Output is correct
10 Correct 508 ms 90872 KB Output is correct
11 Correct 172 ms 81352 KB Output is correct
12 Correct 25 ms 47340 KB Output is correct
13 Correct 26 ms 47468 KB Output is correct
14 Correct 24 ms 47404 KB Output is correct
15 Correct 24 ms 47444 KB Output is correct
16 Correct 24 ms 47472 KB Output is correct
17 Correct 25 ms 47408 KB Output is correct
18 Correct 25 ms 47472 KB Output is correct
19 Correct 25 ms 47448 KB Output is correct
20 Correct 27 ms 47348 KB Output is correct
21 Correct 25 ms 47332 KB Output is correct
22 Correct 24 ms 47404 KB Output is correct
23 Correct 24 ms 47340 KB Output is correct
24 Correct 24 ms 47472 KB Output is correct
25 Correct 24 ms 47348 KB Output is correct
26 Correct 24 ms 47440 KB Output is correct
27 Correct 23 ms 47448 KB Output is correct
28 Correct 25 ms 47804 KB Output is correct
29 Correct 31 ms 47844 KB Output is correct
30 Correct 27 ms 47948 KB Output is correct
31 Correct 26 ms 47844 KB Output is correct
32 Correct 31 ms 47920 KB Output is correct
33 Correct 29 ms 47780 KB Output is correct
34 Correct 28 ms 47784 KB Output is correct
35 Correct 275 ms 85716 KB Output is correct
36 Correct 217 ms 81188 KB Output is correct
37 Correct 288 ms 91216 KB Output is correct
38 Correct 245 ms 81208 KB Output is correct
39 Correct 345 ms 83720 KB Output is correct
40 Correct 187 ms 81552 KB Output is correct
41 Correct 836 ms 88840 KB Output is correct
42 Correct 84 ms 55628 KB Output is correct
43 Correct 142 ms 75552 KB Output is correct
44 Correct 540 ms 85000 KB Output is correct
45 Correct 624 ms 87168 KB Output is correct
46 Correct 852 ms 88556 KB Output is correct
47 Correct 814 ms 88540 KB Output is correct
48 Correct 318 ms 91244 KB Output is correct
49 Correct 229 ms 81228 KB Output is correct
50 Correct 552 ms 91068 KB Output is correct
51 Correct 525 ms 90988 KB Output is correct
52 Correct 28 ms 47440 KB Output is correct
53 Correct 807 ms 88668 KB Output is correct
54 Correct 498 ms 84804 KB Output is correct
55 Correct 584 ms 86848 KB Output is correct
56 Correct 796 ms 88696 KB Output is correct
57 Correct 1588 ms 245236 KB Output is correct
58 Correct 1085 ms 199148 KB Output is correct
59 Correct 3057 ms 245032 KB Output is correct
60 Correct 2715 ms 244968 KB Output is correct
61 Correct 5490 ms 233248 KB Output is correct
62 Correct 2844 ms 213264 KB Output is correct
63 Correct 3219 ms 220140 KB Output is correct
64 Correct 5108 ms 232560 KB Output is correct
65 Correct 275 ms 86356 KB Output is correct
66 Correct 287 ms 98860 KB Output is correct
67 Correct 409 ms 102592 KB Output is correct
68 Correct 475 ms 98320 KB Output is correct
69 Correct 342 ms 94672 KB Output is correct
70 Correct 25 ms 47380 KB Output is correct
71 Incorrect 890 ms 102900 KB Output isn't correct
72 Halted 0 ms 0 KB -