oj.uz

Submission #64529

# Submission time Handle Problem Language Result Execution time Memory
64529 2018-08-04T19:56:19 Z TadijaSebez Wombats (IOI13_wombats) C++11
76 / 100
 6681 ms 263140 KB 
#include "wombats.h"
#include <stdio.h>
const int N=5050;
const int M=2048;
const int H=205;
const int inf=1e9+7;
int min(int a, int b){ return a>b?b:a;}
int max(int a, int b){ return a>b?a:b;}
int n,m,dp[M][H][H],ls[M],rs[M],x[N][M],y[N][M],tsz,root,opt[H];
void Take(int c)
{
	int i,j,k,l,r;
	for(i=0;i<m;i++) opt[i]=0;
	for(i=0;i<m;i++) for(j=0;j<m;j++) dp[c][i][j]=inf;
	for(i=m-1;i>-m;i--)
	{
		for(j=min(m-1,m-i-1);j+min(i,0)>=0;j--)
		{
			if(j==max(-i,0)) l=0;
			else l=opt[j-1];
			if(j==min(m-1,m-i-1)) r=m-1;
			else r=opt[j];
			for(k=l;k<=r;k++)
			{
				if(dp[c][j][j+i]>dp[ls[c]][j][k]+dp[rs[c]][k][j+i])
				{
					dp[c][j][j+i]=dp[ls[c]][j][k]+dp[rs[c]][k][j+i];
					opt[j]=k;
				}
			}
		}
	}
}
void Make(int c, int ss, int se)
{
	int i,j,k;
	for(i=0;i<m;i++) for(j=0;j<m;j++) dp[c][i][j]=inf;
	for(i=0;i<m;i++) dp[c][i][i]=0;
	for(k=ss;k<=se;k++)
	{
		for(i=0;i<m;i++)
		{
			for(j=1;j<m;j++) dp[c][i][j]=min(dp[c][i][j],dp[c][i][j-1]+x[k][j-1]);
			for(j=m-2;~j;j--) dp[c][i][j]=min(dp[c][i][j],dp[c][i][j+1]+x[k][j]);
		}
		for(i=0;i<m;i++) for(j=0;j<m;j++) dp[c][i][j]+=y[k][j];
	}
}
void Build(int &c, int ss, int se)
{
	c=++tsz;
	if(se-ss+1<=10)
	{
		Make(c,ss,se);
		return;
	}
	int mid=ss+se>>1;
	Build(ls[c],ss,mid);
	Build(rs[c],mid+1,se);
	Take(c);
}
void Upd(int c, int ss, int se, int qi)
{
	if(se-ss+1<=10)
	{
		Make(c,ss,se);
		return;
	}
	int mid=ss+se>>1;
	if(qi<=mid) Upd(ls[c],ss,mid,qi);
	else Upd(rs[c],mid+1,se,qi);
	Take(c);
}
void init(int R, int C, int H[5000][200], int V[5000][200])
{
	n=R;m=C;
	int i,j;
	for(i=0;i<n;i++) for(j=0;j<m-1;j++) x[i][j]=H[i][j];
	for(i=0;i<n-1;i++) for(j=0;j<m;j++) y[i][j]=V[i][j];
	Build(root,0,n-1);
}
void changeH(int p, int q, int w){ x[p][q]=w;Upd(root,0,n-1,p);}
void changeV(int p, int q, int w){ y[p][q]=w;Upd(root,0,n-1,p);}
int escape(int a, int b){ return dp[root][a][b];}
//------------------//
/*
int _V[5000][200],_H[5000][200];
int main()
{
	int R,C,i,j,Q,p,q,w,a,b,t;
	scanf("%i %i",&R,&C);
	for(i=0;i<R;i++) for(j=0;j<C-1;j++) scanf("%i",&_H[i][j]);
	for(i=0;i<R-1;i++) for(j=0;j<C;j++) scanf("%i",&_V[i][j]);
	init(R,C,_H,_V);
	scanf("%i",&Q);
	while(Q--)
	{
		scanf("%i",&t);
		if(t==1)
		{
			scanf("%i %i %i",&p,&q,&w);
			changeH(p,q,w);
		}
		if(t==2)
		{
			scanf("%i %i %i",&p,&q,&w);
			changeV(p,q,w);
		}
		if(t==3)
		{
			scanf("%i %i",&a,&b);
			printf("%i\n",escape(a,b));
		}
	}
	return 0;
}
*/
//------------------//

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)':
wombats.cpp:57:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=ss+se>>1;
          ~~^~~
wombats.cpp: In function 'void Upd(int, int, int, int)':
wombats.cpp:69:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=ss+se>>1;
          ~~^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 28884 KB Output is correct
2 Correct 25 ms 28916 KB Output is correct
3 Correct 157 ms 31712 KB Output is correct
4 Correct 24 ms 31712 KB Output is correct
5 Correct 26 ms 31712 KB Output is correct
6 Correct 3 ms 31712 KB Output is correct
7 Correct 2 ms 31712 KB Output is correct
8 Correct 2 ms 31712 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 31712 KB Output is correct
2 Correct 118 ms 31712 KB Output is correct
3 Correct 128 ms 31712 KB Output is correct
4 Correct 144 ms 31712 KB Output is correct
5 Correct 135 ms 31712 KB Output is correct
6 Correct 3 ms 31712 KB Output is correct
7 Correct 3 ms 31712 KB Output is correct
8 Correct 2 ms 31712 KB Output is correct
9 Correct 491 ms 31712 KB Output is correct
10 Correct 2 ms 31712 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 57276 KB Output is correct
2 Correct 45 ms 57296 KB Output is correct
3 Correct 40 ms 57416 KB Output is correct
4 Correct 85 ms 58896 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 58896 KB Output is correct
2 Correct 140 ms 58896 KB Output is correct
3 Correct 155 ms 58896 KB Output is correct
4 Correct 205 ms 58896 KB Output is correct
5 Correct 143 ms 58896 KB Output is correct
6 Correct 41 ms 58896 KB Output is correct
7 Correct 39 ms 58896 KB Output is correct
8 Correct 41 ms 58896 KB Output is correct
9 Correct 80 ms 60008 KB Output is correct
10 Correct 22 ms 60008 KB Output is correct
11 Correct 25 ms 60008 KB Output is correct
12 Correct 113 ms 60008 KB Output is correct
13 Correct 27 ms 60008 KB Output is correct
14 Correct 25 ms 60008 KB Output is correct
15 Correct 2 ms 60008 KB Output is correct
16 Correct 2 ms 60008 KB Output is correct
17 Correct 2 ms 60008 KB Output is correct
18 Correct 2 ms 60008 KB Output is correct
19 Correct 3 ms 60008 KB Output is correct
20 Correct 3 ms 60008 KB Output is correct
21 Correct 3 ms 60008 KB Output is correct
22 Correct 3 ms 60008 KB Output is correct
23 Correct 4 ms 60008 KB Output is correct
24 Correct 4 ms 60008 KB Output is correct
25 Correct 97 ms 60008 KB Output is correct
26 Correct 3 ms 60008 KB Output is correct
27 Correct 591 ms 60008 KB Output is correct
28 Correct 1651 ms 146916 KB Output is correct
29 Correct 1613 ms 146916 KB Output is correct
30 Correct 1714 ms 146916 KB Output is correct
31 Correct 1819 ms 159568 KB Output is correct
32 Correct 3 ms 159568 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 159568 KB Output is correct
2 Correct 106 ms 159568 KB Output is correct
3 Correct 127 ms 159568 KB Output is correct
4 Correct 132 ms 159568 KB Output is correct
5 Correct 136 ms 159568 KB Output is correct
6 Correct 40 ms 159568 KB Output is correct
7 Correct 48 ms 159568 KB Output is correct
8 Correct 40 ms 159568 KB Output is correct
9 Correct 88 ms 159568 KB Output is correct
10 Correct 27 ms 159568 KB Output is correct
11 Correct 25 ms 159568 KB Output is correct
12 Correct 116 ms 159568 KB Output is correct
13 Correct 28 ms 159568 KB Output is correct
14 Correct 26 ms 159568 KB Output is correct
15 Correct 2382 ms 252256 KB Output is correct
16 Runtime error 6681 ms 263140 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
17 Halted 0 ms 0 KB -