oj.uz

Submission #1068002

# Submission time Handle Problem Language Result Execution time Memory
1068002 2024-08-21T06:34:09 Z sleepntsheep Wombats (IOI13_wombats) C++17
55 / 100
 20000 ms 18024 KB 
#pragma GCC optimize("O3,unroll-loops")
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <vector>
#include <cassert>
using namespace std;

#include "wombats.h"

#ifndef ROW
#define ROW 5000
#endif

#define COL 200
constexpr int B = 500;

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 5 ms 8280 KB Output is correct
2 Correct 6 ms 8280 KB Output is correct
3 Correct 41 ms 9864 KB Output is correct
4 Correct 10 ms 8284 KB Output is correct
5 Correct 5 ms 8280 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 1 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 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 344 KB Output is correct
11 Correct 38 ms 1360 KB Output is correct
12 Correct 0 ms 344 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 778 ms 920 KB Output is correct
2 Correct 702 ms 856 KB Output is correct
3 Correct 788 ms 940 KB Output is correct
4 Correct 809 ms 920 KB Output is correct
5 Correct 748 ms 924 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 3941 ms 928 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 16 ms 15964 KB Output is correct
2 Correct 16 ms 15964 KB Output is correct
3 Correct 16 ms 15960 KB Output is correct
4 Correct 39 ms 16948 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 785 ms 856 KB Output is correct
2 Correct 690 ms 860 KB Output is correct
3 Correct 786 ms 920 KB Output is correct
4 Correct 790 ms 856 KB Output is correct
5 Correct 758 ms 924 KB Output is correct
6 Correct 15 ms 15964 KB Output is correct
7 Correct 16 ms 15964 KB Output is correct
8 Correct 16 ms 16060 KB Output is correct
9 Correct 34 ms 16852 KB Output is correct
10 Correct 4 ms 8280 KB Output is correct
11 Correct 5 ms 8348 KB Output is correct
12 Correct 40 ms 9796 KB Output is correct
13 Correct 7 ms 8284 KB Output is correct
14 Correct 4 ms 8284 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 37 ms 1408 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 3857 ms 924 KB Output is correct
28 Execution timed out 20033 ms 17236 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 806 ms 920 KB Output is correct
2 Correct 733 ms 920 KB Output is correct
3 Correct 804 ms 860 KB Output is correct
4 Correct 808 ms 924 KB Output is correct
5 Correct 758 ms 856 KB Output is correct
6 Correct 16 ms 15964 KB Output is correct
7 Correct 15 ms 16176 KB Output is correct
8 Correct 16 ms 15964 KB Output is correct
9 Correct 39 ms 16728 KB Output is correct
10 Correct 6 ms 8284 KB Output is correct
11 Correct 5 ms 8340 KB Output is correct
12 Correct 40 ms 9812 KB Output is correct
13 Correct 6 ms 8280 KB Output is correct
14 Correct 11 ms 8284 KB Output is correct
15 Correct 3050 ms 17924 KB Output is correct
16 Execution timed out 20038 ms 18024 KB Time limit exceeded
17 Halted 0 ms 0 KB -