oj.uz

Submission #839132

# Submission time Handle Problem Language Result Execution time Memory
839132 2023-08-28T19:19:34 Z sysia Candies (JOI18_candies) C++17
100 / 100
 286 ms 20632 KB 
//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
 
void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
 
#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;
 
void solve(){
    int n; cin >> n;
    vector<int>a(n+2), L(n+2), R(n+2);
    for (int i = 1; i<=n; i++) cin >> a[i];
    auto cost = a;
    //niezmiennik --> konce przedzialow sa puste
    iota(L.begin(), L.end(), 0);
    iota(R.begin(), R.end(), 0);
    set<T>s;
    for (int i = 1; i<=n; i++) s.insert({a[i], i});
    //przedzial ma zawsze nieparzysta dlugosc --> zmiana zwieksza ilosc ciastek o 1
    //not really, czasami nie da sie dolaczyc hshs
    //claim: przedzialy parzyste na prefiksie i sukfiksie sa useless
    //wtedy wartosci nie maja znaczenia, bo ostatni na prefiksie bedzie pusty
    int ans = 0;
    auto get = [&](int l, int r){return (r-l+1)%2;};
    for (int rep = 1; rep <= (n+1)/2; rep++){
        auto [val, l] = *s.rbegin();
        s.erase(--(s.end()));
        ans += val;
        debug(val, l, R[l]);
        int nl = l, nr = R[l], newcost = 0;
        if (l > 1) {
            nl = L[l-1];
            s.erase(T{cost[L[l-1]], L[l-1]});
            newcost += cost[nl];
        }
        if (R[l] < n) {
            nr = R[R[l]+1];
            s.erase(T{cost[R[l]+1], R[l]+1});
            newcost += cost[R[l]+1];
        }
        newcost -= cost[l];
        cost[nl] = newcost;
        if (get(nl, nr)) s.insert({cost[nl], nl});
        R[nl] = nr; L[nr] = nl;
        debug(s);
        cout << ans << "\n";
    }
}
 
int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    int t = 1;
    //cin >> t;
    while (t--) solve();
 
    return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
92.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 286 ms 20584 KB Output is correct
22 Correct 229 ms 20544 KB Output is correct
23 Correct 214 ms 20568 KB Output is correct
24 Correct 92 ms 20556 KB Output is correct
25 Correct 107 ms 20556 KB Output is correct
26 Correct 110 ms 20556 KB Output is correct
27 Correct 109 ms 20560 KB Output is correct
28 Correct 116 ms 20544 KB Output is correct
29 Correct 119 ms 20572 KB Output is correct
30 Correct 111 ms 20556 KB Output is correct
31 Correct 111 ms 20584 KB Output is correct
32 Correct 109 ms 20520 KB Output is correct
33 Correct 195 ms 20504 KB Output is correct
34 Correct 178 ms 20516 KB Output is correct
35 Correct 181 ms 20528 KB Output is correct
36 Correct 207 ms 20556 KB Output is correct
37 Correct 239 ms 20520 KB Output is correct
38 Correct 214 ms 20528 KB Output is correct
39 Correct 99 ms 20564 KB Output is correct
40 Correct 91 ms 20520 KB Output is correct
41 Correct 94 ms 20556 KB Output is correct
42 Correct 112 ms 20560 KB Output is correct
43 Correct 103 ms 20532 KB Output is correct
44 Correct 106 ms 20544 KB Output is correct
45 Correct 110 ms 20504 KB Output is correct
46 Correct 108 ms 20556 KB Output is correct
47 Correct 112 ms 20632 KB Output is correct
48 Correct 187 ms 20588 KB Output is correct
49 Correct 190 ms 20520 KB Output is correct
50 Correct 223 ms 20580 KB Output is correct