oj.uz

Submission #839129

# Submission time Handle Problem Language Result Execution time Memory
839129 2023-08-28T18:47:54 Z sysia Candies (JOI18_candies) C++17
100 / 100
 292 ms 24164 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);
    array<set<T>, 2>s;
    for (int i = 1; i<=n; i++) s[1].insert({a[i], i});
    //przedzial ma zawsze nieparzysta dlugosc --> zmiana zwieksza ilosc ciastek o 1
    //not really, czasami nie da sie dolaczyc hshs
    int ans = 0, cnt = 0;
    vector<int>vis(n+1);
    auto get = [&](int l, int r){return (r-l+1)%2;};
    for (int rep = 1; rep <= (n+1)/2; rep++){
        while (1){
            int C = (cnt == rep || s[1].empty() ? 0 : 1);
            if (s[C].empty()) break;
            auto [val, l] = *s[C].rbegin();
            if (!C && val <= 0) break;
            cnt += C;
            s[C].erase(--(s[C].end()));
            ans += val;
            vis[l] ^= 1;
            vis[R[l]] = C;
            debug(val, l, R[l]);
            //zmergowac
            int nl = l, nr = R[l], newcost = 0;
            if (l > 1 && vis[l-1] != vis[l]) {
                // cerr << "connect to ";debug(L[l-1], l-1);
                nl = L[l-1];
                s[get(nl, l-1)].erase(T{cost[L[l-1]], L[l-1]});
                newcost += cost[nl];
            }
            if (R[l] < n && vis[R[l]] != vis[R[l]+1]) {
                // cerr << "connect to "; debug(R[l]+1, R[R[l]+1]);
                nr = R[R[l]+1];
                s[get(R[l]+1, R[R[l]+1])].erase(T{cost[R[l]+1], R[l]+1});
                newcost += cost[R[l]+1];
            }
            newcost -= cost[l];
            cost[nl] = newcost;
            s[get(nl, nr)].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 460 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 2 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 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 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 2 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 460 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 2 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 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 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 2 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 266 ms 24012 KB Output is correct
22 Correct 233 ms 24080 KB Output is correct
23 Correct 261 ms 24164 KB Output is correct
24 Correct 98 ms 23884 KB Output is correct
25 Correct 97 ms 23844 KB Output is correct
26 Correct 96 ms 23872 KB Output is correct
27 Correct 120 ms 24124 KB Output is correct
28 Correct 120 ms 24080 KB Output is correct
29 Correct 118 ms 24064 KB Output is correct
30 Correct 123 ms 24132 KB Output is correct
31 Correct 132 ms 24012 KB Output is correct
32 Correct 115 ms 24028 KB Output is correct
33 Correct 175 ms 23832 KB Output is correct
34 Correct 176 ms 23872 KB Output is correct
35 Correct 179 ms 23916 KB Output is correct
36 Correct 292 ms 24068 KB Output is correct
37 Correct 228 ms 24012 KB Output is correct
38 Correct 236 ms 24076 KB Output is correct
39 Correct 96 ms 23884 KB Output is correct
40 Correct 101 ms 23928 KB Output is correct
41 Correct 98 ms 23892 KB Output is correct
42 Correct 115 ms 24080 KB Output is correct
43 Correct 120 ms 24008 KB Output is correct
44 Correct 112 ms 24024 KB Output is correct
45 Correct 127 ms 24000 KB Output is correct
46 Correct 119 ms 24092 KB Output is correct
47 Correct 117 ms 24076 KB Output is correct
48 Correct 197 ms 23880 KB Output is correct
49 Correct 182 ms 23884 KB Output is correct
50 Correct 210 ms 23940 KB Output is correct