oj.uz

답안 #2482

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
2482 2013-07-22T12:10:07 Z kriii 웜뱃 (IOI13_wombats) C++
55 / 100
 20000 ms 26672 KB 
#include "wombats.h"
#define group_size 500

const int NON = 0x7fffffff;
int N, M, G, Start[30], End[30], Z = 32;

int ANS[200][200],GO[64][200][200],OUT[64],NOW[200],LEFT[200],RIGHT[200];
int HH[5000][200],VV[5000][200];

inline int min(int a, int b){return a < b ? a : b;}

void going(int i)
{
	int j;

	for (j=0;j<M;j++) LEFT[j] = RIGHT[j] = NOW[j];
	for (j=1;j<M;j++){
		if (LEFT[j-1] == NON) continue;
		LEFT[j] = min(LEFT[j],LEFT[j-1]+HH[i][j-1]);
	}
	for (j=M-2;j>=0;j--){
		if (RIGHT[j+1] == NON) continue;
		RIGHT[j] = min(RIGHT[j],RIGHT[j+1]+HH[i][j]);
	}

	for (j=0;j<M;j++){
		NOW[j] = min(NOW[j],LEFT[j]);
		NOW[j] = min(NOW[j],RIGHT[j]);
	}
}

void make()
{
	int i,j;

	for (i=0;i<M;i++){
		for (j=0;j<M;j++) NOW[j] = GO[1][i][j];
		going(N-1);
		for (j=0;j<M;j++) ANS[i][j] = NOW[j];
	}
}

void modify(int g)
{
	int i,j,k,x=g+Z,s;

	for (i=0;i<M;i++){
		for (j=0;j<M;j++) NOW[j] = NON;
		NOW[i] = 0;
		for (k=Start[g];k<End[g];k++){
			going(k);
			for (j=0;j<M;j++) NOW[j] += VV[k][j];
		}
		for (j=0;j<M;j++) GO[x][i][j] = NOW[j];
	}

	x /= 2; s = 1;
	while (x){
		if (OUT[x*2] > 0 || (OUT[x*2] == 0 && OUT[x*2+1] == s)) for (i=0;i<M;i++) for (j=0;j<M;j++) GO[x][i][j] = GO[x*2][i][j];
		else{
			for (i=0;i<M;i++) for (j=0;j<M;j++) GO[x][i][j] = NON;
			for (i=0;i<M;i++) for (j=0;j<M;j++) for (k=0;k<M;k++) GO[x][i][j] = min(GO[x][i][j],GO[x*2][i][k]+GO[x*2+1][k][j]);
		}
		x /= 2; s *= 2;
	}
}

void init(int R, int C, int H[5000][200], int V[5000][200]) {
	N = R; M = C;
	G = (R + group_size - 1) / group_size; int i,j;
	for (i=0;i<G;i++){
		Start[i] = i * group_size;
		End[i] = (i + 1) * group_size;
	}
	if (End[G-1] >= R) End[G-1] = R-1;
	if (Start[G-1] == End[G-1]) G--;

	for (i=0;i<R;i++) for (j=0;j<C-1;j++) HH[i][j] = H[i][j];
	for (i=0;i<R-1;i++) for (j=0;j<C;j++) VV[i][j] = V[i][j];
	for (i=G;i<Z;i++) OUT[i+Z] = 1;
	for (i=Z-1;i>=1;i--) OUT[i] = OUT[i*2] + OUT[i*2+1];
	for (i=0;i<G;i++) modify(i);
	make();
}

void changeH(int P, int Q, int W) {
	HH[P][Q] = W;
	modify(P/group_size);
	make();
}

void changeV(int P, int Q, int W) {
	VV[P][Q] = W;
	modify(P/group_size);
	make();
}

int escape(int V1, int V2) {
	return ANS[V1][V2];
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 26672 KB Output is correct
2 Correct 4 ms 26672 KB Output is correct
3 Correct 87 ms 26672 KB Output is correct
4 Correct 4 ms 26672 KB Output is correct
5 Correct 4 ms 26672 KB Output is correct
6 Correct 0 ms 26672 KB Output is correct
7 Correct 0 ms 26672 KB Output is correct
8 Correct 0 ms 26672 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 26672 KB Output is correct
2 Correct 0 ms 26672 KB Output is correct
3 Correct 0 ms 26672 KB Output is correct
4 Correct 0 ms 26672 KB Output is correct
5 Correct 0 ms 26672 KB Output is correct
6 Correct 0 ms 26672 KB Output is correct
7 Correct 0 ms 26672 KB Output is correct
8 Correct 0 ms 26672 KB Output is correct
9 Correct 0 ms 26672 KB Output is correct
10 Correct 0 ms 26672 KB Output is correct
11 Correct 79 ms 26672 KB Output is correct
12 Correct 0 ms 26672 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1401 ms 26672 KB Output is correct
2 Correct 1535 ms 26672 KB Output is correct
3 Correct 1413 ms 26672 KB Output is correct
4 Correct 1413 ms 26672 KB Output is correct
5 Correct 1386 ms 26672 KB Output is correct
6 Correct 0 ms 26672 KB Output is correct
7 Correct 0 ms 26672 KB Output is correct
8 Correct 0 ms 26672 KB Output is correct
9 Correct 8164 ms 26672 KB Output is correct
10 Correct 0 ms 26672 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 26672 KB Output is correct
2 Correct 11 ms 26672 KB Output is correct
3 Correct 14 ms 26672 KB Output is correct
4 Correct 56 ms 26672 KB Output is correct

Subtask #5
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1402 ms 26672 KB Output is correct
2 Correct 1368 ms 26672 KB Output is correct
3 Correct 1409 ms 26672 KB Output is correct
4 Correct 1659 ms 26672 KB Output is correct
5 Correct 1389 ms 26672 KB Output is correct
6 Correct 14 ms 26672 KB Output is correct
7 Correct 16 ms 26672 KB Output is correct
8 Correct 15 ms 26672 KB Output is correct
9 Correct 69 ms 26672 KB Output is correct
10 Correct 6 ms 26672 KB Output is correct
11 Correct 2 ms 26672 KB Output is correct
12 Correct 82 ms 26672 KB Output is correct
13 Correct 5 ms 26672 KB Output is correct
14 Correct 2 ms 26672 KB Output is correct
15 Correct 0 ms 26672 KB Output is correct
16 Correct 0 ms 26672 KB Output is correct
17 Correct 0 ms 26672 KB Output is correct
18 Correct 0 ms 26672 KB Output is correct
19 Correct 0 ms 26672 KB Output is correct
20 Correct 0 ms 26672 KB Output is correct
21 Correct 0 ms 26672 KB Output is correct
22 Correct 0 ms 26672 KB Output is correct
23 Correct 0 ms 26672 KB Output is correct
24 Correct 0 ms 26672 KB Output is correct
25 Correct 88 ms 26672 KB Output is correct
26 Correct 0 ms 26672 KB Output is correct
27 Correct 7559 ms 26672 KB Output is correct
28 Execution timed out 20000 ms 0 KB Program timed out
29 Halted 0 ms 0 KB -

Subtask #6
0.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1398 ms 26672 KB Output is correct
2 Correct 1603 ms 26672 KB Output is correct
3 Correct 1424 ms 26672 KB Output is correct
4 Correct 1419 ms 26672 KB Output is correct
5 Correct 1396 ms 26672 KB Output is correct
6 Correct 12 ms 26672 KB Output is correct
7 Correct 15 ms 26672 KB Output is correct
8 Correct 16 ms 26672 KB Output is correct
9 Correct 66 ms 26672 KB Output is correct
10 Correct 5 ms 26672 KB Output is correct
11 Correct 4 ms 26672 KB Output is correct
12 Correct 86 ms 26672 KB Output is correct
13 Correct 5 ms 26672 KB Output is correct
14 Correct 3 ms 26672 KB Output is correct
15 Correct 4859 ms 26672 KB Output is correct
16 Execution timed out 20000 ms 0 KB Program timed out
17 Halted 0 ms 0 KB -