oj.uz

Submission #1067994

# Submission time Handle Problem Language Result Execution time Memory
1067994 2024-08-21T06:30:34 Z sleepntsheep Wombats (IOI13_wombats) C++17
76 / 100
 20000 ms 24400 KB 
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <vector>
#include <cassert>
using namespace std;

#include "wombats.h"
#pragma GCC optimize("O3,unroll-loops")

#ifndef ROW
#define ROW 5000
#endif

#define COL 200
constexpr int B = 100;

int r, c, h[ROW][COL], v[ROW + 1][COL];

int L[9999], R[9999], By[9999], a[COL][COL][COL], ans[COL][COL];

void calc(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) {
			static int pre[COL], suf[COL], ph[COL]; /* annoying ahh math */ 
			ph[0] = 0;
			for (int j = 0; j + 1 < c; ++j)
				ph[j + 1] = ph[j] + h[i][j];

			pre[0] = dp[I][0];
			for (int j = 1; j < c; ++j) pre[j] = min(pre[j - 1], dp[I][j] - ph[j]);
			suf[c - 1] = dp[I][c - 1] + ph[c - 1];
			for (int j = c - 2; j >= 0; --j) suf[j] = min(suf[j + 1], dp[I][j] + ph[j]);

			for (int j = 0; j < c; ++j)
				dp[I][j] = min(ph[j] + pre[j], suf[j] - ph[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][ii][jj] = dp[I][jj];
	}
}

void merg(int up[COL][COL], int down[COL][COL], int out[COL][COL]) {
	static int buf[COL][COL];
	for (int i = 0; i < c; ++i) for (int j = 0; j < c; ++j) {
		buf[i][j] = 1e9;
		for (int k = 0; k < c; ++k)
			buf[i][j] = min({buf[i][j], up[i][k]+ down[k][j]});
	}
	for (int i = 0; i < c; ++i) for (int j = 0; j < c; ++j) out[i][j] = buf[i][j];
}

void CalcAns() {
	for (int i = 0; i < c; ++i) for (int j = 0; j < c; ++j) ans[i][j] = a[0][i][j];
	for (int i = 1; i * B < r; ++i)
		merg(ans, a[i], ans);
}

void changeH(int P, int Q, int W) {
	h[P][Q] = W;
	calc(By[P]);
	CalcAns();
}

void changeV(int P, int Q, int W) {
	v[P][Q] = W;
	calc(By[P]);
	CalcAns();
}

void init(int R, int C, int H[ROW][COL], int V[ROW][COL]) {
	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] = H[i][j];

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

	CalcAns();
}

int escape(int V1, int V2) { return ans[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 4 ms 8284 KB Output is correct
2 Correct 3 ms 8284 KB Output is correct
3 Correct 38 ms 10068 KB Output is correct
4 Correct 4 ms 8284 KB Output is correct
5 Correct 4 ms 8284 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

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 0 ms 348 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 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 38 ms 1400 KB Output is correct
12 Correct 1 ms 344 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 920 KB Output is correct
2 Correct 188 ms 916 KB Output is correct
3 Correct 208 ms 856 KB Output is correct
4 Correct 218 ms 860 KB Output is correct
5 Correct 213 ms 856 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 984 ms 920 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 16340 KB Output is correct
2 Correct 9 ms 16220 KB Output is correct
3 Correct 11 ms 16172 KB Output is correct
4 Correct 31 ms 17008 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 860 KB Output is correct
2 Correct 191 ms 860 KB Output is correct
3 Correct 192 ms 924 KB Output is correct
4 Correct 193 ms 860 KB Output is correct
5 Correct 190 ms 860 KB Output is correct
6 Correct 9 ms 16220 KB Output is correct
7 Correct 9 ms 16340 KB Output is correct
8 Correct 9 ms 16220 KB Output is correct
9 Correct 29 ms 16976 KB Output is correct
10 Correct 6 ms 8284 KB Output is correct
11 Correct 4 ms 8284 KB Output is correct
12 Correct 42 ms 10080 KB Output is correct
13 Correct 5 ms 8284 KB Output is correct
14 Correct 4 ms 8524 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 40 ms 1368 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 953 ms 860 KB Output is correct
28 Correct 16123 ms 20676 KB Output is correct
29 Correct 13123 ms 17192 KB Output is correct
30 Correct 13198 ms 16980 KB Output is correct
31 Correct 15947 ms 21588 KB Output is correct
32 Correct 1 ms 344 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 856 KB Output is correct
2 Correct 189 ms 860 KB Output is correct
3 Correct 193 ms 856 KB Output is correct
4 Correct 191 ms 856 KB Output is correct
5 Correct 191 ms 856 KB Output is correct
6 Correct 9 ms 16220 KB Output is correct
7 Correct 8 ms 16228 KB Output is correct
8 Correct 9 ms 16220 KB Output is correct
9 Correct 27 ms 17056 KB Output is correct
10 Correct 4 ms 8284 KB Output is correct
11 Correct 4 ms 8284 KB Output is correct
12 Correct 37 ms 10064 KB Output is correct
13 Correct 4 ms 8284 KB Output is correct
14 Correct 4 ms 8284 KB Output is correct
15 Correct 1797 ms 24048 KB Output is correct
16 Execution timed out 20034 ms 24400 KB Time limit exceeded
17 Halted 0 ms 0 KB -