oj.uz

Submission #227203

# Submission time Handle Problem Language Result Execution time Memory
227203 2020-04-26T13:42:47 Z kig9981 Wombats (IOI13_wombats) C++17
76 / 100
 12290 ms 62072 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
 
#include "wombats.h"
#include <bits/stdc++.h>
 
#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif
 
using namespace std;

const int B=40, SZ=1<<7;
int N, M, H[5000][200], PS[5000][200], V[5001][200], tree[2*SZ][200][200], md[SZ], D[200], D2[200];

void set_md(int bit=1, int s=0, int e=SZ-1)
{
	int m=(s+e)>>1;
	if(s==e) return;
	set_md(2*bit,s,m);
	set_md(2*bit+1,m+1,e);
	md[bit]=min((m+1)*B-1,N);
}

int get_cost(int h, int s, int e)
{
	if(s>e) swap(s,e);
	return PS[h][e]-PS[h][s];
}

void dnc(int h, int s1, int e1, int s2, int e2)
{
	int m2=(s2+e2)>>1, m=s1;
	if(s2>e2) return;
	for(int i=s1+1;i<=e1;i++) if(D[i]+get_cost(h,i,m2)<D[m]+get_cost(h,m,m2)) m=i;
	D2[m2]=D[m]+get_cost(h,m,m2);
	dnc(h,s1,m,s2,m2-1);
	dnc(h,m,e1,m2+1,e2);
}

void dijk(int b)
{
	for(int r=0;r<M;r++) {
		for(int i=0;i<B && b*B+i<N;i++) {
			if(i) {
				for(int j=0;j<M;j++) D[j]=D2[j]+V[b*B+i-1][j];
			}
			else {
				for(int j=0;j<M;j++) D[j]=(r!=j)*0x3fffffff;
			}
			dnc(b*B+i,0,M-1,0,M-1);
		}
		for(int j=0;j<M;j++) tree[SZ+b][r][j]=D2[j];
	}
}

void dnc(int p, int l, int r, int b, int s1, int e1, int s2, int e2)
{
	int m2=(s2+e2)>>1, m=s1;
	if(s2>e2) return;
	for(int i=s1+1;i<=e1;i++) if(tree[l][b][i]+V[md[p]][i]+tree[r][i][m2]<tree[l][b][m]+V[md[p]][m]+tree[r][m][m2]) m=i;
	tree[p][b][m2]=tree[l][b][m]+V[md[p]][m]+tree[r][m][m2];
	dnc(p,l,r,b,s1,m,s2,m2-1);
	dnc(p,l,r,b,m,e1,m2+1,e2);
}

void init(int R, int C, int (*H)[200], int (*V)[200])
{
	N=R; M=C; memset(tree,0x3f,sizeof(tree));
	for(int i=0;i<N;i++) for(int j=0;j<M-1;j++) {
		::H[i][j]=H[i][j];
		PS[i][j+1]=PS[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*B<N;i++) dijk(i);
	for(int i=(N-1)/B+1;i<SZ;i++) for(int j=0;j<M;j++) tree[SZ+i][j][j]=0;
	set_md();
	for(int i=SZ;--i;) for(int j=0;j<M;j++) dnc(i,2*i,2*i+1,j,0,M-1,0,M-1);
}

void changeH(int P, int Q, int W)
{
    H[P][Q]=W;
	for(int j=0;j<M;j++) PS[P][j+1]=PS[P][j]+H[P][j];
	dijk(P/B);
	for(int n=SZ+P/B;n>>=1;) for(int j=0;j<M;j++) dnc(n,2*n,2*n+1,j,0,M-1,0,M-1);
}

void changeV(int P, int Q, int W)
{
    V[P][Q]=W;
	if(P/B==(P+1)/B) dijk(P/B);
	for(int n=SZ+P/B;n>>=1;) for(int j=0;j<M;j++) dnc(n,2*n,2*n+1,j,0,M-1,0,M-1);
}

int escape(int V1, int V2)
{
	return tree[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]
  int res;
      ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 48248 KB Output is correct
2 Correct 30 ms 48256 KB Output is correct
3 Correct 109 ms 50040 KB Output is correct
4 Correct 29 ms 48256 KB Output is correct
5 Correct 32 ms 48256 KB Output is correct
6 Correct 24 ms 40448 KB Output is correct
7 Correct 26 ms 40448 KB Output is correct
8 Correct 26 ms 40448 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 40448 KB Output is correct
2 Correct 27 ms 40568 KB Output is correct
3 Correct 24 ms 40448 KB Output is correct
4 Correct 27 ms 40444 KB Output is correct
5 Correct 28 ms 40448 KB Output is correct
6 Correct 27 ms 40448 KB Output is correct
7 Correct 27 ms 40448 KB Output is correct
8 Correct 28 ms 40448 KB Output is correct
9 Correct 27 ms 40576 KB Output is correct
10 Correct 26 ms 40448 KB Output is correct
11 Correct 119 ms 41720 KB Output is correct
12 Correct 29 ms 40576 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1396 ms 40952 KB Output is correct
2 Correct 1900 ms 40952 KB Output is correct
3 Correct 1990 ms 40832 KB Output is correct
4 Correct 1912 ms 40940 KB Output is correct
5 Correct 2145 ms 40832 KB Output is correct
6 Correct 25 ms 40448 KB Output is correct
7 Correct 25 ms 40448 KB Output is correct
8 Correct 25 ms 40448 KB Output is correct
9 Correct 8908 ms 40936 KB Output is correct
10 Correct 25 ms 40448 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 60028 KB Output is correct
2 Correct 37 ms 60024 KB Output is correct
3 Correct 39 ms 60024 KB Output is correct
4 Correct 80 ms 61016 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1410 ms 40960 KB Output is correct
2 Correct 1874 ms 40924 KB Output is correct
3 Correct 1976 ms 40952 KB Output is correct
4 Correct 1904 ms 40952 KB Output is correct
5 Correct 2107 ms 40936 KB Output is correct
6 Correct 39 ms 60032 KB Output is correct
7 Correct 38 ms 60024 KB Output is correct
8 Correct 38 ms 60024 KB Output is correct
9 Correct 79 ms 60920 KB Output is correct
10 Correct 31 ms 48248 KB Output is correct
11 Correct 30 ms 48248 KB Output is correct
12 Correct 114 ms 50040 KB Output is correct
13 Correct 31 ms 48288 KB Output is correct
14 Correct 30 ms 48248 KB Output is correct
15 Correct 24 ms 40448 KB Output is correct
16 Correct 24 ms 40448 KB Output is correct
17 Correct 24 ms 40448 KB Output is correct
18 Correct 26 ms 40448 KB Output is correct
19 Correct 27 ms 40448 KB Output is correct
20 Correct 28 ms 40568 KB Output is correct
21 Correct 27 ms 40448 KB Output is correct
22 Correct 27 ms 40448 KB Output is correct
23 Correct 26 ms 40448 KB Output is correct
24 Correct 27 ms 40440 KB Output is correct
25 Correct 113 ms 41720 KB Output is correct
26 Correct 29 ms 40576 KB Output is correct
27 Correct 8905 ms 40960 KB Output is correct
28 Correct 10879 ms 60724 KB Output is correct
29 Correct 12290 ms 57332 KB Output is correct
30 Correct 11926 ms 57360 KB Output is correct
31 Correct 11241 ms 62072 KB Output is correct
32 Correct 32 ms 40448 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1443 ms 40960 KB Output is correct
2 Correct 1922 ms 40920 KB Output is correct
3 Correct 1997 ms 40940 KB Output is correct
4 Correct 1904 ms 40952 KB Output is correct
5 Correct 2119 ms 40832 KB Output is correct
6 Correct 37 ms 60032 KB Output is correct
7 Correct 39 ms 60024 KB Output is correct
8 Correct 44 ms 60024 KB Output is correct
9 Correct 79 ms 60920 KB Output is correct
10 Correct 30 ms 48256 KB Output is correct
11 Correct 30 ms 48256 KB Output is correct
12 Correct 111 ms 50040 KB Output is correct
13 Correct 30 ms 48256 KB Output is correct
14 Correct 29 ms 48256 KB Output is correct
15 Incorrect 9691 ms 60344 KB Output isn't correct
16 Halted 0 ms 0 KB -