oj.uz

Submission #467718

# Submission time Handle Problem Language Result Execution time Memory
467718 2021-08-24T07:56:56 Z spike1236 Candies (JOI18_candies) C++14
8 / 100
 457 ms 32220 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>

const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

const int MAXN = 2e5 + 10;
ll a[MAXN];
int L[MAXN], R[MAXN];
ll dp[2020][2020];
int n;

void solve() {
    cin >> n;
    set <pair <ll, int> > st;
    for(int i = 1; i <= n; ++i) {
        cin >> a[i];
        st.insert(mp(a[i], i));
        L[i] = i - 1;
        R[i] = i + 1;
    }
    if(n <= 2000) {
        for(int i = 0; i <= n; ++i) fill(dp[i], dp[i] + n + 1, (ll)-1e18);
        dp[0][0] = 0;
        dp[1][0] = 0;
        dp[1][1] = a[1];
        for(int i = 2; i <= n; ++i) {
            dp[i][0] = 0;
            for(int j = 1; j <= (i + 1) / 2; ++j) dp[i][j] = max(dp[i - 1][j], dp[i - 2][j - 1] + a[i]);
        }
        for(int i = 1; i <= (n + 1) / 2; ++i) cout << dp[n][i] << '\n';
        return;
    }
    ll ans = 0;
    for(int cs = 1; cs <= (n + 1) / 2; ++cs) {
        pair <ll, int> mx = *st.rbegin();
        st.erase(mx);
        ans += mx.f;
        int i = mx.s;
        int lf = L[i], rg = R[i];
        if(lf) st.erase(mp(a[lf], lf));
        if(rg <= n) st.erase(mp(a[rg], rg));
        if(lf) L[i] = L[lf];
        else L[i] = 0;
        if(rg <= n) R[i] = R[rg];
        else R[i] = n + 1;
        if(L[i]) R[L[i]] = i;
        if(R[i] <= n) L[R[i]] = i;
        a[i] = a[lf] + a[rg] - a[i];
        st.insert(mp(a[i], i));
        cout << ans << "\n";
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int CNT_TESTS = 1;
    ///cin >> CNT_TESTS;
    for(int NUMCASE = 1; NUMCASE <= CNT_TESTS; ++NUMCASE) {
        solve();
        if(NUMCASE != CNT_TESTS) cout << '\n';
    }
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 32040 KB Output is correct
2 Correct 22 ms 32084 KB Output is correct
3 Correct 20 ms 32140 KB Output is correct
4 Correct 21 ms 32140 KB Output is correct
5 Correct 20 ms 32108 KB Output is correct
6 Correct 20 ms 32136 KB Output is correct
7 Correct 21 ms 32148 KB Output is correct
8 Correct 21 ms 32220 KB Output is correct
9 Correct 19 ms 32068 KB Output is correct
10 Correct 19 ms 32160 KB Output is correct
11 Correct 20 ms 32028 KB Output is correct
12 Correct 20 ms 32152 KB Output is correct
13 Correct 21 ms 32076 KB Output is correct
14 Correct 20 ms 32076 KB Output is correct
15 Correct 21 ms 32060 KB Output is correct
16 Correct 21 ms 32152 KB Output is correct
17 Correct 20 ms 32152 KB Output is correct
18 Correct 21 ms 32124 KB Output is correct
19 Correct 20 ms 32036 KB Output is correct
20 Correct 19 ms 32076 KB Output is correct

Subtask #2
0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 32040 KB Output is correct
2 Correct 22 ms 32084 KB Output is correct
3 Correct 20 ms 32140 KB Output is correct
4 Correct 21 ms 32140 KB Output is correct
5 Correct 20 ms 32108 KB Output is correct
6 Correct 20 ms 32136 KB Output is correct
7 Correct 21 ms 32148 KB Output is correct
8 Correct 21 ms 32220 KB Output is correct
9 Correct 19 ms 32068 KB Output is correct
10 Correct 19 ms 32160 KB Output is correct
11 Correct 20 ms 32028 KB Output is correct
12 Correct 20 ms 32152 KB Output is correct
13 Correct 21 ms 32076 KB Output is correct
14 Correct 20 ms 32076 KB Output is correct
15 Correct 21 ms 32060 KB Output is correct
16 Correct 21 ms 32152 KB Output is correct
17 Correct 20 ms 32152 KB Output is correct
18 Correct 21 ms 32124 KB Output is correct
19 Correct 20 ms 32036 KB Output is correct
20 Correct 19 ms 32076 KB Output is correct
21 Incorrect 457 ms 19392 KB Output isn't correct
22 Halted 0 ms 0 KB -