Submission #251630

#	Time	Username	Problem	Language	Result	Execution time	Memory
251630		dantoh000	Candies (JOI18_candies)	C++14	0 / 100	3 ms	640 KiB

candies

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple<ll, ll, ll> iii;
int n;
set<iii> VLR, LRV;
ll ans = 0;
int main(){
    scanf("%d",&n);
    for (int i = 0; i < n; i++){
        ll x;
        scanf("%lld",&x);
        VLR.insert({x,i,i});
        LRV.insert({i,i,x});
    }
    for (int i = 1; i <= (n+1)/2; i++){
        /*for (auto x : VLR){
            int a,b,c;
            tie(a,b,c) = x;
            printf("<%d %d %d>",a,b,c);
        }
        printf("<- VLR\n");
        for (auto x : LRV){
            int a,b,c;
            tie(a,b,c) = x;
            printf("<%d %d %d>",a,b,c);
        }
        printf("<- LRV\n");*/
        ll v,l,r;
        tie(v,l,r) = *(--VLR.end());
        ans += v;
        auto it = LRV.find({l,r,v});
        assert(it != LRV.end());
        v = -v;
        if (it != LRV.begin()){
            auto itL = prev(it);
            ll vL, lL, rL;
            tie(lL, rL, vL) = *itL;
            v += vL;
            VLR.erase({vL,lL,rL});
            LRV.erase(itL);
            l = lL;
        }
        if (next(it) != LRV.end()){
            auto itR = next(it);
            ll vR, lR, rR;
            tie(lR, rR, vR) = *itR;
            v += vR;
            VLR.erase({vR,lR,rR});
            LRV.erase(itR);
            r = rR;
        }
        VLR.erase(--VLR.end());
        LRV.erase(it);
        VLR.insert({v,l,r});
        LRV.insert({l,r,v});
        printf("%lld\n",ans);
    }
}

Compilation message (stderr)

candies.cpp: In function 'int main()':
candies.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
candies.cpp:12:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld",&x);
         ~~~~~^~~~~~~~~~~

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