oj.uz

Submission #226358

# Submission time Handle Problem Language Result Execution time Memory
226358 2020-04-23T12:47:14 Z cgiosy Wombats (IOI13_wombats) C++17
76 / 100
 20000 ms 95528 KB 
#include <bits/stdc++.h>
#include "wombats.h"
#define rep(i,n) for(int i=0; i<n; i++)
#define reset(a) memset(a, 0x3f, sizeof a)
using namespace std;
constexpr int K=20, SZ=512;

int N, M, X[5000][200], Y[5000][200];
int T[SZ][200][200], L[SZ], R[SZ], id=1;
int& mini(int& x, int y) { return x=min(x, y); }
void build(int l, int r, int s=0, int e=N-1, int t=0) {
	auto &D=T[t];
	reset(D);
	if(s==e) {
		rep(i, M) D[i][i]=0;
		rep(y, K) {
			int i=s*K+y;
			rep(j, M) {
				rep(k, M-1) mini(D[j][k+1], D[j][k]+X[i][k]);
				rep(k, M-1) mini(D[j][M-k-2], D[j][M-k-1]+X[i][M-k-2]);
				rep(k, M) D[j][k]+=Y[i][k];
			}
		}
		return;
	}

	int m=s+e>>1;
	if(l<=m) build(l, r, s, m, L[t]=L[t] ?: id++);
	if(r>m) build(l, r, m+1, e, R[t]=R[t] ?: id++);

	auto &A=T[L[t]], &B=T[R[t]];
	rep(a, M) rep(b, M) rep(i, M)
		D[a][b]=min(D[a][b], A[a][i]+B[i][b]);
}
void init(int P, int Q, int H[5000][200], int V[5000][200]) {
	N=(P+K-1)/K, M=Q;
	reset(X);
	rep(i, P) rep(j, Q-1) X[i][j]=H[i][j];
	rep(i, P-1) rep(j, Q) Y[i][j]=V[i][j];
	build(0, N-1);
}
void changeH(int p, int q, int w) { X[p][q]=w; build(p/K, p/K); }
void changeV(int p, int q, int w) { Y[p][q]=w; build(p/K, p/K); }
int escape(int a, int b) { return T[0][a][b]; }

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;
      ^~~
wombats.cpp: In function 'void build(int, int, int, int, int)':
wombats.cpp:27:9: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int m=s+e>>1;
        ~^~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 90236 KB Output is correct
2 Correct 77 ms 90232 KB Output is correct
3 Correct 159 ms 91768 KB Output is correct
4 Correct 92 ms 90232 KB Output is correct
5 Correct 77 ms 90228 KB Output is correct
6 Correct 6 ms 4352 KB Output is correct
7 Correct 7 ms 4480 KB Output is correct
8 Correct 6 ms 4352 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4352 KB Output is correct
2 Correct 6 ms 4352 KB Output is correct
3 Correct 6 ms 4480 KB Output is correct
4 Correct 6 ms 4480 KB Output is correct
5 Correct 7 ms 4480 KB Output is correct
6 Correct 7 ms 4480 KB Output is correct
7 Correct 7 ms 4480 KB Output is correct
8 Correct 7 ms 4480 KB Output is correct
9 Correct 6 ms 4480 KB Output is correct
10 Correct 6 ms 4480 KB Output is correct
11 Correct 96 ms 5496 KB Output is correct
12 Correct 7 ms 4480 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 414 ms 6008 KB Output is correct
2 Correct 529 ms 6008 KB Output is correct
3 Correct 471 ms 5888 KB Output is correct
4 Correct 456 ms 6008 KB Output is correct
5 Correct 524 ms 6008 KB Output is correct
6 Correct 7 ms 4352 KB Output is correct
7 Correct 6 ms 4480 KB Output is correct
8 Correct 6 ms 4352 KB Output is correct
9 Correct 2615 ms 6008 KB Output is correct
10 Correct 7 ms 4480 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 94200 KB Output is correct
2 Correct 87 ms 94072 KB Output is correct
3 Correct 105 ms 94072 KB Output is correct
4 Correct 127 ms 94976 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 414 ms 6008 KB Output is correct
2 Correct 547 ms 6008 KB Output is correct
3 Correct 472 ms 5888 KB Output is correct
4 Correct 455 ms 6008 KB Output is correct
5 Correct 523 ms 6008 KB Output is correct
6 Correct 87 ms 94332 KB Output is correct
7 Correct 85 ms 94076 KB Output is correct
8 Correct 98 ms 94072 KB Output is correct
9 Correct 133 ms 94992 KB Output is correct
10 Correct 78 ms 90232 KB Output is correct
11 Correct 81 ms 90236 KB Output is correct
12 Correct 162 ms 91768 KB Output is correct
13 Correct 95 ms 90232 KB Output is correct
14 Correct 78 ms 90232 KB Output is correct
15 Correct 6 ms 4352 KB Output is correct
16 Correct 6 ms 4480 KB Output is correct
17 Correct 6 ms 4352 KB Output is correct
18 Correct 7 ms 4480 KB Output is correct
19 Correct 7 ms 4480 KB Output is correct
20 Correct 6 ms 4480 KB Output is correct
21 Correct 7 ms 4480 KB Output is correct
22 Correct 7 ms 4480 KB Output is correct
23 Correct 7 ms 4480 KB Output is correct
24 Correct 7 ms 4608 KB Output is correct
25 Correct 90 ms 5496 KB Output is correct
26 Correct 7 ms 4480 KB Output is correct
27 Correct 2612 ms 5888 KB Output is correct
28 Correct 6825 ms 94584 KB Output is correct
29 Correct 6388 ms 78584 KB Output is correct
30 Correct 6378 ms 78380 KB Output is correct
31 Correct 6812 ms 95528 KB Output is correct
32 Correct 6 ms 4480 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 405 ms 5888 KB Output is correct
2 Correct 532 ms 6008 KB Output is correct
3 Correct 471 ms 6008 KB Output is correct
4 Correct 468 ms 5992 KB Output is correct
5 Correct 533 ms 6008 KB Output is correct
6 Correct 82 ms 94072 KB Output is correct
7 Correct 84 ms 94072 KB Output is correct
8 Correct 99 ms 94076 KB Output is correct
9 Correct 126 ms 94968 KB Output is correct
10 Correct 79 ms 90232 KB Output is correct
11 Correct 87 ms 90232 KB Output is correct
12 Correct 164 ms 91768 KB Output is correct
13 Correct 92 ms 90240 KB Output is correct
14 Correct 85 ms 90232 KB Output is correct
15 Correct 4463 ms 94156 KB Output is correct
16 Execution timed out 20100 ms 95192 KB Time limit exceeded
17 Halted 0 ms 0 KB -