Submission #1693999


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int a[5010][210],st[5010][210],top[210];
long long ans,sum[5010],f[5010],ths[5010];
int main()
{
	int n,m;scanf("%d%d",&n,&m);
	for (int i=2;i<=n;i++){int w;scanf("%d",&w);sum[i]=sum[i-1]+w;}
	for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) scanf("%d",&a[i][j]);
	for (int i=1;i<=n;i++)
	{
		for (int i=1;i<=n;i++) ths[i]=0;
		for (int j=1;j<=m;j++)
		{
			for (;top[j]&&a[i][j]>=a[st[top[j]][j]][j];top[j]--)
			{
				ths[st[top[j]-1][j]+1]+=a[i][j]-a[st[top[j]][j]][j];
				ths[st[top[j]][j]+1]-=a[i][j]-a[st[top[j]][j]][j];
			}
			ths[i]+=a[i][j];st[++top[j]][j]=i;
		}
		for (int j=1;j<=i;j++)
		{
			ths[j]+=ths[j-1];f[j]+=ths[j];
			ans=max(ans,f[j]-sum[i]+sum[j]);
		}
	}
	printf("%lld\n",ans);
}

Submission Info

Submission Time
Task F - Yakiniku Restaurants
User yx_lu
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 775 Byte
Status AC
Exec Time 168 ms
Memory 4608 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:7:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int n,m;scanf("%d%d",&n,&m);
                             ^
./Main.cpp:8:45: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int i=2;i<=n;i++){int w;scanf("%d",&w);sum[i]=sum[i-1]+w;}
                                             ^
./Main.cpp:9:68: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) scanf("%d",&a[i][j]);
                                                                    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 2
AC × 30
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, subtask_1_dense_max_01.txt, subtask_1_dense_max_02.txt, subtask_1_dense_max_03.txt, subtask_1_dense_max_04.txt, subtask_1_dense_rand_01.txt, subtask_1_dense_rand_02.txt, subtask_1_dense_rand_03.txt, subtask_1_dense_rand_04.txt, subtask_1_max_01.txt, subtask_1_max_02.txt, subtask_1_max_03.txt, subtask_1_max_04.txt, subtask_1_min_01.txt, subtask_1_min_02.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_rand_03.txt, subtask_1_rand_04.txt, subtask_1_widemax_01.txt, subtask_1_widemax_02.txt, subtask_1_widemax_03.txt, subtask_1_widemax_04.txt, subtask_1_widemax_05.txt, subtask_1_widemax_06.txt, subtask_1_widemax_07.txt, subtask_1_widemax_08.txt, subtask_1_widemax_09.txt, subtask_1_widemax_10.txt
Case Name Status Exec Time Memory
sample_01.txt AC 2 ms 2304 KB
sample_02.txt AC 2 ms 2304 KB
subtask_1_dense_max_01.txt AC 167 ms 4608 KB
subtask_1_dense_max_02.txt AC 167 ms 4608 KB
subtask_1_dense_max_03.txt AC 168 ms 4608 KB
subtask_1_dense_max_04.txt AC 168 ms 4608 KB
subtask_1_dense_rand_01.txt AC 101 ms 4480 KB
subtask_1_dense_rand_02.txt AC 111 ms 4480 KB
subtask_1_dense_rand_03.txt AC 5 ms 2304 KB
subtask_1_dense_rand_04.txt AC 25 ms 2304 KB
subtask_1_max_01.txt AC 168 ms 4608 KB
subtask_1_max_02.txt AC 168 ms 4608 KB
subtask_1_max_03.txt AC 168 ms 4608 KB
subtask_1_max_04.txt AC 168 ms 4608 KB
subtask_1_min_01.txt AC 2 ms 2304 KB
subtask_1_min_02.txt AC 2 ms 2304 KB
subtask_1_rand_01.txt AC 24 ms 2304 KB
subtask_1_rand_02.txt AC 16 ms 2304 KB
subtask_1_rand_03.txt AC 26 ms 2304 KB
subtask_1_rand_04.txt AC 56 ms 4480 KB
subtask_1_widemax_01.txt AC 168 ms 4608 KB
subtask_1_widemax_02.txt AC 168 ms 4608 KB
subtask_1_widemax_03.txt AC 167 ms 4608 KB
subtask_1_widemax_04.txt AC 167 ms 4608 KB
subtask_1_widemax_05.txt AC 167 ms 4608 KB
subtask_1_widemax_06.txt AC 167 ms 4608 KB
subtask_1_widemax_07.txt AC 168 ms 4608 KB
subtask_1_widemax_08.txt AC 168 ms 4608 KB
subtask_1_widemax_09.txt AC 168 ms 4608 KB
subtask_1_widemax_10.txt AC 168 ms 4608 KB