oj.uz

Submission #280175

# Submission time Handle Problem Language Result Execution time Memory
280175 2020-08-22T14:31:29 Z Saboon Wombats (IOI13_wombats) C++14
55 / 100
 20000 ms 26704 KB 
#include "wombats.h"
#include<bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int T = 500;
int R, C, H[5000][200], V[5000][200];
int bl[12][200][200], dp[2][200];

void ChangeBlock(int block){
	for (int j = 0; j < C; j++){
		for (int k = 0; k < C; k++)
			bl[block][j][k] = inf;
		bl[block][j][j] = 0;
		for (int k = j+1; k < C; k++)
			bl[block][j][k] = bl[block][j][k-1] + H[T*block][k-1];
		for (int k = j-1; k >= 0; k--)
			bl[block][j][k] = bl[block][j][k+1] + H[T*block][k];
		for (int k = 0; k < C; k++)
			bl[block][j][k] += V[T*block][k];
		for (int i = T*block+1; i < min(R, T*(block+1)); i++){
			for (int k = 1; k < C; k++)
				bl[block][j][k] = min(bl[block][j][k], bl[block][j][k-1] + H[i][k-1]);
			for (int k = C-2; k >= 0; k--)
				bl[block][j][k] = min(bl[block][j][k], bl[block][j][k+1] + H[i][k]);
			for (int k = 0; k < C; k++)
				bl[block][j][k] += V[i][k];
		}
	}
}

void init(int r, int c, int h[5000][200], int v[5000][200]) {
	R = r, C = c;
	for (int i = 0; i < 5000; i++)
		for (int j = 0; j < 200; j++)
			H[i][j] = h[i][j], V[i][j] = v[i][j];
	for (int i = 0; i < R; i += T)
		ChangeBlock(i/T);
	return;
}

void changeH(int P, int Q, int W) {
	H[P][Q] = W;
	ChangeBlock(P/T);
}

void changeV(int P, int Q, int W) {
	V[P][Q] = W;
	ChangeBlock(P/T);
}

void calc(int l, int r, int lo, int hi, int block){
	if (l >= r)
		return;
	int m = (l+r) >> 1, opt = -1;
	dp[1][m] = inf;
	for (int i = lo; i < hi; i++){
		if (dp[0][i] + bl[block][i][m] < dp[1][m]){
			opt = i;
			dp[1][m] = dp[0][i] + bl[block][i][m];
		}
	}
	calc(l, m, lo, opt+1, block);
	calc(m+1, r, opt, hi, block);
}

int escape(int V1, int V2) {
	for (int i = 0; i < C; i++)
		dp[0][i] = bl[0][V1][i];
	for (int i = T; i < R; i += T){
		int block = i/T;
		calc(0, C, 0, C, block);
		for (int j = 0; j < C; j++)
			dp[0][j] = dp[1][j];
	}
	return dp[0][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 9 ms 12160 KB Output is correct
2 Correct 11 ms 12160 KB Output is correct
3 Correct 119 ms 14968 KB Output is correct
4 Correct 11 ms 12160 KB Output is correct
5 Correct 10 ms 12160 KB Output is correct
6 Correct 8 ms 8192 KB Output is correct
7 Correct 7 ms 8192 KB Output is correct
8 Correct 8 ms 8192 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8192 KB Output is correct
2 Correct 7 ms 8192 KB Output is correct
3 Correct 8 ms 8192 KB Output is correct
4 Correct 8 ms 8192 KB Output is correct
5 Correct 7 ms 8192 KB Output is correct
6 Correct 7 ms 8192 KB Output is correct
7 Correct 7 ms 8192 KB Output is correct
8 Correct 8 ms 8192 KB Output is correct
9 Correct 7 ms 8192 KB Output is correct
10 Correct 7 ms 8192 KB Output is correct
11 Correct 113 ms 10616 KB Output is correct
12 Correct 7 ms 8192 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 946 ms 8448 KB Output is correct
2 Correct 921 ms 8568 KB Output is correct
3 Correct 957 ms 8532 KB Output is correct
4 Correct 947 ms 8536 KB Output is correct
5 Correct 955 ms 8568 KB Output is correct
6 Correct 7 ms 8192 KB Output is correct
7 Correct 6 ms 8192 KB Output is correct
8 Correct 6 ms 8192 KB Output is correct
9 Correct 4701 ms 8532 KB Output is correct
10 Correct 7 ms 8192 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 16128 KB Output is correct
2 Correct 17 ms 16128 KB Output is correct
3 Correct 18 ms 16128 KB Output is correct
4 Correct 97 ms 17528 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 944 ms 8568 KB Output is correct
2 Correct 955 ms 8516 KB Output is correct
3 Correct 958 ms 8448 KB Output is correct
4 Correct 957 ms 8540 KB Output is correct
5 Correct 929 ms 8448 KB Output is correct
6 Correct 18 ms 16128 KB Output is correct
7 Correct 17 ms 16128 KB Output is correct
8 Correct 18 ms 16128 KB Output is correct
9 Correct 80 ms 17528 KB Output is correct
10 Correct 10 ms 12160 KB Output is correct
11 Correct 10 ms 12160 KB Output is correct
12 Correct 130 ms 14968 KB Output is correct
13 Correct 10 ms 12160 KB Output is correct
14 Correct 10 ms 12160 KB Output is correct
15 Correct 8 ms 8192 KB Output is correct
16 Correct 8 ms 8192 KB Output is correct
17 Correct 6 ms 8192 KB Output is correct
18 Correct 8 ms 8192 KB Output is correct
19 Correct 8 ms 8192 KB Output is correct
20 Correct 8 ms 8192 KB Output is correct
21 Correct 7 ms 8192 KB Output is correct
22 Correct 7 ms 8192 KB Output is correct
23 Correct 7 ms 8192 KB Output is correct
24 Correct 7 ms 8192 KB Output is correct
25 Correct 97 ms 10616 KB Output is correct
26 Correct 7 ms 8192 KB Output is correct
27 Correct 4782 ms 8532 KB Output is correct
28 Execution timed out 20089 ms 20936 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 951 ms 8568 KB Output is correct
2 Correct 956 ms 8448 KB Output is correct
3 Correct 964 ms 8536 KB Output is correct
4 Correct 971 ms 8536 KB Output is correct
5 Correct 960 ms 8532 KB Output is correct
6 Correct 19 ms 16128 KB Output is correct
7 Correct 19 ms 16128 KB Output is correct
8 Correct 21 ms 16128 KB Output is correct
9 Correct 120 ms 17532 KB Output is correct
10 Correct 11 ms 12160 KB Output is correct
11 Correct 9 ms 12160 KB Output is correct
12 Correct 152 ms 14968 KB Output is correct
13 Correct 12 ms 12160 KB Output is correct
14 Correct 10 ms 12160 KB Output is correct
15 Correct 2959 ms 26704 KB Output is correct
16 Execution timed out 20058 ms 25852 KB Time limit exceeded
17 Halted 0 ms 0 KB -