oj.uz

Submission #764140

# Submission time Handle Problem Language Result Execution time Memory
764140 2023-06-23T07:41:18 Z NothingXD Wombats (IOI13_wombats) C++17
76 / 100
 20000 ms 71352 KB 
#include "wombats.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef complex<ld> point;

void debug_out(){cerr << endl;}

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
	cout << H << ' ';
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)

const int maxn = 5e3 + 10;
const int maxm = 200 + 10;
const int sq = 50;
const int inf = 1e9;
int n, m, h[maxn][maxm], v[maxn][maxm], dp[maxn][maxm], val[100][maxm][maxm], seg[410][maxm][maxm];

void change(int v, int l, int r, int idx){
	if (l + 1 == r){
		for (int i = 0; i < m; i++){
			for (int j = 0; j < m; j++){
				seg[v][i][j] = val[l][i][j];
			}
		}
		return;
	}
	int mid = (l + r) >> 1;
	if (idx < mid){
		change(v << 1, l, mid, idx);
	}
	else{
		change(v << 1 | 1, mid, r, idx);
	}
	for (int i = 0; i < m; i++){
		for (int j = 0; j < m; j++){
			seg[v][i][j] = inf;
			for (int k = 0; k < m; k++){
				seg[v][i][j] = min(seg[v][i][j], seg[v << 1][i][k] + seg[v << 1 | 1][k][j] + ::v[mid*sq-1][k]);
			}
		}
	}
}

inline void update(int r){
	for (int i = 1; i < m; i++){
		dp[r][i] = min(dp[r][i], dp[r][i-1] + h[r][i-1]);
	}
	for (int i = m-2; ~i; i--){
		dp[r][i] = min(dp[r][i], dp[r][i+1] + h[r][i]);
	}
}

inline void build(int blc){
	for (int i = 0; i < m; i++){
		for (int j = 0; j < m; j++){
			if (i == j) dp[blc*sq][j] = 0;
			else dp[blc*sq][j] = inf;
		}
		update(blc*sq);
		int idx = min((blc+1)*sq, n) - 1;
		for (int j = blc*sq+1; j <= idx; j++){
			for (int k = 0; k < m; k++){
				dp[j][k] = dp[j-1][k] + v[j-1][k];
			}
			update(j);
		}
		for (int j = 0; j < m; j++){
			val[blc][i][j] = dp[idx][j];
		}
	}
	change(1, 0, (n-1)/sq+1, blc);
}

void init(int R, int C, int H[5000][200], int V[5000][200]) {
    n = R, m = C;
	for (int i = 0; i < n; i++){
		for (int j = 0; j < m-1; j++){
			h[i][j] = H[i][j];
		}
	}
	for (int i = 0; i < n-1; i++){
		for (int j = 0; j < m; j++){
			v[i][j] = V[i][j];
		}
	}
	for (int i = 0; i <= (n-1)/sq; i++){
		build(i);
	}
}

void changeH(int P, int Q, int W) {
    h[P][Q] = W;
	build(P/sq);
}

void changeV(int P, int Q, int W) {
    v[P][Q] = W;
	build(P/sq);
}

int escape(int V1, int V2) {
    return seg[1][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 6 ms 13652 KB Output is correct
2 Correct 6 ms 13668 KB Output is correct
3 Correct 63 ms 15312 KB Output is correct
4 Correct 6 ms 13652 KB Output is correct
5 Correct 6 ms 13652 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 53 ms 1348 KB Output is correct
12 Correct 1 ms 468 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 487 ms 1164 KB Output is correct
2 Correct 472 ms 1156 KB Output is correct
3 Correct 487 ms 1108 KB Output is correct
4 Correct 478 ms 1184 KB Output is correct
5 Correct 501 ms 1156 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 2362 ms 1164 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 21956 KB Output is correct
2 Correct 11 ms 21972 KB Output is correct
3 Correct 11 ms 21984 KB Output is correct
4 Correct 38 ms 22712 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 476 ms 1164 KB Output is correct
2 Correct 467 ms 1148 KB Output is correct
3 Correct 485 ms 1176 KB Output is correct
4 Correct 486 ms 1168 KB Output is correct
5 Correct 468 ms 1108 KB Output is correct
6 Correct 13 ms 21972 KB Output is correct
7 Correct 10 ms 21972 KB Output is correct
8 Correct 10 ms 21928 KB Output is correct
9 Correct 53 ms 22768 KB Output is correct
10 Correct 6 ms 13652 KB Output is correct
11 Correct 6 ms 13652 KB Output is correct
12 Correct 58 ms 15280 KB Output is correct
13 Correct 6 ms 13652 KB Output is correct
14 Correct 5 ms 13748 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 57 ms 1388 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 2348 ms 1168 KB Output is correct
28 Correct 6714 ms 46520 KB Output is correct
29 Correct 6580 ms 38316 KB Output is correct
30 Correct 6447 ms 38240 KB Output is correct
31 Correct 6783 ms 47568 KB Output is correct
32 Correct 1 ms 340 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 475 ms 1168 KB Output is correct
2 Correct 473 ms 1148 KB Output is correct
3 Correct 484 ms 1164 KB Output is correct
4 Correct 497 ms 1168 KB Output is correct
5 Correct 479 ms 1168 KB Output is correct
6 Correct 11 ms 21992 KB Output is correct
7 Correct 11 ms 21996 KB Output is correct
8 Correct 13 ms 21972 KB Output is correct
9 Correct 48 ms 22744 KB Output is correct
10 Correct 6 ms 13748 KB Output is correct
11 Correct 6 ms 13652 KB Output is correct
12 Correct 66 ms 15252 KB Output is correct
13 Correct 6 ms 13652 KB Output is correct
14 Correct 7 ms 13696 KB Output is correct
15 Correct 8048 ms 70816 KB Output is correct
16 Execution timed out 20030 ms 71352 KB Time limit exceeded
17 Halted 0 ms 0 KB -