#include <bits/stdc++.h>
using namespace std;
#define int long long
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1<<(i-1)))
#define gg exit(0);
const int N=200010;
int n,tot;
int a[N],l[N],r[N],dd[N];
priority_queue<ii> q;
main(){
#define task "TASK"
//freopen(task".inp","r",stdin);
//freopen(task".out","w",stdout);
forinc(i,1,n=in) q.push({a[i]=in,i}), l[i]=i-1,r[i]=i+1;
a[0]=a[n+1]=-1e16;
forinc(ti,1,(n+1)/2){
while(dd[q.top().se]) q.pop();
int val,i; tie(val,i)=q.top(); q.pop();
tot+=val; cout<<tot<<"\n";
dd[l[i]]=dd[r[i]]=1;
a[i]=a[l[i]]+a[r[i]]-a[i]; q.push({a[i],i});
l[i]=l[l[i]], r[l[i]]=i;
r[i]=r[r[i]], l[r[i]]=i;
}
}
Compilation message
candies.cpp:29:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main(){
^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
512 KB |
Output is correct |
| 2 |
Correct |
5 ms |
512 KB |
Output is correct |
| 3 |
Correct |
5 ms |
512 KB |
Output is correct |
| 4 |
Correct |
5 ms |
512 KB |
Output is correct |
| 5 |
Correct |
6 ms |
512 KB |
Output is correct |
| 6 |
Correct |
5 ms |
512 KB |
Output is correct |
| 7 |
Correct |
6 ms |
512 KB |
Output is correct |
| 8 |
Correct |
5 ms |
512 KB |
Output is correct |
| 9 |
Correct |
5 ms |
512 KB |
Output is correct |
| 10 |
Correct |
5 ms |
512 KB |
Output is correct |
| 11 |
Correct |
5 ms |
512 KB |
Output is correct |
| 12 |
Correct |
5 ms |
512 KB |
Output is correct |
| 13 |
Correct |
5 ms |
512 KB |
Output is correct |
| 14 |
Correct |
5 ms |
512 KB |
Output is correct |
| 15 |
Correct |
5 ms |
512 KB |
Output is correct |
| 16 |
Correct |
5 ms |
512 KB |
Output is correct |
| 17 |
Correct |
5 ms |
512 KB |
Output is correct |
| 18 |
Correct |
5 ms |
512 KB |
Output is correct |
| 19 |
Correct |
5 ms |
512 KB |
Output is correct |
| 20 |
Correct |
5 ms |
512 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
512 KB |
Output is correct |
| 2 |
Correct |
5 ms |
512 KB |
Output is correct |
| 3 |
Correct |
5 ms |
512 KB |
Output is correct |
| 4 |
Correct |
5 ms |
512 KB |
Output is correct |
| 5 |
Correct |
6 ms |
512 KB |
Output is correct |
| 6 |
Correct |
5 ms |
512 KB |
Output is correct |
| 7 |
Correct |
6 ms |
512 KB |
Output is correct |
| 8 |
Correct |
5 ms |
512 KB |
Output is correct |
| 9 |
Correct |
5 ms |
512 KB |
Output is correct |
| 10 |
Correct |
5 ms |
512 KB |
Output is correct |
| 11 |
Correct |
5 ms |
512 KB |
Output is correct |
| 12 |
Correct |
5 ms |
512 KB |
Output is correct |
| 13 |
Correct |
5 ms |
512 KB |
Output is correct |
| 14 |
Correct |
5 ms |
512 KB |
Output is correct |
| 15 |
Correct |
5 ms |
512 KB |
Output is correct |
| 16 |
Correct |
5 ms |
512 KB |
Output is correct |
| 17 |
Correct |
5 ms |
512 KB |
Output is correct |
| 18 |
Correct |
5 ms |
512 KB |
Output is correct |
| 19 |
Correct |
5 ms |
512 KB |
Output is correct |
| 20 |
Correct |
5 ms |
512 KB |
Output is correct |
| 21 |
Correct |
129 ms |
11356 KB |
Output is correct |
| 22 |
Correct |
133 ms |
11300 KB |
Output is correct |
| 23 |
Correct |
126 ms |
11488 KB |
Output is correct |
| 24 |
Correct |
102 ms |
11356 KB |
Output is correct |
| 25 |
Correct |
100 ms |
11356 KB |
Output is correct |
| 26 |
Correct |
98 ms |
11484 KB |
Output is correct |
| 27 |
Correct |
117 ms |
11484 KB |
Output is correct |
| 28 |
Correct |
109 ms |
11360 KB |
Output is correct |
| 29 |
Correct |
107 ms |
11484 KB |
Output is correct |
| 30 |
Correct |
109 ms |
11356 KB |
Output is correct |
| 31 |
Correct |
116 ms |
11356 KB |
Output is correct |
| 32 |
Correct |
116 ms |
11360 KB |
Output is correct |
| 33 |
Correct |
119 ms |
11356 KB |
Output is correct |
| 34 |
Correct |
122 ms |
11360 KB |
Output is correct |
| 35 |
Correct |
118 ms |
11356 KB |
Output is correct |
| 36 |
Correct |
135 ms |
11356 KB |
Output is correct |
| 37 |
Correct |
127 ms |
11484 KB |
Output is correct |
| 38 |
Correct |
128 ms |
11484 KB |
Output is correct |
| 39 |
Correct |
98 ms |
11356 KB |
Output is correct |
| 40 |
Correct |
99 ms |
11460 KB |
Output is correct |
| 41 |
Correct |
101 ms |
11492 KB |
Output is correct |
| 42 |
Correct |
108 ms |
11360 KB |
Output is correct |
| 43 |
Correct |
111 ms |
11484 KB |
Output is correct |
| 44 |
Correct |
115 ms |
11360 KB |
Output is correct |
| 45 |
Correct |
119 ms |
11356 KB |
Output is correct |
| 46 |
Correct |
113 ms |
11392 KB |
Output is correct |
| 47 |
Correct |
116 ms |
11556 KB |
Output is correct |
| 48 |
Correct |
116 ms |
11356 KB |
Output is correct |
| 49 |
Correct |
116 ms |
11340 KB |
Output is correct |
| 50 |
Correct |
112 ms |
11356 KB |
Output is correct |
