Submission #1693982


Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstring>
 
using namespace std;
 
typedef long long int64;
 
int N, M;
int64 A[5001];
int B[5001][200];
int ans[200];
 
int main()
{
 
  scanf("%d %d", &N, &M);
  for(int i = 1; i < N; i++) {
    scanf("%lld", &A[i]);
    A[i] += A[i - 1];
  }
  for(int i = 0; i < N; i++) {
    for(int j = 0; j < M; j++) scanf("%d", &B[i][j]);
  }
 
  int64 ret = 0;
  for(int i = 0; i < N; i++) {
    memset(ans, 0, sizeof(ans));
    int64 res = 0;
    for(int j = i; j < N; j++) {
      for(int k = 0; k < M; k++) {
        if(ans[k] < B[j][k]) {
          res += B[j][k] - ans[k];
          ans[k] = B[j][k];
        }
      }
      ret = max(ret, res + A[i] - A[j]);
    }
  }
 
  printf("%lld\n", ret);
}

Submission Info

Submission Time
Task F - Yakiniku Restaurants
User yx_lu
Language C++14 (GCC 5.4.1)
Score 0
Code Size 783 Byte
Status TLE
Exec Time 2103 ms
Memory 4352 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:17:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &N, &M);
                         ^
./Main.cpp:19:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld", &A[i]);
                         ^
./Main.cpp:23:53: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     for(int j = 0; j < M; j++) scanf("%d", &B[i][j]);
                                                     ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 2
AC × 12
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 2103 ms 4224 KB
subtask_1_dense_max_02.txt TLE 2103 ms 4224 KB
subtask_1_dense_max_03.txt TLE 2103 ms 4224 KB
subtask_1_dense_max_04.txt TLE 2103 ms 4224 KB
subtask_1_dense_rand_01.txt AC 1012 ms 2944 KB
subtask_1_dense_rand_02.txt AC 1175 ms 3200 KB
subtask_1_dense_rand_03.txt AC 18 ms 896 KB
subtask_1_dense_rand_04.txt AC 166 ms 1792 KB
subtask_1_max_01.txt TLE 2103 ms 4224 KB
subtask_1_max_02.txt TLE 2103 ms 4224 KB
subtask_1_max_03.txt TLE 2103 ms 4224 KB
subtask_1_max_04.txt TLE 2103 ms 4224 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 AC 98 ms 1024 KB
subtask_1_rand_02.txt AC 101 ms 1792 KB
subtask_1_rand_03.txt AC 143 ms 1408 KB
subtask_1_rand_04.txt AC 551 ms 3968 KB
subtask_1_widemax_01.txt TLE 2103 ms 4224 KB
subtask_1_widemax_02.txt TLE 2103 ms 4224 KB
subtask_1_widemax_03.txt TLE 2103 ms 4352 KB
subtask_1_widemax_04.txt TLE 2103 ms 4224 KB
subtask_1_widemax_05.txt TLE 2103 ms 4224 KB
subtask_1_widemax_06.txt TLE 2103 ms 4224 KB
subtask_1_widemax_07.txt TLE 2103 ms 4224 KB
subtask_1_widemax_08.txt TLE 2103 ms 4224 KB
subtask_1_widemax_09.txt TLE 2103 ms 4224 KB
subtask_1_widemax_10.txt TLE 2103 ms 4224 KB