Submission #1693976


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int a[5010][5010],ans[5010],s[5010];
int main()
{
	int n,m;scanf("%d%d",&n,&m);
	for (int i=2;i<=n;i++) {int w;scanf("%d",&w);s[i]=s[i-1]+w;}
	for (int i=1;i<=n;i++)
	for (int j=1;j<=m;j++)
		scanf("%d",&a[i][j]);
	long long all=0;
	for (int i=1;i<=n;i++)
	{
		long long ths=0;
		for (int j=1;j<=n;j++) ans[j]=0;
		for (int j=i;j<=n;j++)
		{
			for (int k=1;k<=m;k++) if (ans[k]<a[j][k])
			{
				ths+=a[j][k]-ans[k];
				ans[k]=a[j][k];
			}
			all=max(all,ths+s[i]-s[j]);
		}
	}
	cout<<all<<endl;
}
		

Submission Info

Submission Time
Task F - Yakiniku Restaurants
User yx_lu
Language C++14 (GCC 5.4.1)
Score 0
Code Size 575 Byte
Status WA
Exec Time 2104 ms
Memory 95360 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:6: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:7:46: 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);s[i]=s[i-1]+w;}
                                              ^
./Main.cpp:10:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i][j]);
                       ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 2
AC × 8
WA × 4
TLE × 18
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 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
subtask_1_dense_max_01.txt TLE 2104 ms 95360 KB
subtask_1_dense_max_02.txt TLE 2104 ms 95360 KB
subtask_1_dense_max_03.txt TLE 2103 ms 95360 KB
subtask_1_dense_max_04.txt TLE 2104 ms 95360 KB
subtask_1_dense_rand_01.txt AC 1020 ms 68352 KB
subtask_1_dense_rand_02.txt AC 1180 ms 72448 KB
subtask_1_dense_rand_03.txt AC 20 ms 14976 KB
subtask_1_dense_rand_04.txt AC 169 ms 37504 KB
subtask_1_max_01.txt TLE 2104 ms 95360 KB
subtask_1_max_02.txt TLE 2104 ms 95360 KB
subtask_1_max_03.txt TLE 2104 ms 95360 KB
subtask_1_max_04.txt TLE 2103 ms 95360 KB
subtask_1_min_01.txt AC 1 ms 256 KB
subtask_1_min_02.txt AC 1 ms 256 KB
subtask_1_rand_01.txt WA 100 ms 19200 KB
subtask_1_rand_02.txt WA 104 ms 35456 KB
subtask_1_rand_03.txt WA 146 ms 27392 KB
subtask_1_rand_04.txt WA 546 ms 90880 KB
subtask_1_widemax_01.txt TLE 2103 ms 95360 KB
subtask_1_widemax_02.txt TLE 2104 ms 95360 KB
subtask_1_widemax_03.txt TLE 2104 ms 95360 KB
subtask_1_widemax_04.txt TLE 2104 ms 95360 KB
subtask_1_widemax_05.txt TLE 2104 ms 95360 KB
subtask_1_widemax_06.txt TLE 2104 ms 95360 KB
subtask_1_widemax_07.txt TLE 2103 ms 95360 KB
subtask_1_widemax_08.txt TLE 2104 ms 95360 KB
subtask_1_widemax_09.txt TLE 2103 ms 95360 KB
subtask_1_widemax_10.txt TLE 2104 ms 95360 KB