oj.uz

Submission #1068916

# Submission time Handle Problem Language Result Execution time Memory
1068916 2024-08-21T13:11:46 Z sleepntsheep Wombats (IOI13_wombats) C++17
76 / 100
 20000 ms 106044 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 = 20;
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 5 ms 18008 KB Output is correct
2 Correct 4 ms 18012 KB Output is correct
3 Correct 40 ms 20664 KB Output is correct
4 Correct 4 ms 21848 KB Output is correct
5 Correct 4 ms 21932 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 0 ms 4440 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 42 ms 8864 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 885 ms 8852 KB Output is correct
2 Correct 792 ms 8796 KB Output is correct
3 Correct 886 ms 2128 KB Output is correct
4 Correct 852 ms 1872 KB Output is correct
5 Correct 873 ms 8852 KB Output is correct
6 Correct 1 ms 4524 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 4177 ms 8852 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 18524 KB Output is correct
2 Correct 9 ms 18524 KB Output is correct
3 Correct 11 ms 18524 KB Output is correct
4 Correct 31 ms 19972 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 854 ms 4028 KB Output is correct
2 Correct 812 ms 1880 KB Output is correct
3 Correct 873 ms 8792 KB Output is correct
4 Correct 902 ms 8856 KB Output is correct
5 Correct 845 ms 8856 KB Output is correct
6 Correct 10 ms 24924 KB Output is correct
7 Correct 7 ms 24924 KB Output is correct
8 Correct 7 ms 24924 KB Output is correct
9 Correct 25 ms 22440 KB Output is correct
10 Correct 3 ms 21848 KB Output is correct
11 Correct 4 ms 22108 KB Output is correct
12 Correct 52 ms 24700 KB Output is correct
13 Correct 4 ms 21852 KB Output is correct
14 Correct 4 ms 21852 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 6580 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6488 KB Output is correct
21 Correct 2 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 41 ms 8780 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 4276 ms 7248 KB Output is correct
28 Correct 10907 ms 63980 KB Output is correct
29 Correct 10534 ms 63968 KB Output is correct
30 Correct 10731 ms 63828 KB Output is correct
31 Correct 10646 ms 66136 KB Output is correct
32 Correct 1 ms 6488 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 838 ms 8796 KB Output is correct
2 Correct 791 ms 8632 KB Output is correct
3 Correct 841 ms 8796 KB Output is correct
4 Correct 846 ms 8792 KB Output is correct
5 Correct 816 ms 8856 KB Output is correct
6 Correct 6 ms 24924 KB Output is correct
7 Correct 6 ms 24796 KB Output is correct
8 Correct 7 ms 24920 KB Output is correct
9 Correct 29 ms 26372 KB Output is correct
10 Correct 4 ms 21852 KB Output is correct
11 Correct 4 ms 21852 KB Output is correct
12 Correct 52 ms 24752 KB Output is correct
13 Correct 4 ms 21852 KB Output is correct
14 Correct 4 ms 21852 KB Output is correct
15 Correct 6700 ms 106044 KB Output is correct
16 Execution timed out 20064 ms 100940 KB Time limit exceeded
17 Halted 0 ms 0 KB -