oj.uz

Submission #1067989

# Submission time Handle Problem Language Result Execution time Memory
1067989 2024-08-21T06:26:18 Z sleepntsheep Wombats (IOI13_wombats) C++17
76 / 100
 10989 ms 34948 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

constexpr int B = 1000;

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

int L[9999], R[9999], By[9999];

int a[100][100][100];

int ans[100][100];

void calc(int blk) {
	for (int ii = 0; ii < c; ++ii) {
		static int dp[2][100];
		/* 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[100], suf[100], ph[100]; /* 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[100][100], int down[100][100], int out[100][100]) {
	static int buf[100][100];
	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 changeH(int P, int Q, int W) {
	h[P][Q] = W;
	calc(By[P]);
	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 changeV(int P, int Q, int W) {
	v[P][Q] = W;
	calc(By[P]);
	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 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] = 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;
	}

	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);
}

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 6236 KB Output is correct
2 Correct 5 ms 6236 KB Output is correct
3 Correct 48 ms 9032 KB Output is correct
4 Correct 9 ms 6236 KB Output is correct
5 Correct 5 ms 6232 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 600 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 1 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 0 ms 348 KB Output is correct
11 Correct 38 ms 2424 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 192 ms 604 KB Output is correct
2 Correct 190 ms 604 KB Output is correct
3 Correct 198 ms 860 KB Output is correct
4 Correct 194 ms 864 KB Output is correct
5 Correct 205 ms 856 KB Output is correct
6 Correct 0 ms 428 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 954 ms 856 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 15 ms 12308 KB Output is correct
2 Correct 15 ms 12120 KB Output is correct
3 Correct 14 ms 12120 KB Output is correct
4 Correct 33 ms 13604 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 604 KB Output is correct
2 Correct 208 ms 860 KB Output is correct
3 Correct 192 ms 856 KB Output is correct
4 Correct 196 ms 860 KB Output is correct
5 Correct 192 ms 860 KB Output is correct
6 Correct 15 ms 12560 KB Output is correct
7 Correct 16 ms 12120 KB Output is correct
8 Correct 16 ms 12304 KB Output is correct
9 Correct 34 ms 13452 KB Output is correct
10 Correct 5 ms 6232 KB Output is correct
11 Correct 5 ms 6236 KB Output is correct
12 Correct 40 ms 9036 KB Output is correct
13 Correct 5 ms 6232 KB Output is correct
14 Correct 5 ms 6404 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 1 ms 436 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 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 37 ms 2896 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 996 ms 860 KB Output is correct
28 Correct 10989 ms 16484 KB Output is correct
29 Correct 10845 ms 14160 KB Output is correct
30 Correct 10082 ms 14160 KB Output is correct
31 Correct 10978 ms 18272 KB Output is correct
32 Correct 0 ms 348 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 836 KB Output is correct
2 Correct 193 ms 600 KB Output is correct
3 Correct 197 ms 860 KB Output is correct
4 Correct 193 ms 860 KB Output is correct
5 Correct 203 ms 856 KB Output is correct
6 Correct 15 ms 12124 KB Output is correct
7 Correct 15 ms 12124 KB Output is correct
8 Correct 17 ms 12124 KB Output is correct
9 Correct 34 ms 13656 KB Output is correct
10 Correct 5 ms 6232 KB Output is correct
11 Correct 5 ms 6236 KB Output is correct
12 Correct 39 ms 9044 KB Output is correct
13 Correct 5 ms 6488 KB Output is correct
14 Correct 5 ms 6232 KB Output is correct
15 Runtime error 2009 ms 34948 KB Execution killed with signal 11
16 Halted 0 ms 0 KB -