| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 839217 |
2023-08-29T08:07:26 Z |
sysia |
Candies (JOI18_candies) |
C++17 |
|
80 ms |
11360 KB |
//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
#define int long long
typedef pair<int, int> T;
void solve(){
int n; cin >> n;
vector<int>a(n+2), L(n+2), R(n+2);
for (int i = 1; i<=n; i++) {
cin >> a[i];
}
iota(L.begin(), L.end(), 0);
iota(R.begin(), R.end(), 0);
auto cost = a;
priority_queue<T>pq;
vector<bool>beg(n+2, 1);
for (int i = 1; i<=n; i++) pq.push({a[i], i});
//niezmiennik --> konce przedzialow sa puste
//przedzial ma zawsze nieparzysta dlugosc --> zmiana zwieksza ilosc ciastek o 1
//not really, czasami nie da sie dolaczyc hshs
//claim: przedzialy parzyste na prefiksie i sukfiksie sa useless
//skoro wybieramy a[1], to a[1] >= a[2], dalej jakby tych dwoch elementow w ogole nie bylo
//wtedy wartosci nie maja znaczenia, bo ostatni na prefiksie bedzie pusty
int ans = 0;
for (int rep = 1; rep <= (n+1)/2; rep++){
while (!beg[pq.top().second] || cost[pq.top().second] != pq.top().first) pq.pop();
auto [val, l] = pq.top(); pq.pop();
ans += val;
// debug(val, l, R[l]);
int nl = L[l-1];
int nr = R[R[l]+1];
int newcost = cost[nl] + cost[R[l]+1] - cost[l];
nl = max(nl, 1ll);
nr = min(nr, n);
cost[nl] = newcost;
beg[R[l]+1] = beg[l] = 0;
beg[nl] = 1;
if ((nr-nl)%2==0) pq.push({cost[nl], nl});
R[nl] = nr; L[nr] = nl;
cout << ans << "\n";
}
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
468 KB |
Output is correct |
| 3 |
Correct |
1 ms |
468 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
340 KB |
Output is correct |
| 7 |
Correct |
1 ms |
468 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
340 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 KB |
Output is correct |
| 13 |
Correct |
1 ms |
464 KB |
Output is correct |
| 14 |
Correct |
1 ms |
340 KB |
Output is correct |
| 15 |
Correct |
1 ms |
468 KB |
Output is correct |
| 16 |
Correct |
1 ms |
340 KB |
Output is correct |
| 17 |
Correct |
1 ms |
340 KB |
Output is correct |
| 18 |
Correct |
1 ms |
340 KB |
Output is correct |
| 19 |
Correct |
1 ms |
468 KB |
Output is correct |
| 20 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
468 KB |
Output is correct |
| 3 |
Correct |
1 ms |
468 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
340 KB |
Output is correct |
| 7 |
Correct |
1 ms |
468 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
340 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 KB |
Output is correct |
| 13 |
Correct |
1 ms |
464 KB |
Output is correct |
| 14 |
Correct |
1 ms |
340 KB |
Output is correct |
| 15 |
Correct |
1 ms |
468 KB |
Output is correct |
| 16 |
Correct |
1 ms |
340 KB |
Output is correct |
| 17 |
Correct |
1 ms |
340 KB |
Output is correct |
| 18 |
Correct |
1 ms |
340 KB |
Output is correct |
| 19 |
Correct |
1 ms |
468 KB |
Output is correct |
| 20 |
Correct |
1 ms |
340 KB |
Output is correct |
| 21 |
Correct |
78 ms |
11284 KB |
Output is correct |
| 22 |
Correct |
73 ms |
11328 KB |
Output is correct |
| 23 |
Correct |
74 ms |
11324 KB |
Output is correct |
| 24 |
Correct |
60 ms |
11328 KB |
Output is correct |
| 25 |
Correct |
62 ms |
11328 KB |
Output is correct |
| 26 |
Correct |
61 ms |
11328 KB |
Output is correct |
| 27 |
Correct |
66 ms |
11324 KB |
Output is correct |
| 28 |
Correct |
66 ms |
11324 KB |
Output is correct |
| 29 |
Correct |
75 ms |
11352 KB |
Output is correct |
| 30 |
Correct |
66 ms |
11296 KB |
Output is correct |
| 31 |
Correct |
67 ms |
11324 KB |
Output is correct |
| 32 |
Correct |
68 ms |
11320 KB |
Output is correct |
| 33 |
Correct |
70 ms |
11324 KB |
Output is correct |
| 34 |
Correct |
70 ms |
11324 KB |
Output is correct |
| 35 |
Correct |
80 ms |
11284 KB |
Output is correct |
| 36 |
Correct |
77 ms |
11300 KB |
Output is correct |
| 37 |
Correct |
74 ms |
11276 KB |
Output is correct |
| 38 |
Correct |
79 ms |
11320 KB |
Output is correct |
| 39 |
Correct |
62 ms |
11348 KB |
Output is correct |
| 40 |
Correct |
59 ms |
11324 KB |
Output is correct |
| 41 |
Correct |
60 ms |
11360 KB |
Output is correct |
| 42 |
Correct |
65 ms |
11312 KB |
Output is correct |
| 43 |
Correct |
65 ms |
11324 KB |
Output is correct |
| 44 |
Correct |
66 ms |
11356 KB |
Output is correct |
| 45 |
Correct |
68 ms |
11324 KB |
Output is correct |
| 46 |
Correct |
66 ms |
11320 KB |
Output is correct |
| 47 |
Correct |
66 ms |
11324 KB |
Output is correct |
| 48 |
Incorrect |
72 ms |
11324 KB |
Output isn't correct |
| 49 |
Halted |
0 ms |
0 KB |
- |
