oj.uz

Submission #47852

# Submission time Handle Problem Language Result Execution time Memory
47852 2018-05-08T08:51:51 Z Just_Solve_The_Problem Candies (JOI18_candies) C++11
8 / 100
 52 ms 2476 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int N = (int)1e5 + 7;

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

main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
  }
  for (int j = 1; j <= (n + 1) / 2; j++) {
    memset(dp[j & 1], 0, sizeof dp[j & 1]);
    for (int i = j * 2 - 1; i <= n; i++) {
      dp[j & 1][i] = dp[j & 1][i - 1];
      dp[j & 1][i] = max(dp[j & 1][i], dp[j & 1 ^ 1][i - 2] + a[i]);
    }
    printf("%lld\n", dp[j & 1][n]);
  }
}

Compilation message

candies.cpp:12:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
candies.cpp: In function 'int main()':
candies.cpp:21:45: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
       dp[j & 1][i] = max(dp[j & 1][i], dp[j & 1 ^ 1][i - 2] + a[i]);
                                           ~~^~~
candies.cpp:13:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
   ~~~~~^~~~~~~~~~
candies.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld", &a[i]);
     ~~~~~^~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 2040 KB Output is correct
2 Correct 46 ms 2040 KB Output is correct
3 Correct 45 ms 2108 KB Output is correct
4 Correct 47 ms 2208 KB Output is correct
5 Correct 47 ms 2208 KB Output is correct
6 Correct 47 ms 2208 KB Output is correct
7 Correct 46 ms 2208 KB Output is correct
8 Correct 48 ms 2208 KB Output is correct
9 Correct 46 ms 2208 KB Output is correct
10 Correct 46 ms 2208 KB Output is correct
11 Correct 47 ms 2208 KB Output is correct
12 Correct 46 ms 2208 KB Output is correct
13 Correct 51 ms 2208 KB Output is correct
14 Correct 48 ms 2208 KB Output is correct
15 Correct 50 ms 2208 KB Output is correct
16 Correct 46 ms 2208 KB Output is correct
17 Correct 45 ms 2208 KB Output is correct
18 Correct 46 ms 2248 KB Output is correct
19 Correct 52 ms 2248 KB Output is correct
20 Correct 46 ms 2324 KB Output is correct

Subtask #2
0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 2040 KB Output is correct
2 Correct 46 ms 2040 KB Output is correct
3 Correct 45 ms 2108 KB Output is correct
4 Correct 47 ms 2208 KB Output is correct
5 Correct 47 ms 2208 KB Output is correct
6 Correct 47 ms 2208 KB Output is correct
7 Correct 46 ms 2208 KB Output is correct
8 Correct 48 ms 2208 KB Output is correct
9 Correct 46 ms 2208 KB Output is correct
10 Correct 46 ms 2208 KB Output is correct
11 Correct 47 ms 2208 KB Output is correct
12 Correct 46 ms 2208 KB Output is correct
13 Correct 51 ms 2208 KB Output is correct
14 Correct 48 ms 2208 KB Output is correct
15 Correct 50 ms 2208 KB Output is correct
16 Correct 46 ms 2208 KB Output is correct
17 Correct 45 ms 2208 KB Output is correct
18 Correct 46 ms 2248 KB Output is correct
19 Correct 52 ms 2248 KB Output is correct
20 Correct 46 ms 2324 KB Output is correct
21 Execution timed out 21 ms 2476 KB Time limit exceeded (wall clock)
22 Halted 0 ms 0 KB -