oj.uz

Submission #104933

# Submission time Handle Problem Language Result Execution time Memory
104933 2019-04-09T19:06:59 Z eriksuenderhauf Wombats (IOI13_wombats) C++11
100 / 100
 3853 ms 177788 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "wombats.h"
//#include "grader.h"
using namespace std;
typedef long long int ll;
const int INF = 1e9 + 7;
const int MAXN = 2005;
const double eps = 1e-9;
int RW, C, root = 0, segSz = 1;
int h[5000][200], v[5000][200], L[MAXN], R[MAXN];
int dp[MAXN][200][200], opt[200];

void merge(int cur) {
	for (int i = 0; i < C; i++) {
		opt[i] = 0;
		for (int j = 0; j < C; j++)
			dp[cur][i][j] = INF;
	}
	for (int i = C - 1; i > -C; i--) {
		for (int j = C + min(-i, 0) - 1; j >= max(-i, 0); j--) {
			int oL = 0, oR = C - 1;
			if (j != max(-i, 0))
				oL = opt[j - 1];
			if (j != C + min(-i, 0) - 1)
				oR = opt[j];
			for (int k = oL; k <= oR; k++) {
				if (dp[cur][j][i + j] > dp[L[cur]][j][k] + dp[R[cur]][k][i + j]) {
					dp[cur][j][i + j] = dp[L[cur]][j][k] + dp[R[cur]][k][i + j];
					opt[j] = k;
				}
			}
		}
	}
}
 
void init(int cur, int l, int r) {
	for (int i = 0; i < C; i++) {
		for (int j = 0; j < C; j++)
			dp[cur][i][j] = INF;
		dp[cur][i][i] = 0;
	}
	for (int k = l; k <= r; k++) {
		for (int i = 0; i < C; i++) {
			for (int j = 1; j < C; j++)
				dp[cur][i][j] = min(dp[cur][i][j], dp[cur][i][j - 1] + h[k][j - 1]);
			for (int j = C - 2; j > -1; j--)
				dp[cur][i][j] = min(dp[cur][i][j], dp[cur][i][j + 1] + h[k][j]);
		}
		for (int i = 0; i < C; i++)
			for (int j = 0; j < C; j++)
				dp[cur][i][j] += v[k][j];
	}
}
 
void upd(int l, int r, int cur, int ind) {
	if (l + 9 >= r) {
		init(cur, l, r);
		return;
	}
	int m = (l + r) / 2;
	if (ind <= m) upd(l, m, L[cur], ind);
	else upd(m + 1, r, R[cur], ind);
	merge(cur);
}
 
void build(int l, int r, int &cur) {
	cur = segSz++;
	if (l + 9 >= r) {
		init(cur, l, r);
		return;
	}
	int m = (l + r) / 2;
	build(l, m, L[cur]);
	build(m + 1, r, R[cur]);
	merge(cur);
}
 
void init(int R1, int C1, int H[5000][200], int V[5000][200]) {
	RW = R1, C = C1;
	for (int i = 0; i < RW; i++)
		for (int j = 0; j + 1 < C; j++)
			h[i][j] = H[i][j];
	for (int i = 0; i + 1 < RW; i++)
		for (int j = 0; j < C; j++)
			v[i][j] = V[i][j];
	build(0, RW - 1, root);
}
 
void changeH(int p, int q, int w) {
	h[p][q] = w;
	upd(0, RW - 1, root, p);
}
 
void changeV(int p, int q, int w) {
	v[p][q] = w;
	upd(0, RW - 1, root, p);
}
 
int escape(int a, int b) {
	return dp[root][a][b];
}

Compilation message

grader.c: In function 'int main()':
grader.c:15:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
  int res;
      ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12644 KB Output is correct
2 Correct 12 ms 12544 KB Output is correct
3 Correct 78 ms 14200 KB Output is correct
4 Correct 12 ms 12544 KB Output is correct
5 Correct 12 ms 12544 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 3 ms 484 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 69 ms 1492 KB Output is correct
12 Correct 3 ms 512 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 3276 KB Output is correct
2 Correct 56 ms 3200 KB Output is correct
3 Correct 68 ms 3320 KB Output is correct
4 Correct 69 ms 3200 KB Output is correct
5 Correct 65 ms 3200 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 270 ms 3296 KB Output is correct
10 Correct 2 ms 384 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 21120 KB Output is correct
2 Correct 23 ms 21112 KB Output is correct
3 Correct 25 ms 21248 KB Output is correct
4 Correct 52 ms 21884 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 3320 KB Output is correct
2 Correct 55 ms 3200 KB Output is correct
3 Correct 70 ms 3304 KB Output is correct
4 Correct 68 ms 3200 KB Output is correct
5 Correct 65 ms 3200 KB Output is correct
6 Correct 20 ms 21248 KB Output is correct
7 Correct 25 ms 21248 KB Output is correct
8 Correct 19 ms 21248 KB Output is correct
9 Correct 51 ms 21880 KB Output is correct
10 Correct 13 ms 12644 KB Output is correct
11 Correct 11 ms 12544 KB Output is correct
12 Correct 75 ms 14196 KB Output is correct
13 Correct 13 ms 12544 KB Output is correct
14 Correct 14 ms 12544 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 3 ms 512 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 3 ms 512 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 3 ms 512 KB Output is correct
25 Correct 68 ms 1532 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 340 ms 3320 KB Output is correct
28 Correct 898 ms 100388 KB Output is correct
29 Correct 985 ms 97668 KB Output is correct
30 Correct 1117 ms 97672 KB Output is correct
31 Correct 1039 ms 101616 KB Output is correct
32 Correct 2 ms 384 KB Output is correct

Subtask #6
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 3260 KB Output is correct
2 Correct 57 ms 3200 KB Output is correct
3 Correct 73 ms 3328 KB Output is correct
4 Correct 74 ms 3200 KB Output is correct
5 Correct 72 ms 3248 KB Output is correct
6 Correct 19 ms 21120 KB Output is correct
7 Correct 19 ms 21248 KB Output is correct
8 Correct 19 ms 21120 KB Output is correct
9 Correct 56 ms 21880 KB Output is correct
10 Correct 12 ms 12544 KB Output is correct
11 Correct 12 ms 12544 KB Output is correct
12 Correct 83 ms 14328 KB Output is correct
13 Correct 17 ms 12544 KB Output is correct
14 Correct 15 ms 12544 KB Output is correct
15 Correct 1138 ms 176256 KB Output is correct
16 Correct 3853 ms 177788 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 2 ms 512 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 65 ms 1400 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 268 ms 3200 KB Output is correct
30 Correct 981 ms 100616 KB Output is correct
31 Correct 3366 ms 177028 KB Output is correct
32 Correct 3298 ms 176980 KB Output is correct
33 Correct 1022 ms 97612 KB Output is correct
34 Correct 3343 ms 174192 KB Output is correct
35 Correct 920 ms 97592 KB Output is correct
36 Correct 3454 ms 174368 KB Output is correct
37 Correct 1066 ms 101520 KB Output is correct
38 Correct 3249 ms 177576 KB Output is correct
39 Correct 2 ms 384 KB Output is correct
40 Correct 3781 ms 174220 KB Output is correct