oj.uz

Submission #1068920

# Submission time Handle Problem Language Result Execution time Memory
1068920 2024-08-21T13:13:01 Z sleepntsheep Wombats (IOI13_wombats) C++17
76 / 100
 20000 ms 181968 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 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) for (int j = 0; j < c; ++j)
		for (int k = 0; k < c; ++k)
			a[v][i][k] = min(a[v][i][k], a[2 * v][i][j] + a[2 * v + 1][j][k]);
}

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 6 ms 12632 KB Output is correct
2 Correct 8 ms 12624 KB Output is correct
3 Correct 43 ms 14932 KB Output is correct
4 Correct 6 ms 12888 KB Output is correct
5 Correct 9 ms 12660 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 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 0 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 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 57 ms 2364 KB Output is correct
12 Correct 1 ms 436 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 972 ms 3592 KB Output is correct
2 Correct 935 ms 3156 KB Output is correct
3 Correct 983 ms 10844 KB Output is correct
4 Correct 981 ms 8292 KB Output is correct
5 Correct 956 ms 8272 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 424 KB Output is correct
9 Correct 4678 ms 5344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 21336 KB Output is correct
2 Correct 13 ms 21100 KB Output is correct
3 Correct 9 ms 21288 KB Output is correct
4 Correct 31 ms 22528 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 968 ms 5336 KB Output is correct
2 Correct 939 ms 3156 KB Output is correct
3 Correct 1018 ms 5204 KB Output is correct
4 Correct 1043 ms 5348 KB Output is correct
5 Correct 971 ms 5204 KB Output is correct
6 Correct 11 ms 21312 KB Output is correct
7 Correct 10 ms 21084 KB Output is correct
8 Correct 10 ms 21340 KB Output is correct
9 Correct 36 ms 22356 KB Output is correct
10 Correct 5 ms 12636 KB Output is correct
11 Correct 5 ms 12636 KB Output is correct
12 Correct 79 ms 14780 KB Output is correct
13 Correct 6 ms 12636 KB Output is correct
14 Correct 5 ms 12636 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 42 ms 2384 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 4716 ms 8288 KB Output is correct
28 Correct 11513 ms 107764 KB Output is correct
29 Correct 11826 ms 104016 KB Output is correct
30 Correct 11697 ms 104076 KB Output is correct
31 Correct 11711 ms 106032 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 991 ms 10912 KB Output is correct
2 Correct 980 ms 10648 KB Output is correct
3 Correct 1032 ms 10836 KB Output is correct
4 Correct 1002 ms 10836 KB Output is correct
5 Correct 976 ms 10908 KB Output is correct
6 Correct 9 ms 23896 KB Output is correct
7 Correct 6 ms 23388 KB Output is correct
8 Correct 6 ms 23644 KB Output is correct
9 Correct 25 ms 24736 KB Output is correct
10 Correct 5 ms 20056 KB Output is correct
11 Correct 5 ms 20060 KB Output is correct
12 Correct 42 ms 22352 KB Output is correct
13 Correct 7 ms 24152 KB Output is correct
14 Correct 5 ms 24156 KB Output is correct
15 Correct 11072 ms 181764 KB Output is correct
16 Execution timed out 20108 ms 181968 KB Time limit exceeded
17 Halted 0 ms 0 KB -