Submission #1694572


Source Code Expand

#include<bits/stdc++.h>
#define N 5003
using namespace std;
int sta[205][N],top[205];
long long d[N];//d->delta
int food[N][205];
int n,m;
long long ans=0;
#define  add(l,r,val) (d[r]+=val,d[(l)-1]-=val)
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1,v;i<n;i++) scanf("%d",&v),d[i]=-v;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			scanf("%d",&food[i][j]);
	
	for(int i=1,t2;i<=n;i++){
		t2=d[i];
		for(int j=1,t;j<=m;j++){
			while(top[j]>0&&(t=food[sta[j][top[j]]][j])<food[i][j])
				add(sta[j][top[j]-1]+1,sta[j][top[j]],-t),top[j]--;
			add(sta[j][top[j]]+1,i,food[i][j]);
			sta[j][++top[j]]=i;
		}
		long long t=d[i]-t2;
		for(int j=i-1;j>=0;j--)	ans=max(ans,t),t+=d[j];
	}
	cout<<ans<<endl;
	return 0;
} 

Submission Info

Submission Time
Task F - Yakiniku Restaurants
User Wuvin
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 745 Byte
Status AC
Exec Time 153 ms
Memory 6784 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11: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:12:47: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1,v;i<n;i++) scanf("%d",&v),d[i]=-v;
                                               ^
./Main.cpp:15:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&food[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 4 ms 4476 KB
sample_02.txt AC 3 ms 4352 KB
subtask_1_dense_max_01.txt AC 152 ms 6784 KB
subtask_1_dense_max_02.txt AC 152 ms 6784 KB
subtask_1_dense_max_03.txt AC 152 ms 6784 KB
subtask_1_dense_max_04.txt AC 152 ms 6784 KB
subtask_1_dense_rand_01.txt AC 96 ms 6656 KB
subtask_1_dense_rand_02.txt AC 106 ms 6656 KB
subtask_1_dense_rand_03.txt AC 6 ms 4992 KB
subtask_1_dense_rand_04.txt AC 25 ms 5888 KB
subtask_1_max_01.txt AC 152 ms 6784 KB
subtask_1_max_02.txt AC 153 ms 6784 KB
subtask_1_max_03.txt AC 152 ms 6784 KB
subtask_1_max_04.txt AC 152 ms 6784 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 26 ms 5376 KB
subtask_1_rand_02.txt AC 14 ms 5888 KB
subtask_1_rand_03.txt AC 28 ms 5504 KB
subtask_1_rand_04.txt AC 36 ms 6400 KB
subtask_1_widemax_01.txt AC 152 ms 6784 KB
subtask_1_widemax_02.txt AC 152 ms 6784 KB
subtask_1_widemax_03.txt AC 152 ms 6784 KB
subtask_1_widemax_04.txt AC 152 ms 6784 KB
subtask_1_widemax_05.txt AC 152 ms 6784 KB
subtask_1_widemax_06.txt AC 152 ms 6784 KB
subtask_1_widemax_07.txt AC 152 ms 6784 KB
subtask_1_widemax_08.txt AC 152 ms 6784 KB
subtask_1_widemax_09.txt AC 152 ms 6784 KB
subtask_1_widemax_10.txt AC 152 ms 6784 KB