oj.uz

Submission #839123

# Submission time Handle Problem Language Result Execution time Memory
839123 2023-08-28T18:02:31 Z sysia Candies (JOI18_candies) C++17
0 / 100
 1 ms 468 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
    int ans = 0, cnt = 0;
    for (int rep = 1; rep <= (n+1)/2; rep++){
        while (cnt < rep){
            assert((int)s.size());
            auto [val, l] = *s.rbegin();
            s.erase(--(s.end()));
            ans += val;
            debug(val, l);
            cnt += ((R[l] - l + 1)%2);
            //zmergowac
            int nl = l, nr = R[l], newcost = 0;
            if (l > 1) {
                s.erase(T{cost[L[l-1]], L[l-1]});
                nl = L[l-1];
                newcost += cost[nl];
            }
            if (R[l] < n) {
                s.erase(T{cost[R[l]+1], R[l]+1});
                nr = R[R[l]+1];
                newcost += cost[R[l]+1];
            }
            newcost -= cost[l];
            cost[nl] = newcost;
            s.insert({cost[nl], nl});
            R[nl] = nr; L[nr] = nl;
            cout << ans << "\n";
            debug(s);
        }
    }
}

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
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 92.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -