oj.uz

답안 #129328

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
129328 2019-07-12T03:38:02 Z BThero Candies (JOI18_candies) C++17
8 / 100
 327 ms 66268 KB 
// Why am I so dumb? :c
// chrono::system_clock::now().time_since_epoch().count()

//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

#define pb push_back
#define mp make_pair

#define all(x) (x).begin(), (x).end()

#define fi first
#define se second

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;   
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int MAXN = (int)2e3 + 5;
const ll INF = (ll)1e18;

ll dp[MAXN][MAXN];

int arr[MAXN];

int n;

void solve() {
    scanf("%d", &n);

    for (int i = 1; i <= n; ++i) {
        scanf("%d", &arr[i]);
    }

    for (int i = 0; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            dp[i][j] = -INF;
        }
    }

    dp[1][0] = 0;
    dp[1][1] = arr[1];

    for (int i = 2; i <= n; ++i) {
        for (int j = 0; j <= i; ++j) {
            dp[i][j] = dp[i - 1][j];
            
            if (j > 0) {
                dp[i][j] = max(dp[i][j], dp[i - 2][j - 1] + arr[i]);
            }
        }
    }    

    for (int i = 1; i <= (n + 1) / 2; ++i) {
        printf("%lld\n", dp[n][i]);
    }
}

int main() {
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    int tt = 1;

    while (tt--) {
        solve();
    }

    return 0;
}

Compilation message

candies.cpp: In function 'void solve()':
candies.cpp:35:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
candies.cpp:38:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &arr[i]);
         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 31740 KB Output is correct
2 Correct 31 ms 31736 KB Output is correct
3 Correct 31 ms 31736 KB Output is correct
4 Correct 32 ms 31736 KB Output is correct
5 Correct 31 ms 31736 KB Output is correct
6 Correct 31 ms 31864 KB Output is correct
7 Correct 31 ms 31864 KB Output is correct
8 Correct 32 ms 31740 KB Output is correct
9 Correct 31 ms 31840 KB Output is correct
10 Correct 31 ms 31864 KB Output is correct
11 Correct 31 ms 31740 KB Output is correct
12 Correct 37 ms 31708 KB Output is correct
13 Correct 40 ms 31740 KB Output is correct
14 Correct 37 ms 31736 KB Output is correct
15 Correct 77 ms 31740 KB Output is correct
16 Correct 32 ms 31736 KB Output is correct
17 Correct 31 ms 31736 KB Output is correct
18 Correct 32 ms 31736 KB Output is correct
19 Correct 31 ms 31736 KB Output is correct
20 Correct 31 ms 31736 KB Output is correct

Subtask #2
0 / 92.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 31740 KB Output is correct
2 Correct 31 ms 31736 KB Output is correct
3 Correct 31 ms 31736 KB Output is correct
4 Correct 32 ms 31736 KB Output is correct
5 Correct 31 ms 31736 KB Output is correct
6 Correct 31 ms 31864 KB Output is correct
7 Correct 31 ms 31864 KB Output is correct
8 Correct 32 ms 31740 KB Output is correct
9 Correct 31 ms 31840 KB Output is correct
10 Correct 31 ms 31864 KB Output is correct
11 Correct 31 ms 31740 KB Output is correct
12 Correct 37 ms 31708 KB Output is correct
13 Correct 40 ms 31740 KB Output is correct
14 Correct 37 ms 31736 KB Output is correct
15 Correct 77 ms 31740 KB Output is correct
16 Correct 32 ms 31736 KB Output is correct
17 Correct 31 ms 31736 KB Output is correct
18 Correct 32 ms 31736 KB Output is correct
19 Correct 31 ms 31736 KB Output is correct
20 Correct 31 ms 31736 KB Output is correct
21 Runtime error 327 ms 66268 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -