oj.uz

Submission #114671

# Submission time Handle Problem Language Result Execution time Memory
114671 2019-06-02T09:01:11 Z E869120 Shortcut (IOI16_shortcut) C++14
0 / 100
 2 ms 1024 KB 
#include "shortcut.h"
#include <bits/stdc++.h>
using namespace std;

// O(N^2 log N) Solution [[71 pts]]

long long N, C, D[3009][3009], A[3009], B[3009], dp[3009];
long long BB[6009], L[6009], LL[6009], L2[6009], FL[6009], FR[6009], Z1[3009][3009], Z2[3009][3009];

void init() {
	N = 0; C = 0;
	for (int i = 0; i < 19; i++) {
		BB[i] = 0; L[i] = 0; A[i] = 0; B[i] = 0; dp[i] = 0; LL[i] = 0; L2[i] = 0;
		for (int j = 0; j < 19; j++) D[i][j] = 0;
	}
}

void initialize() {
	long long ss = 0, sm = -B[0]; FL[0] = 0;
	for (int i = 1; i < N; i++) {
		ss += A[i - 1];
		FL[i] = max(FL[i - 1], (ss + B[i]) - sm);
		sm = min(sm, ss - B[i]);
	}
	
	ss = 0; sm = -B[N - 1]; FR[N - 1] = 0;
	for (int i = N - 2; i >= 0; i--) {
		ss += A[i];
		FR[i] = max(FR[i + 1], (ss + B[i]) - sm);
		sm = min(sm, ss - B[i]);
	}
}

pair<long long, int> vec[100009]; int pl, pr;

long long solve_in(int cl, int cr) {
	if (Z1[cl][cr] >= 1) return Z1[cl][cr] - 1LL;
	
	for (int i = cl; i < cr; i++) { L[i - cl] = A[i]; BB[i - cl] = B[i]; } L[cr - cl] = C; BB[cr - cl] = B[cr];
	int M = (cr - cl + 1), ep = 0;
	ep = 0; for (int i = 0; i <= M * 2; i++) { LL[i + 1] = LL[i] + L[ep]; ep++; if(ep==M) ep = 0; }
	ep = 0; for (int i = 0; i <= M * 2; i++) { L2[i] = LL[i] + BB[ep]; ep++; if(ep==M) ep = 0;}
	
	//printf("LL : "); for (int i = 0; i <= M * 2; i++) printf("% 4lld", LL[i]); printf("\n");
	//printf("L2 : "); for (int i = 0; i <= M * 2; i++) printf("% 4lld", L2[i]); printf("\n");
	long long maxn = 0; for (int i = cl; i <= cr; i++) maxn = max(maxn, B[i]);
	
	int cx = 0; pl = 0; pr = -1;
	for (int i = 0; i < M; i++) {
		while (LL[cx] - LL[i] <= (LL[M] >> 1)) {
			while (pr >= pl && vec[pr].first <= L2[cx]) pr--;
			pr++; vec[pr] = make_pair(L2[cx], cx); 
			cx++;
		}
		if (vec[pl].second == i) pl++;
		if (pr >= pl) {
			//printf("i = %d, cx = %d, right = %d, left = %d\n", i, cx, (int)vec.front().first, (int)(LL[i] - BB[i]));
			maxn = max(maxn, vec[pl].first - (LL[i] - BB[i]));
		}
	}
	
	
	long long el = -(1LL << 60);
	long long sl = 0; for (int i = cl - 1; i >= 0; i--) { sl += A[i]; el = max(el, sl + B[i]); }
	for (int i = cl; i <= cr; i++) {
		maxn = max(maxn, el + B[i] + min(D[cl][i], D[cl][cr] + C - D[cl][i]));
	}
	Z1[cl][cr] = maxn + 1LL;
	return maxn;
}

long long solve_out(int cl, int cr) {
	if (Z2[cl][cr] >= 1LL) return Z2[cl][cr] - 1LL;
	
	long long el = -(1LL << 60), er = -(1LL << 60);
	long long sl = 0; for (int i = cl - 1; i >= 0; i--) { sl += A[i]; el = max(el, sl + B[i]); }
	long long sr = 0; for (int i = cr; i < N - 1; i++) { sr += A[i]; er = max(er, sr + B[i + 1]); }
	long long maxn = 0;
	for (int i = cl; i <= cr; i++) {
		maxn = max(maxn, er + B[i] + min(D[cr][i], D[cl][cr] + C - D[cr][i]));
	}
	maxn = max(maxn, el + er + min(C, D[cl][cr]));
	maxn = max(maxn, FL[cl]);
	maxn = max(maxn, FR[cr]);
	Z2[cl][cr] = maxn + 1LL;
	return maxn;
}

long long find_shortcut2(int n, vector<int>l, vector<int>f, int c) {
	long long ans = (1LL << 60);
	for (int u = 0; u < n; u++) {
		for (int v = u + 1; v < n; v++) {
			vector<vector<long long>> d(n * 2, vector<long long>(n * 2, (1LL<<60)));
			for (int k = 0; k < n * 2; k++) d[k][k] = 0;
			for (int k = 0; k < n - 1; k++) { d[k][k + 1] = l[k]; d[k + 1][k] = l[k]; }
			for (int k = 0; k < n; k++) { d[k][k + n] = f[k]; d[k + n][k] = f[k]; }
			d[u][v] = min(d[u][v], 1LL * c); d[v][u] = min(d[v][u], 1LL * c);
			
			for (int k = 0; k < n * 2; k++) {
				for (int i = 0; i < n * 2; i++) {
					for (int j = 0; j < n * 2; j++) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
				}
			}
			
			long long rem = 0; for (int i = 0; i < n * 2; i++) { for (int j = 0; j < n * 2; j++) rem = max(rem, d[i][j]); }
			ans = min(ans, rem);
		}
	}
	return ans;
}

long long solve_partial(int i) {
	int pl = i + 1, pr = N, pm, cx = N; long long ans = (1LL << 60);
	
	for (int j = 0; j < 13; j++) {
		pm = (pl + pr) / 2;
		long long V1 = solve_in(i, pm);
		long long V2 = solve_out(i, pm);
		if (V1 > V2) { cx = min(cx, pm); pr = pm; }
		else { pl = pm; }
	}
	if (cx >= i + 2) ans = min(ans, max(solve_in(i, cx - 1), solve_out(i, cx - 1)));
	if (cx < N) ans = min(ans, max(solve_in(i, cx), solve_out(i, cx)));
	return ans;
}

long long find_shortcut(int n, vector<int> l, vector<int> d, int c) {
	N = n; C = c;
	for (int i = 0; i < N; i++) { if (i < N - 1) A[i] = l[i]; B[i] = d[i]; }
	for (int i = 0; i < N; i++) {
		long long S = 0;
		for (int j = i + 1; j < N; j++) {
			S += 1LL * l[j - 1];
			D[i][j] = S; D[j][i] = S;
		}
	}
	
	initialize();
	
	/*for (int i = 0; i < n; i++) {
		long long minx = 10000;
		for (int j = 0; j < n; j++) {
			if (i >= j) printf("   ");
			else { printf("% 3lld", max(solve_in(i, j), solve_out(i, j))); minx = min(minx, max(solve_in(i, j), solve_out(i, j))); }
		}
		printf(" : % 3lld\n", minx);
	}*/
	
	long long ans = (1LL << 60);
	long long pl = 0, pr = N - 1, c1, c2;
	for (int i = 0; i < 40; i++) {
		c1 = (pl + pl + pr) / 3;
		c2 = (pl + pr + pr) / 3;
		long long t1 = solve_partial(c1);
		long long t2 = solve_partial(c2);
		if (t1 <= t2) { pr = c2; }
		else { pl = c1; }
		ans = min({ans, t1, t2});
	}
	for (int i = c1 - 4; i <= c1 + 4; i++) {
		if (i < 0 || i >= N - 1) continue;
		ans = min(ans, solve_partial(i));
	}
    return ans;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB n = 4, 80 is a correct answer
2 Correct 2 ms 512 KB n = 9, 110 is a correct answer
3 Correct 2 ms 384 KB n = 4, 21 is a correct answer
4 Correct 2 ms 384 KB n = 3, 4 is a correct answer
5 Correct 2 ms 384 KB n = 2, 62 is a correct answer
6 Correct 2 ms 384 KB n = 2, 3 is a correct answer
7 Correct 2 ms 384 KB n = 3, 29 is a correct answer
8 Correct 2 ms 384 KB n = 2, 3 is a correct answer
9 Correct 2 ms 384 KB n = 2, 3 is a correct answer
10 Correct 2 ms 384 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 384 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 384 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 384 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 384 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 384 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 512 KB n = 10, 1000000343 is a correct answer
18 Correct 2 ms 384 KB n = 10, 3189 is a correct answer
19 Correct 2 ms 384 KB n = 10, 7000000000 is a correct answer
20 Correct 2 ms 384 KB n = 5, 12 is a correct answer
21 Correct 2 ms 384 KB n = 5, 25 is a correct answer
22 Correct 2 ms 384 KB n = 2, 122 is a correct answer
23 Correct 2 ms 512 KB n = 10, 117 is a correct answer
24 Correct 2 ms 512 KB n = 10, 336 is a correct answer
25 Correct 2 ms 512 KB n = 10, 438 is a correct answer
26 Correct 2 ms 512 KB n = 10, 206 is a correct answer
27 Correct 2 ms 512 KB n = 10, 636 is a correct answer
28 Correct 2 ms 384 KB n = 4, 2399 is a correct answer
29 Correct 2 ms 512 KB n = 10, 10992 is a correct answer
30 Correct 2 ms 512 KB n = 10, 3112 is a correct answer
31 Correct 2 ms 1024 KB n = 100, 51000000001 is a correct answer
32 Incorrect 2 ms 768 KB n = 50, incorrect answer: jury 197881272 vs contestant 197881348
33 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB n = 4, 80 is a correct answer
2 Correct 2 ms 512 KB n = 9, 110 is a correct answer
3 Correct 2 ms 384 KB n = 4, 21 is a correct answer
4 Correct 2 ms 384 KB n = 3, 4 is a correct answer
5 Correct 2 ms 384 KB n = 2, 62 is a correct answer
6 Correct 2 ms 384 KB n = 2, 3 is a correct answer
7 Correct 2 ms 384 KB n = 3, 29 is a correct answer
8 Correct 2 ms 384 KB n = 2, 3 is a correct answer
9 Correct 2 ms 384 KB n = 2, 3 is a correct answer
10 Correct 2 ms 384 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 384 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 384 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 384 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 384 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 384 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 512 KB n = 10, 1000000343 is a correct answer
18 Correct 2 ms 384 KB n = 10, 3189 is a correct answer
19 Correct 2 ms 384 KB n = 10, 7000000000 is a correct answer
20 Correct 2 ms 384 KB n = 5, 12 is a correct answer
21 Correct 2 ms 384 KB n = 5, 25 is a correct answer
22 Correct 2 ms 384 KB n = 2, 122 is a correct answer
23 Correct 2 ms 512 KB n = 10, 117 is a correct answer
24 Correct 2 ms 512 KB n = 10, 336 is a correct answer
25 Correct 2 ms 512 KB n = 10, 438 is a correct answer
26 Correct 2 ms 512 KB n = 10, 206 is a correct answer
27 Correct 2 ms 512 KB n = 10, 636 is a correct answer
28 Correct 2 ms 384 KB n = 4, 2399 is a correct answer
29 Correct 2 ms 512 KB n = 10, 10992 is a correct answer
30 Correct 2 ms 512 KB n = 10, 3112 is a correct answer
31 Correct 2 ms 1024 KB n = 100, 51000000001 is a correct answer
32 Incorrect 2 ms 768 KB n = 50, incorrect answer: jury 197881272 vs contestant 197881348
33 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB n = 4, 80 is a correct answer
2 Correct 2 ms 512 KB n = 9, 110 is a correct answer
3 Correct 2 ms 384 KB n = 4, 21 is a correct answer
4 Correct 2 ms 384 KB n = 3, 4 is a correct answer
5 Correct 2 ms 384 KB n = 2, 62 is a correct answer
6 Correct 2 ms 384 KB n = 2, 3 is a correct answer
7 Correct 2 ms 384 KB n = 3, 29 is a correct answer
8 Correct 2 ms 384 KB n = 2, 3 is a correct answer
9 Correct 2 ms 384 KB n = 2, 3 is a correct answer
10 Correct 2 ms 384 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 384 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 384 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 384 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 384 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 384 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 512 KB n = 10, 1000000343 is a correct answer
18 Correct 2 ms 384 KB n = 10, 3189 is a correct answer
19 Correct 2 ms 384 KB n = 10, 7000000000 is a correct answer
20 Correct 2 ms 384 KB n = 5, 12 is a correct answer
21 Correct 2 ms 384 KB n = 5, 25 is a correct answer
22 Correct 2 ms 384 KB n = 2, 122 is a correct answer
23 Correct 2 ms 512 KB n = 10, 117 is a correct answer
24 Correct 2 ms 512 KB n = 10, 336 is a correct answer
25 Correct 2 ms 512 KB n = 10, 438 is a correct answer
26 Correct 2 ms 512 KB n = 10, 206 is a correct answer
27 Correct 2 ms 512 KB n = 10, 636 is a correct answer
28 Correct 2 ms 384 KB n = 4, 2399 is a correct answer
29 Correct 2 ms 512 KB n = 10, 10992 is a correct answer
30 Correct 2 ms 512 KB n = 10, 3112 is a correct answer
31 Correct 2 ms 1024 KB n = 100, 51000000001 is a correct answer
32 Incorrect 2 ms 768 KB n = 50, incorrect answer: jury 197881272 vs contestant 197881348
33 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB n = 4, 80 is a correct answer
2 Correct 2 ms 512 KB n = 9, 110 is a correct answer
3 Correct 2 ms 384 KB n = 4, 21 is a correct answer
4 Correct 2 ms 384 KB n = 3, 4 is a correct answer
5 Correct 2 ms 384 KB n = 2, 62 is a correct answer
6 Correct 2 ms 384 KB n = 2, 3 is a correct answer
7 Correct 2 ms 384 KB n = 3, 29 is a correct answer
8 Correct 2 ms 384 KB n = 2, 3 is a correct answer
9 Correct 2 ms 384 KB n = 2, 3 is a correct answer
10 Correct 2 ms 384 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 384 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 384 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 384 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 384 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 384 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 512 KB n = 10, 1000000343 is a correct answer
18 Correct 2 ms 384 KB n = 10, 3189 is a correct answer
19 Correct 2 ms 384 KB n = 10, 7000000000 is a correct answer
20 Correct 2 ms 384 KB n = 5, 12 is a correct answer
21 Correct 2 ms 384 KB n = 5, 25 is a correct answer
22 Correct 2 ms 384 KB n = 2, 122 is a correct answer
23 Correct 2 ms 512 KB n = 10, 117 is a correct answer
24 Correct 2 ms 512 KB n = 10, 336 is a correct answer
25 Correct 2 ms 512 KB n = 10, 438 is a correct answer
26 Correct 2 ms 512 KB n = 10, 206 is a correct answer
27 Correct 2 ms 512 KB n = 10, 636 is a correct answer
28 Correct 2 ms 384 KB n = 4, 2399 is a correct answer
29 Correct 2 ms 512 KB n = 10, 10992 is a correct answer
30 Correct 2 ms 512 KB n = 10, 3112 is a correct answer
31 Correct 2 ms 1024 KB n = 100, 51000000001 is a correct answer
32 Incorrect 2 ms 768 KB n = 50, incorrect answer: jury 197881272 vs contestant 197881348
33 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB n = 4, 80 is a correct answer
2 Correct 2 ms 512 KB n = 9, 110 is a correct answer
3 Correct 2 ms 384 KB n = 4, 21 is a correct answer
4 Correct 2 ms 384 KB n = 3, 4 is a correct answer
5 Correct 2 ms 384 KB n = 2, 62 is a correct answer
6 Correct 2 ms 384 KB n = 2, 3 is a correct answer
7 Correct 2 ms 384 KB n = 3, 29 is a correct answer
8 Correct 2 ms 384 KB n = 2, 3 is a correct answer
9 Correct 2 ms 384 KB n = 2, 3 is a correct answer
10 Correct 2 ms 384 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 384 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 384 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 384 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 384 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 384 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 512 KB n = 10, 1000000343 is a correct answer
18 Correct 2 ms 384 KB n = 10, 3189 is a correct answer
19 Correct 2 ms 384 KB n = 10, 7000000000 is a correct answer
20 Correct 2 ms 384 KB n = 5, 12 is a correct answer
21 Correct 2 ms 384 KB n = 5, 25 is a correct answer
22 Correct 2 ms 384 KB n = 2, 122 is a correct answer
23 Correct 2 ms 512 KB n = 10, 117 is a correct answer
24 Correct 2 ms 512 KB n = 10, 336 is a correct answer
25 Correct 2 ms 512 KB n = 10, 438 is a correct answer
26 Correct 2 ms 512 KB n = 10, 206 is a correct answer
27 Correct 2 ms 512 KB n = 10, 636 is a correct answer
28 Correct 2 ms 384 KB n = 4, 2399 is a correct answer
29 Correct 2 ms 512 KB n = 10, 10992 is a correct answer
30 Correct 2 ms 512 KB n = 10, 3112 is a correct answer
31 Correct 2 ms 1024 KB n = 100, 51000000001 is a correct answer
32 Incorrect 2 ms 768 KB n = 50, incorrect answer: jury 197881272 vs contestant 197881348
33 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB n = 4, 80 is a correct answer
2 Correct 2 ms 512 KB n = 9, 110 is a correct answer
3 Correct 2 ms 384 KB n = 4, 21 is a correct answer
4 Correct 2 ms 384 KB n = 3, 4 is a correct answer
5 Correct 2 ms 384 KB n = 2, 62 is a correct answer
6 Correct 2 ms 384 KB n = 2, 3 is a correct answer
7 Correct 2 ms 384 KB n = 3, 29 is a correct answer
8 Correct 2 ms 384 KB n = 2, 3 is a correct answer
9 Correct 2 ms 384 KB n = 2, 3 is a correct answer
10 Correct 2 ms 384 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 384 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 384 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 384 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 384 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 384 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 512 KB n = 10, 1000000343 is a correct answer
18 Correct 2 ms 384 KB n = 10, 3189 is a correct answer
19 Correct 2 ms 384 KB n = 10, 7000000000 is a correct answer
20 Correct 2 ms 384 KB n = 5, 12 is a correct answer
21 Correct 2 ms 384 KB n = 5, 25 is a correct answer
22 Correct 2 ms 384 KB n = 2, 122 is a correct answer
23 Correct 2 ms 512 KB n = 10, 117 is a correct answer
24 Correct 2 ms 512 KB n = 10, 336 is a correct answer
25 Correct 2 ms 512 KB n = 10, 438 is a correct answer
26 Correct 2 ms 512 KB n = 10, 206 is a correct answer
27 Correct 2 ms 512 KB n = 10, 636 is a correct answer
28 Correct 2 ms 384 KB n = 4, 2399 is a correct answer
29 Correct 2 ms 512 KB n = 10, 10992 is a correct answer
30 Correct 2 ms 512 KB n = 10, 3112 is a correct answer
31 Correct 2 ms 1024 KB n = 100, 51000000001 is a correct answer
32 Incorrect 2 ms 768 KB n = 50, incorrect answer: jury 197881272 vs contestant 197881348
33 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB n = 4, 80 is a correct answer
2 Correct 2 ms 512 KB n = 9, 110 is a correct answer
3 Correct 2 ms 384 KB n = 4, 21 is a correct answer
4 Correct 2 ms 384 KB n = 3, 4 is a correct answer
5 Correct 2 ms 384 KB n = 2, 62 is a correct answer
6 Correct 2 ms 384 KB n = 2, 3 is a correct answer
7 Correct 2 ms 384 KB n = 3, 29 is a correct answer
8 Correct 2 ms 384 KB n = 2, 3 is a correct answer
9 Correct 2 ms 384 KB n = 2, 3 is a correct answer
10 Correct 2 ms 384 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 384 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 384 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 384 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 384 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 384 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 512 KB n = 10, 1000000343 is a correct answer
18 Correct 2 ms 384 KB n = 10, 3189 is a correct answer
19 Correct 2 ms 384 KB n = 10, 7000000000 is a correct answer
20 Correct 2 ms 384 KB n = 5, 12 is a correct answer
21 Correct 2 ms 384 KB n = 5, 25 is a correct answer
22 Correct 2 ms 384 KB n = 2, 122 is a correct answer
23 Correct 2 ms 512 KB n = 10, 117 is a correct answer
24 Correct 2 ms 512 KB n = 10, 336 is a correct answer
25 Correct 2 ms 512 KB n = 10, 438 is a correct answer
26 Correct 2 ms 512 KB n = 10, 206 is a correct answer
27 Correct 2 ms 512 KB n = 10, 636 is a correct answer
28 Correct 2 ms 384 KB n = 4, 2399 is a correct answer
29 Correct 2 ms 512 KB n = 10, 10992 is a correct answer
30 Correct 2 ms 512 KB n = 10, 3112 is a correct answer
31 Correct 2 ms 1024 KB n = 100, 51000000001 is a correct answer
32 Incorrect 2 ms 768 KB n = 50, incorrect answer: jury 197881272 vs contestant 197881348
33 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB n = 4, 80 is a correct answer
2 Correct 2 ms 512 KB n = 9, 110 is a correct answer
3 Correct 2 ms 384 KB n = 4, 21 is a correct answer
4 Correct 2 ms 384 KB n = 3, 4 is a correct answer
5 Correct 2 ms 384 KB n = 2, 62 is a correct answer
6 Correct 2 ms 384 KB n = 2, 3 is a correct answer
7 Correct 2 ms 384 KB n = 3, 29 is a correct answer
8 Correct 2 ms 384 KB n = 2, 3 is a correct answer
9 Correct 2 ms 384 KB n = 2, 3 is a correct answer
10 Correct 2 ms 384 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 384 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 384 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 384 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 384 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 384 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 512 KB n = 10, 1000000343 is a correct answer
18 Correct 2 ms 384 KB n = 10, 3189 is a correct answer
19 Correct 2 ms 384 KB n = 10, 7000000000 is a correct answer
20 Correct 2 ms 384 KB n = 5, 12 is a correct answer
21 Correct 2 ms 384 KB n = 5, 25 is a correct answer
22 Correct 2 ms 384 KB n = 2, 122 is a correct answer
23 Correct 2 ms 512 KB n = 10, 117 is a correct answer
24 Correct 2 ms 512 KB n = 10, 336 is a correct answer
25 Correct 2 ms 512 KB n = 10, 438 is a correct answer
26 Correct 2 ms 512 KB n = 10, 206 is a correct answer
27 Correct 2 ms 512 KB n = 10, 636 is a correct answer
28 Correct 2 ms 384 KB n = 4, 2399 is a correct answer
29 Correct 2 ms 512 KB n = 10, 10992 is a correct answer
30 Correct 2 ms 512 KB n = 10, 3112 is a correct answer
31 Correct 2 ms 1024 KB n = 100, 51000000001 is a correct answer
32 Incorrect 2 ms 768 KB n = 50, incorrect answer: jury 197881272 vs contestant 197881348
33 Halted 0 ms 0 KB -