oj.uz

Submission #280373

# Submission time Handle Problem Language Result Execution time Memory
280373 2020-08-22T16:59:44 Z Saboon Wombats (IOI13_wombats) C++14
55 / 100
 20000 ms 56636 KB 
#include"wombats.h"
#include<bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int T = 20;
int R, C, H[5000][200], V[5000][200];
int bl[255][200][200], dp[2][200][200];
bool mark[200];

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

void MakeAll(int V1){
	for (int i = 0; i < C; i++)
		dp[0][V1][i] = bl[0][V1][i];
	for (int i = T; i < R; i += T){
		int block = i/T;
		calc(0, C, 0, C, block, V1);
		for (int j = 0; j < C; j++)
			dp[0][V1][j] = dp[1][V1][j];
	}
	mark[V1] = 1;
}

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);
	memset(mark, 0, sizeof mark);
}

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

int escape(int V1, int V2){
	if (mark[V1])
		return dp[0][V1][V2];
	MakeAll(V1);
	return dp[0][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 11 ms 13184 KB Output is correct
2 Correct 11 ms 13184 KB Output is correct
3 Correct 101 ms 14840 KB Output is correct
4 Correct 12 ms 13184 KB Output is correct
5 Correct 12 ms 13184 KB Output is correct
6 Correct 8 ms 8192 KB Output is correct
7 Correct 8 ms 8192 KB Output is correct
8 Correct 7 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 7 ms 8192 KB Output is correct
4 Correct 9 ms 8192 KB Output is correct
5 Correct 8 ms 8192 KB Output is correct
6 Correct 8 ms 8192 KB Output is correct
7 Correct 8 ms 8192 KB Output is correct
8 Correct 9 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 90 ms 9208 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 189 ms 8816 KB Output is correct
2 Correct 193 ms 8832 KB Output is correct
3 Correct 195 ms 8824 KB Output is correct
4 Correct 193 ms 8824 KB Output is correct
5 Correct 198 ms 8952 KB Output is correct
6 Correct 8 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 890 ms 8796 KB Output is correct
10 Correct 8 ms 8192 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 17280 KB Output is correct
2 Correct 24 ms 17280 KB Output is correct
3 Correct 23 ms 17280 KB Output is correct
4 Correct 64 ms 18040 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 196 ms 8824 KB Output is correct
2 Correct 194 ms 8952 KB Output is correct
3 Correct 210 ms 8824 KB Output is correct
4 Correct 219 ms 8952 KB Output is correct
5 Correct 193 ms 8952 KB Output is correct
6 Correct 22 ms 17280 KB Output is correct
7 Correct 21 ms 17280 KB Output is correct
8 Correct 23 ms 17280 KB Output is correct
9 Correct 73 ms 18168 KB Output is correct
10 Correct 11 ms 13184 KB Output is correct
11 Correct 12 ms 13184 KB Output is correct
12 Correct 91 ms 14712 KB Output is correct
13 Correct 12 ms 13184 KB Output is correct
14 Correct 11 ms 13184 KB Output is correct
15 Correct 6 ms 8192 KB Output is correct
16 Correct 7 ms 8192 KB Output is correct
17 Correct 6 ms 8192 KB Output is correct
18 Correct 7 ms 8192 KB Output is correct
19 Correct 7 ms 8192 KB Output is correct
20 Correct 7 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 9 ms 8192 KB Output is correct
24 Correct 7 ms 8192 KB Output is correct
25 Correct 89 ms 9208 KB Output is correct
26 Correct 7 ms 8192 KB Output is correct
27 Correct 892 ms 8824 KB Output is correct
28 Execution timed out 20044 ms 37344 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 8952 KB Output is correct
2 Correct 190 ms 8824 KB Output is correct
3 Correct 196 ms 8824 KB Output is correct
4 Correct 197 ms 9080 KB Output is correct
5 Correct 190 ms 8832 KB Output is correct
6 Correct 27 ms 17280 KB Output is correct
7 Correct 24 ms 17280 KB Output is correct
8 Correct 29 ms 17280 KB Output is correct
9 Correct 68 ms 18040 KB Output is correct
10 Correct 14 ms 13184 KB Output is correct
11 Correct 14 ms 13184 KB Output is correct
12 Correct 94 ms 14724 KB Output is correct
13 Correct 13 ms 13184 KB Output is correct
14 Correct 13 ms 13184 KB Output is correct
15 Correct 2013 ms 55160 KB Output is correct
16 Execution timed out 20041 ms 56636 KB Time limit exceeded
17 Halted 0 ms 0 KB -