oj.uz

Submission #298221

# Submission time Handle Problem Language Result Execution time Memory
298221 2020-09-12T15:30:19 Z RezwanArefin01 Candies (JOI18_candies) C++17
8 / 100
 16 ms 16384 KB 
#include <bits/stdc++.h>
using namespace std; 

typedef long long ll;
typedef pair<ll, int> ii; 


const int N = 2001; 

int n; 
ll a[N], dp[N][N]; 

int main() {
#ifdef LOCAL
  freopen("in", "r", stdin); 
#endif
  scanf("%d", &n); 
  for(int i = 1; i <= n; ++i) {
    scanf("%lld", &a[i]); 
  }
  
  dp[1][1] = a[1];
  dp[2][1] = max(a[1], a[2]); 

  for(int i = 3; i <= n; ++i) {
    for(int j = 1; j <= (i + 1) / 2; ++j) {
      dp[i][j] = dp[i - 1][j]; 
      dp[i][j] = max(dp[i][j], dp[i - 2][j - 1] + a[i]); 
    }
  }


  for(int i = 1; i <= (n + 1) / 2; ++i) {
    cout << dp[n][i] << endl; 
  }
  return 0;
}

Compilation message

candies.cpp: In function 'int main()':
candies.cpp:17:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   17 |   scanf("%d", &n);
      |   ~~~~~^~~~~~~~~~
candies.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   19 |     scanf("%lld", &a[i]);
      |     ~~~~~^~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 16256 KB Output is correct
2 Correct 13 ms 16256 KB Output is correct
3 Correct 16 ms 16384 KB Output is correct
4 Correct 13 ms 16256 KB Output is correct
5 Correct 13 ms 16256 KB Output is correct
6 Correct 13 ms 16256 KB Output is correct
7 Correct 13 ms 16256 KB Output is correct
8 Correct 13 ms 16256 KB Output is correct
9 Correct 12 ms 16256 KB Output is correct
10 Correct 12 ms 16256 KB Output is correct
11 Correct 13 ms 16256 KB Output is correct
12 Correct 12 ms 16256 KB Output is correct
13 Correct 13 ms 16256 KB Output is correct
14 Correct 12 ms 16256 KB Output is correct
15 Correct 13 ms 16256 KB Output is correct
16 Correct 13 ms 16256 KB Output is correct
17 Correct 13 ms 16256 KB Output is correct
18 Correct 14 ms 16256 KB Output is correct
19 Correct 12 ms 16256 KB Output is correct
20 Correct 13 ms 16256 KB Output is correct

Subtask #2
0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 16256 KB Output is correct
2 Correct 13 ms 16256 KB Output is correct
3 Correct 16 ms 16384 KB Output is correct
4 Correct 13 ms 16256 KB Output is correct
5 Correct 13 ms 16256 KB Output is correct
6 Correct 13 ms 16256 KB Output is correct
7 Correct 13 ms 16256 KB Output is correct
8 Correct 13 ms 16256 KB Output is correct
9 Correct 12 ms 16256 KB Output is correct
10 Correct 12 ms 16256 KB Output is correct
11 Correct 13 ms 16256 KB Output is correct
12 Correct 12 ms 16256 KB Output is correct
13 Correct 13 ms 16256 KB Output is correct
14 Correct 12 ms 16256 KB Output is correct
15 Correct 13 ms 16256 KB Output is correct
16 Correct 13 ms 16256 KB Output is correct
17 Correct 13 ms 16256 KB Output is correct
18 Correct 14 ms 16256 KB Output is correct
19 Correct 12 ms 16256 KB Output is correct
20 Correct 13 ms 16256 KB Output is correct
21 Execution timed out 1 ms 384 KB Time limit exceeded (wall clock)
22 Halted 0 ms 0 KB -