Submission #1691060


Source Code Expand

#include<bits/stdc++.h>
#define maxn 5010
#define maxm 210
using namespace std;
typedef long long ll;
int a[maxn][maxm],n,m,sta[maxn],l[maxn],r[maxn];
ll b[maxn];
ll sum[maxn][maxn];
int main(){
	scanf("%d%d",&n,&m);
	for(int i=2;i<=n;++i)scanf("%lld",&b[i]),b[i]+=b[i-1];
	for(int i=1;i<=n;++i)
		for(int j=1;j<=m;++j)
			scanf("%d",&a[j][i]);
	for(int i=1,tp;i<=m;++i){
		tp=0,sta[tp]=0;
		for(int j=1;j<=n;++j){
			while(tp&&a[i][sta[tp]]<=a[i][j])tp--;
			l[j]=sta[tp]+1,sta[++tp]=j;
		}
		tp=0,sta[tp]=n+1;
		for(int j=n;j>=1;--j){
			while(tp&&a[i][sta[tp]]<a[i][j])tp--;
			r[j]=sta[tp]-1,sta[++tp]=j;
		}
		for(int j=1;j<=n;++j){
			//l[j]..j
			//j..r[j]
			sum[l[j]][j]+=a[i][j];
			sum[l[j]][r[j]+1]-=a[i][j];
			sum[j+1][j]-=a[i][j];
			sum[j+1][r[j]+1]+=a[i][j];
		}
	}
	for(int i=1;i<=n;++i)
		for(int j=1;j<=n;++j)
			sum[i][j]+=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
	long long ans=0;
	for(int i=1;i<=n;++i)
		for(int j=i;j<=n;++j)
			ans=max(ans,sum[i][j]-b[j]+b[i]);
	printf("%lld",ans);
}

Submission Info

Submission Time
Task F - Yakiniku Restaurants
User yfzcsc
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1049 Byte
Status WA
Exec Time 266 ms
Memory 196864 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
                     ^
./Main.cpp:11:55: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=2;i<=n;++i)scanf("%lld",&b[i]),b[i]+=b[i-1];
                                                       ^
./Main.cpp:14:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&a[j][i]);
                        ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 2
AC × 5
WA × 25
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 WA 265 ms 196864 KB
subtask_1_dense_max_02.txt WA 266 ms 196864 KB
subtask_1_dense_max_03.txt WA 265 ms 196864 KB
subtask_1_dense_max_04.txt WA 265 ms 196864 KB
subtask_1_dense_rand_01.txt WA 158 ms 139008 KB
subtask_1_dense_rand_02.txt WA 174 ms 147328 KB
subtask_1_dense_rand_03.txt WA 12 ms 31488 KB
subtask_1_dense_rand_04.txt WA 49 ms 79104 KB
subtask_1_max_01.txt WA 265 ms 196864 KB
subtask_1_max_02.txt WA 265 ms 196864 KB
subtask_1_max_03.txt WA 265 ms 196864 KB
subtask_1_max_04.txt WA 265 ms 196864 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 34 ms 39808 KB
subtask_1_rand_02.txt WA 38 ms 74880 KB
subtask_1_rand_03.txt WA 43 ms 58368 KB
subtask_1_rand_04.txt WA 139 ms 186624 KB
subtask_1_widemax_01.txt WA 265 ms 196864 KB
subtask_1_widemax_02.txt WA 265 ms 196864 KB
subtask_1_widemax_03.txt WA 265 ms 196864 KB
subtask_1_widemax_04.txt WA 265 ms 196864 KB
subtask_1_widemax_05.txt WA 265 ms 196864 KB
subtask_1_widemax_06.txt WA 265 ms 196864 KB
subtask_1_widemax_07.txt WA 266 ms 196864 KB
subtask_1_widemax_08.txt WA 265 ms 196864 KB
subtask_1_widemax_09.txt WA 265 ms 196864 KB
subtask_1_widemax_10.txt WA 265 ms 196864 KB