oj.uz

Submission #467725

# Submission time Handle Problem Language Result Execution time Memory
467725 2021-08-24T08:09:22 Z spike1236 Candies (JOI18_candies) C++14
100 / 100
 414 ms 17604 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];
int n;

void solve() {
    cin >> n;
    set <pair <ll, int> > st;
    a[0] = a[n + 1] = -1e18;
    for(int i = 1; i <= n; ++i) {
        cin >> a[i];
        st.insert(mp(a[i], i));
        L[i] = i - 1;
        R[i] = i + 1;
    }
    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 2 ms 460 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 2 ms 460 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 2 ms 460 KB Output is correct

Subtask #2
92.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 2 ms 460 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 2 ms 460 KB Output is correct
21 Correct 402 ms 17488 KB Output is correct
22 Correct 403 ms 17404 KB Output is correct
23 Correct 406 ms 17484 KB Output is correct
24 Correct 192 ms 17384 KB Output is correct
25 Correct 199 ms 17384 KB Output is correct
26 Correct 163 ms 17504 KB Output is correct
27 Correct 172 ms 17400 KB Output is correct
28 Correct 179 ms 17348 KB Output is correct
29 Correct 174 ms 17468 KB Output is correct
30 Correct 190 ms 17348 KB Output is correct
31 Correct 192 ms 17368 KB Output is correct
32 Correct 182 ms 17364 KB Output is correct
33 Correct 305 ms 17348 KB Output is correct
34 Correct 289 ms 17604 KB Output is correct
35 Correct 277 ms 17420 KB Output is correct
36 Correct 409 ms 17476 KB Output is correct
37 Correct 414 ms 17404 KB Output is correct
38 Correct 386 ms 17564 KB Output is correct
39 Correct 158 ms 17352 KB Output is correct
40 Correct 160 ms 17348 KB Output is correct
41 Correct 162 ms 17348 KB Output is correct
42 Correct 188 ms 17332 KB Output is correct
43 Correct 175 ms 17356 KB Output is correct
44 Correct 173 ms 17352 KB Output is correct
45 Correct 193 ms 17348 KB Output is correct
46 Correct 192 ms 17388 KB Output is correct
47 Correct 188 ms 17392 KB Output is correct
48 Correct 280 ms 17432 KB Output is correct
49 Correct 286 ms 17472 KB Output is correct
50 Correct 278 ms 17344 KB Output is correct