oj.uz

답안 #176226

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
176226 2020-01-08T03:54:02 Z balbit Candies (JOI18_candies) C++14
0 / 100
 5000 ms 504 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i,a,b) for (int i=(a); i<(b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n-1); i>=0; --i)
#define REP1(i,n) FOR(i,1,n+1)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1<<29;
const ll inf = 1ll<<60;
const ll mod = 1e9+7;


void GG(){cout<<"-1\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b) % mo;
}

const int maxn = 1e5+5;

ll val[maxn];

signed main(){
    IOS();
    int n; cin>>n;
    set<int> alive;
    priority_queue<pii> pq;
    REP(i,n) {
        cin>>val[i];
        alive.insert(i);
        pq.push({val[i],i});
    }
    ll re = 0;
    REP(cnt, (n+1)/2) {
        while (val[pq.top().s] != pq.top().f) {
            pq.pop();
        }
        int at = pq.top().s; pq.pop();
        if (at == *alive.begin() or at == *alive.rbegin()) {
            int x;
            if (at!=*alive.begin()) x=*prev(alive.lower_bound(at));
            else x = *alive.upper_bound(at);
            re += val[at]; val[at]=val[x]=-inf;
            alive.erase(at); alive.erase(x);
        }else{
            int x = *prev(alive.lower_bound(at));
            int y = *alive.upper_bound(at);
            alive.erase(x); alive.erase(y);
            re += val[at]; val[at] = -val[at] + val[x] + val[y];
            val[x] = val[y] = -inf;
            pq.push({val[at],at});
        }
        cout<<re<<endl;
    }
}
/*
5
3
5
1
7
6
*/

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5033 ms 504 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 92.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5033 ms 504 KB Time limit exceeded
2 Halted 0 ms 0 KB -