oj.uz

Submission #5412

# Submission time Handle Problem Language Result Execution time Memory
5412 2014-04-30T14:10:11 Z gs12006 Luxury burrow (IZhO13_burrow) C++
92 / 100
 2000 ms 15276 KB 
#include <stdio.h>
#include <memory.h>

int a[1100][1100];
int s[1100][2];
int d[1100][1100];
int ans[1100][1100];
int n,m;

int f(int x)
{
	int i,j,t,max=0;
	for (i=0;i<n;i++) for (j=0;j<m;j++) ans[i][j]=d[i][j]=0;
	for (i=0;i<m;i++) if (a[0][i]>=x) d[0][i]=1;
	for (i=0;i<m;i++) for (j=1;j<n;j++) if(a[j][i]>=x) d[j][i]=d[j-1][i]+1;
	for (i=0;i<n;i++)
	{
		for (j=0;j<m;j++) if (d[i][j]>0)
		{
			t=0;
			for (;d[i][j]!=0&&j<m;j++,t++)
			{
				for (;t>0&&s[t-1][0]>d[i][j];t--) ans[i][s[t-1][1]]+=j-s[t-1][1];
				s[t][0]=d[i][j];
				s[t][1]=j;
			}
			for (;t>0;t--) ans[i][s[t-1][1]]+=j-s[t-1][1];
		}
		for (j=m-1;j>=0;j--) if (d[i][j]>0)
		{
			t=0;
			for (;d[i][j]!=0&&j>=0;j--,t++)
			{
				for (;t>0&&s[t-1][0]>d[i][j];t--) ans[i][s[t-1][1]]+=s[t-1][1]-j;
				s[t][0]=d[i][j];
				s[t][1]=j;
			}
			for (;t>0;t--) ans[i][s[t-1][1]]+=s[t-1][1]-j;
		}
		for (j=0;j<m;j++) if (ans[i][j]>0) ans[i][j]--;
		for (j=0;j<m;j++) if (ans[i][j]>0) ans[i][j]*=d[i][j];
	}
	for (i=0;i<n;i++) for (j=0;j<m;j++) if (ans[i][j]>max) max=ans[i][j];
	return max;
}

int main()
{
	int i,j,k,minn=1<<30,maxn=0,midn,tt;
	scanf("%d %d %d",&n,&m,&k);
	for (i=0;i<n;i++) for (j=0;j<m;j++)
	{
		scanf("%d",&a[i][j]);
		if (a[i][j]<minn) minn=a[i][j];
		if (a[i][j]>maxn) maxn=a[i][j];
	}
	while (1)
	{
		if (maxn<=minn+1)
		{
			tt=f(maxn);
			if (tt>=k) printf("%d %d",maxn,tt);
			else printf("%d %d",minn,f(minn));
			break;
		}
		midn=(maxn+minn)/2;
		tt=f(midn);
		if (tt>=k) minn=midn;
		else maxn=midn;
	}
}

Subtask #1
92.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 15276 KB Output is correct
2 Correct 0 ms 15276 KB Output is correct
3 Correct 0 ms 15276 KB Output is correct
4 Correct 0 ms 15276 KB Output is correct
5 Correct 0 ms 15276 KB Output is correct
6 Correct 0 ms 15276 KB Output is correct
7 Correct 0 ms 15276 KB Output is correct
8 Correct 0 ms 15276 KB Output is correct
9 Correct 8 ms 15276 KB Output is correct
10 Correct 36 ms 15276 KB Output is correct
11 Correct 84 ms 15276 KB Output is correct
12 Correct 36 ms 15276 KB Output is correct
13 Correct 44 ms 15276 KB Output is correct
14 Correct 164 ms 15276 KB Output is correct
15 Correct 168 ms 15276 KB Output is correct
16 Correct 296 ms 15276 KB Output is correct
17 Correct 104 ms 15276 KB Output is correct
18 Correct 780 ms 15276 KB Output is correct
19 Correct 524 ms 15276 KB Output is correct
20 Correct 1700 ms 15276 KB Output is correct
21 Correct 1708 ms 15276 KB Output is correct
22 Execution timed out 2000 ms 15276 KB Program timed out
23 Execution timed out 2000 ms 15276 KB Program timed out
24 Correct 868 ms 15276 KB Output is correct
25 Correct 648 ms 15276 KB Output is correct