oj.uz

Submission #1068994

# Submission time Handle Problem Language Result Execution time Memory
1068994 2024-08-21T14:10:22 Z vjudge1 Wombats (IOI13_wombats) C++17
100 / 100
 6424 ms 177904 KB 
#pragma GCC optimize("O3,unroll-loops")
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
using namespace std;

#include "wombats.h"

#ifndef ROW
#define ROW 5000
#endif

#define COL 200

/* 256 Mb memory - 64 Million Ints
 - one matrix is 200x200 -> max 1600
 block + segtree
Memory - 200^2 * 2 * ceil(5000 / B)
Time Per update - [ 200 * 200 * B + lg[ceil(5000 / B)] * 200 * 200]
	there are 500 updates
Time for Init - [ 200 * 200 * B * ceil(5000 / B) + 200 * 200 * ceil(5000 / B) ]
		= [ 200 * 200 * 5000 + 200 * 200 * ceil(5000 / B) ]
1600 matrix - maybe B = 8, [5000 / B] = 625
*/

constexpr int B = 10;
int nb;

int r, c, h[5009][COL], v[5009][COL];

int L[9999], R[9999], a[1024][COL][COL];

void Unit(int blk) {
	for (int ii = 0; ii < c; ++ii) {
		static int dp[2][COL];
		/* find answer for (V1, V2) where V1 = ii */
		memset(dp[0], 63, sizeof dp[0]);
		dp[0][ii] = 0;
		int I = 0;
		for (int i = L[blk]; i <= R[blk]; ++i, I ^= 1) {
			if (i < r) {
				int pre = 1e9, suf = 1e9;
				for (int j = 0; j < c; ++j) {
					pre = min(pre, dp[I][j] - h[i][j]);
					dp[I][j] = min(dp[I][j], h[i][j] + pre);
				}
				for (int j = c - 1; j >= 0; --j) {
					suf = min(suf, dp[I][j] + h[i][j]);
					dp[I][j] = min(dp[I][j], suf - h[i][j]);
				}
			}
			for (int j = 0; j < c; ++j) dp[!I][j] = dp[I][j] + v[i][j];
		}
		for (int jj = 0; jj < c; ++jj)
			a[blk + nb][ii][jj] = dp[I][jj];
	}
}

void dnc(int l, int r, int optl, int optr, int *down, int *up, int mid[200][200]) {
	if (l > r) return;
	int m = (l + r) / 2;
	int opt = optl, val, val2;
	val = up[opt] + mid[opt][m];
	for (int k = optl + 1; k <= optr; ++k) {
		val2 = up[k] + mid[k][m];
		if (val2 < val) val = val2, opt = k;
	}
	down[m] = val;
	dnc(l, m - 1, optl, opt, down, up, mid);
	dnc(m + 1, r, opt, optr, down, up, mid);
}

void merg(int v) {
	for (int i = 0; i < c; ++i) for (int j = 0; j < c; ++j) a[v][i][j] = 1e9;
	for (int i = 0; i < c; ++i) 
		dnc(0, c - 1, 0, c - 1, a[v][i], a[2 * v][i], a[2 * v + 1]);
}

void init(int R, int C, int H[ROW][200], int V[ROW][200]) {
	r = R, c = C;
	for (int i = 0; i + 1 < r; ++i) for (int j = 0; j < c; ++j) v[i][j] = V[i][j];
	for (int i = 0 ; i < r; ++i) for (int j = 0; j + 1 < c; ++j) h[i][j + 1] = H[i][j] + h[i][j];

	nb = (r + B - 1) / B;
	while ((nb - 1) & nb) ++nb;

    	for (int i = 0; i < nb; ++i) {
    		L[i] = i * B;
    		::R[i] = min(r - 1, i * B + B - 1);
		Unit(i);
    	}
	for (int i = nb; --i; ) merg(i);
}

void update(int p) {
	Unit(p);
	for (p += nb; p /= 2; ) merg(p);
}

void changeH(int P, int Q, int W) {
	int dl = W - h[P][Q + 1] + h[P][Q];
	for (int j = Q + 1; j < c; ++j) h[P][j] += dl;
	update(P / B);
}

void changeV(int P, int Q, int W) {
	v[P][Q] = W;
	update(P / B);
}

int escape(int V1, int V2) { return a[1][V1][V2]; }

Compilation message

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 12636 KB Output is correct
2 Correct 5 ms 12636 KB Output is correct
3 Correct 39 ms 14164 KB Output is correct
4 Correct 5 ms 12572 KB Output is correct
5 Correct 5 ms 12556 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 2476 KB Output is correct
11 Correct 38 ms 1536 KB Output is correct
12 Correct 1 ms 348 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 3156 KB Output is correct
2 Correct 146 ms 3272 KB Output is correct
3 Correct 154 ms 3164 KB Output is correct
4 Correct 150 ms 3160 KB Output is correct
5 Correct 149 ms 3272 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 643 ms 3304 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 21084 KB Output is correct
2 Correct 9 ms 21084 KB Output is correct
3 Correct 10 ms 21084 KB Output is correct
4 Correct 34 ms 21940 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 5204 KB Output is correct
2 Correct 167 ms 3160 KB Output is correct
3 Correct 158 ms 3296 KB Output is correct
4 Correct 166 ms 3296 KB Output is correct
5 Correct 148 ms 3160 KB Output is correct
6 Correct 14 ms 21084 KB Output is correct
7 Correct 8 ms 21084 KB Output is correct
8 Correct 8 ms 21260 KB Output is correct
9 Correct 53 ms 22016 KB Output is correct
10 Correct 6 ms 12632 KB Output is correct
11 Correct 5 ms 12620 KB Output is correct
12 Correct 38 ms 14164 KB Output is correct
13 Correct 7 ms 54360 KB Output is correct
14 Correct 7 ms 54088 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 0 ms 4444 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 41 ms 7432 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 681 ms 10844 KB Output is correct
28 Correct 1476 ms 112412 KB Output is correct
29 Correct 1561 ms 115604 KB Output is correct
30 Correct 1535 ms 108648 KB Output is correct
31 Correct 1580 ms 112184 KB Output is correct
32 Correct 1 ms 6488 KB Output is correct

Subtask #6
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 11000 KB Output is correct
2 Correct 153 ms 10844 KB Output is correct
3 Correct 162 ms 10836 KB Output is correct
4 Correct 150 ms 10844 KB Output is correct
5 Correct 153 ms 11096 KB Output is correct
6 Correct 11 ms 39256 KB Output is correct
7 Correct 8 ms 45400 KB Output is correct
8 Correct 8 ms 45228 KB Output is correct
9 Correct 28 ms 57972 KB Output is correct
10 Correct 6 ms 42076 KB Output is correct
11 Correct 6 ms 42076 KB Output is correct
12 Correct 39 ms 43584 KB Output is correct
13 Correct 5 ms 42072 KB Output is correct
14 Correct 6 ms 42072 KB Output is correct
15 Correct 2117 ms 176252 KB Output is correct
16 Correct 6424 ms 177904 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 4440 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 41 ms 7508 KB Output is correct
28 Correct 1 ms 6488 KB Output is correct
29 Correct 676 ms 10840 KB Output is correct
30 Correct 1492 ms 117048 KB Output is correct
31 Correct 5874 ms 177120 KB Output is correct
32 Correct 6056 ms 176976 KB Output is correct
33 Correct 1622 ms 116664 KB Output is correct
34 Correct 6162 ms 175372 KB Output is correct
35 Correct 1527 ms 115604 KB Output is correct
36 Correct 6087 ms 175220 KB Output is correct
37 Correct 1627 ms 116304 KB Output is correct
38 Correct 6162 ms 177744 KB Output is correct
39 Correct 1 ms 6488 KB Output is correct
40 Correct 6082 ms 175188 KB Output is correct