Submission #1305439

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305439		Zbyszek99	Candies (JOI18_candies)	C++20	100 / 100	326 ms	25420 KiB

candies

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

ll arr[200001];
set<pll> vals;
set<int> poz;

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    int n;
    cin >> n;
    rep(i,n)
    {
        cin >> arr[i];
        vals.insert({arr[i],i});
        poz.insert(i);
    }
    ll ans = 0;
    rep(i,(n+1)/2)
    {
        ans += (*--vals.end()).ff;
        cout << ans << "\n";
        ll new_val = -(*--vals.end()).ff;
        int new_poz = (*--vals.end()).ss;
        vals.erase(--vals.end());
        poz.erase(poz.find(new_poz));
        auto it = poz.lower_bound(new_poz);
        bool is = 1;
        if(it != poz.end())
        {
            new_val += arr[*it];
            vals.erase(vals.find({arr[*it],*it}));
            poz.erase(it);
        }
        else is = 0;
        it = poz.lower_bound(new_poz);
        if(it != poz.begin())
        {
            it--;
            new_val += arr[*it];
            new_poz = *it;
            vals.erase(vals.find({arr[*it],*it}));
            poz.erase(it);
        }
        else is = 0;
        if(is)
        {
            arr[new_poz] = new_val;
            poz.insert(new_poz);
            vals.insert({new_val,new_poz});
        }
    }
}

• Subtask 1: 8 / 8
• Subtask 2: 92 / 92