# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
172464 | 2020-01-01T15:17:55 Z | mhy908 | Candies (JOI18_candies) | C++14 | 5 ms | 504 KB |
#include <bits/stdc++.h> #define pb push_back #define mp make_pair #define F first #define S second #define all(x) x.begin(), x.end() using namespace std; typedef long long LL; typedef pair<int, int> pii; typedef pair<LL, LL> pll; const LL llinf=9000000000000000000; const int inf=2000000000; int n; LL arr[200010], pr[200010], ne[100010]; LL ri[200010]; priority_queue<pair<LL, int> > pq; int main() { scanf("%d", &n); for(int i=1; i<=n; i++){ scanf("%lld", &arr[i]); pq.push(mp(arr[i], i)); if(i>1)pr[i]=i-1; if(i<n)ne[i]=i+1; } LL ans=0; for(int i=1; i<=(n+1)/2; i++){ while(pq.top().F!=arr[pq.top().S])pq.pop(); int t=pq.top().S; ans+=arr[t]; printf("%lld\n", ans); int l=pr[t]; int r=ne[t]; ne[t]=ne[r]; pr[t]=pr[l]; pr[ne[r]]=t; ne[pr[l]]=t; if(l&&r)arr[i]=max(arr[l]+arr[r]-arr[t], -llinf); else arr[t]=-llinf; arr[l]=arr[r]=-llinf; pq.push(mp(arr[t], t)); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 504 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 504 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |