oj.uz

Submission #98091

# Submission time Handle Problem Language Result Execution time Memory
98091 2019-02-20T15:51:51 Z tincamatei Wombats (IOI13_wombats) C++14
76 / 100
 20000 ms 32928 KB 
#include "wombats.h"
#include <bits/stdc++.h>
 
using namespace std;
 
const int MAX_C = 200;
const int MAX_R = 5000;
const int INF = 1000000000;
const int BUCK = 70;

int R, C;
int H[MAX_R][MAX_C], V[MAX_R][MAX_C];
int sp[MAX_R][MAX_C];
int a[MAX_C][MAX_C];
int aux[MAX_C][MAX_C];

struct Matrix {
	int dp[MAX_C][MAX_C];
	Matrix() {
		for(int i = 0; i < C; ++i)
			for(int j = 0; j < C; ++j)
				dp[i][j] = INF;
	}
 
	void operator* (const Matrix &x) {
		Matrix rez;
		for(int i = 0; i < C; ++i)
			for(int j = 0; j < C; ++j)
				aux[i][j] = INF;
		
		for(int i = 0; i < C; ++i) {
			for(int j = 0; j < C; ++j) {
				int dist = dp[i][j] + x.dp[j][i];
				if(dist < aux[i][i]) {
					aux[i][i] = dist;
					a[i][i] = j;
				}
			}
		}
 
		for(int d = 1; d < C; ++d) {
			for(int i = 0; i < C - d; ++i) {
				int j = i + d;
				int st, dr;
				st = a[i][j - 1];
				dr = a[i + 1][j];
				for(int k = st; k <= dr; ++k) {
					int dist = dp[i][k] + x.dp[k][j];
					if(dist < aux[i][j]) {
						aux[i][j] = dist;
						a[i][j] = k;
					}
				}
			}
 
			for(int i = d; i < C; ++i) {
				int j = i - d;
				int st, dr;
				st = a[i - 1][j];
				dr = a[i][j + 1];
				for(int k = st; k <= dr; ++k) {
					int dist = dp[i][k] + x.dp[k][j];
					if(dist < aux[i][j]) {
						aux[i][j] = dist;
						a[i][j] = k;
					}
				}
			}
		}

		for(int i = 0; i < C; ++i)
			for(int j = 0; j < C; ++j)
				dp[i][j] = aux[i][j];
	}
} dp[MAX_R / BUCK + 1];
 
Matrix rez, row;
 
void initzero(Matrix &x) {
	for(int i = 0; i < C; ++i)
		for(int j = 0; j < C; ++j)
			if(i == j)
				x.dp[i][j] = 0;
			else
				x.dp[i][j] = INF;
}
 
void initrow(Matrix &x, int r) {
	for(int i = 0; i < C; ++i)
		for(int j = 0; j < C; ++j)
			x.dp[i][j] = abs(sp[r][i] - sp[r][j]) + V[r][j];
}

void updBuck(Matrix &x, int b) {
	initzero(x);
	for(int i = b * BUCK; i < (b + 1) * BUCK && i < R; ++i) {
		initrow(row, i);
		x * row; // Not gonna lie, this is really disgusting
	}
}
 
void calcrez() {
	initzero(rez);
	for(int i = 0; i < (R + BUCK - 1) / BUCK; ++i)
		rez * dp[i];
}
 
void init(int _R, int _C, int _H[5000][200], int _V[5000][200]) {
	R = _R;
	C = _C;
	for(int i = 0; i < R; ++i)
		for(int j = 0; j < C; ++j) {
			H[i][j] = _H[i][j];
			V[i][j] = _V[i][j];
		}
 
	for(int i = 0; i < R; ++i) {
		sp[i][0] = 0;
		for(int j = 1; j < C; ++j)
			sp[i][j] = sp[i][j - 1] + H[i][j - 1];
	}
 
	for(int i = 0; i < (R + BUCK - 1) / BUCK; ++i)
		updBuck(dp[i], i);
 
	calcrez();
}
 
void changeH(int P, int Q, int W) {
	H[P][Q] = W;
	for(int i = 1; i < C; ++i)
		sp[P][i] = sp[P][i - 1] + H[P][i - 1];
	int b = P / BUCK;
	updBuck(dp[b], b);
	calcrez();
}
 
void changeV(int P, int Q, int W) {
	V[P][Q] = W;
	int b = P / BUCK;
	updBuck(dp[b], b);
	calcrez();
}
 
int escape(int V1, int V2) {
	return rez.dp[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]
  int res;
      ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 16384 KB Output is correct
2 Correct 18 ms 16384 KB Output is correct
3 Correct 109 ms 17884 KB Output is correct
4 Correct 18 ms 16256 KB Output is correct
5 Correct 19 ms 16256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 78 ms 1528 KB Output is correct
12 Correct 2 ms 512 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 389 ms 1432 KB Output is correct
2 Correct 524 ms 1280 KB Output is correct
3 Correct 818 ms 1356 KB Output is correct
4 Correct 689 ms 1372 KB Output is correct
5 Correct 786 ms 1400 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3049 ms 1280 KB Output is correct
10 Correct 2 ms 384 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 20352 KB Output is correct
2 Correct 28 ms 20352 KB Output is correct
3 Correct 24 ms 20352 KB Output is correct
4 Correct 90 ms 21112 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 428 ms 1276 KB Output is correct
2 Correct 810 ms 1320 KB Output is correct
3 Correct 883 ms 1396 KB Output is correct
4 Correct 723 ms 1400 KB Output is correct
5 Correct 1070 ms 1400 KB Output is correct
6 Correct 30 ms 20352 KB Output is correct
7 Correct 25 ms 20344 KB Output is correct
8 Correct 27 ms 20344 KB Output is correct
9 Correct 66 ms 21112 KB Output is correct
10 Correct 20 ms 16384 KB Output is correct
11 Correct 21 ms 16384 KB Output is correct
12 Correct 76 ms 18040 KB Output is correct
13 Correct 19 ms 16384 KB Output is correct
14 Correct 20 ms 16332 KB Output is correct
15 Correct 3 ms 432 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 3 ms 484 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 4 ms 512 KB Output is correct
22 Correct 3 ms 512 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 3 ms 512 KB Output is correct
25 Correct 113 ms 1784 KB Output is correct
26 Correct 3 ms 512 KB Output is correct
27 Correct 3152 ms 1352 KB Output is correct
28 Correct 6754 ms 26856 KB Output is correct
29 Correct 7635 ms 22432 KB Output is correct
30 Correct 8039 ms 22236 KB Output is correct
31 Correct 6959 ms 27748 KB Output is correct
32 Correct 3 ms 384 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 400 ms 1400 KB Output is correct
2 Correct 604 ms 1280 KB Output is correct
3 Correct 730 ms 1312 KB Output is correct
4 Correct 719 ms 1436 KB Output is correct
5 Correct 885 ms 1376 KB Output is correct
6 Correct 25 ms 20344 KB Output is correct
7 Correct 22 ms 20352 KB Output is correct
8 Correct 24 ms 20352 KB Output is correct
9 Correct 62 ms 21112 KB Output is correct
10 Correct 20 ms 16256 KB Output is correct
11 Correct 18 ms 16384 KB Output is correct
12 Correct 92 ms 18056 KB Output is correct
13 Correct 19 ms 16384 KB Output is correct
14 Correct 18 ms 16384 KB Output is correct
15 Correct 2852 ms 32120 KB Output is correct
16 Execution timed out 20101 ms 32928 KB Time limit exceeded
17 Halted 0 ms 0 KB -