oj.uz

Submission #168118

# Submission time Handle Problem Language Result Execution time Memory
168118 2019-12-11T12:50:09 Z dimash241 Candies (JOI18_candies) C++17
100 / 100
 725 ms 27512 KB 
# include <bits/stdc++.h>

using namespace std;
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m, k;
ll a[N];

ll ans;
set < pair < ll, int > > s;
set < int > id;


int main () {
   	SpeedForce;
	cin >> n;
	for (int i = 1; i <= n; i ++) {
		cin >> a[i];
		s.insert({a[i], i});
		id.insert(i);
    }	

    id.insert(0);
    id.insert(n+1);

    for (int i = 1; i <= (n + 1) / 2; i ++) {
    	auto it = *s.rbegin();
    	s.erase(it);
    	//cout << it.F << ' ' << it.S << '\n';
    	ans += it.F;
    	id.erase(it.S);

    	auto l = *(--id.lower_bound(it.S));
    	auto r = *id.lower_bound(it.S);

    	if (l > 0) {
    		a[it.S] -= a[l];
    		id.erase(l);
    		s.erase({a[l], l});

    	}
    	if (r <= n) {
    		a[it.S] -= a[r];
    		id.erase(r);
    		s.erase({a[r], r});

    	}
    	a[it.S] *= -1ll;

    	if (l >= 1 && r <= n) {
    		s.insert({a[it.S], it.S});
    		id.insert(it.S);
    	}

    	cout << ans << '\n';
    }
    return Accepted;
}

// B...a

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 632 KB Output is correct
2 Correct 4 ms 632 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 4 ms 632 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 5 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 4 ms 632 KB Output is correct
9 Correct 4 ms 632 KB Output is correct
10 Correct 4 ms 632 KB Output is correct
11 Correct 4 ms 632 KB Output is correct
12 Correct 4 ms 632 KB Output is correct
13 Correct 4 ms 632 KB Output is correct
14 Correct 4 ms 632 KB Output is correct
15 Correct 4 ms 632 KB Output is correct
16 Correct 4 ms 632 KB Output is correct
17 Correct 4 ms 632 KB Output is correct
18 Correct 4 ms 632 KB Output is correct
19 Correct 4 ms 632 KB Output is correct
20 Correct 4 ms 632 KB Output is correct

Subtask #2
92.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 632 KB Output is correct
2 Correct 4 ms 632 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 4 ms 632 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 5 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 4 ms 632 KB Output is correct
9 Correct 4 ms 632 KB Output is correct
10 Correct 4 ms 632 KB Output is correct
11 Correct 4 ms 632 KB Output is correct
12 Correct 4 ms 632 KB Output is correct
13 Correct 4 ms 632 KB Output is correct
14 Correct 4 ms 632 KB Output is correct
15 Correct 4 ms 632 KB Output is correct
16 Correct 4 ms 632 KB Output is correct
17 Correct 4 ms 632 KB Output is correct
18 Correct 4 ms 632 KB Output is correct
19 Correct 4 ms 632 KB Output is correct
20 Correct 4 ms 632 KB Output is correct
21 Correct 608 ms 25548 KB Output is correct
22 Correct 651 ms 27260 KB Output is correct
23 Correct 665 ms 27512 KB Output is correct
24 Correct 331 ms 27048 KB Output is correct
25 Correct 325 ms 27108 KB Output is correct
26 Correct 316 ms 27068 KB Output is correct
27 Correct 344 ms 27456 KB Output is correct
28 Correct 344 ms 27384 KB Output is correct
29 Correct 345 ms 27220 KB Output is correct
30 Correct 360 ms 27384 KB Output is correct
31 Correct 361 ms 27384 KB Output is correct
32 Correct 358 ms 27256 KB Output is correct
33 Correct 468 ms 27080 KB Output is correct
34 Correct 471 ms 27128 KB Output is correct
35 Correct 492 ms 27308 KB Output is correct
36 Correct 725 ms 27456 KB Output is correct
37 Correct 623 ms 27512 KB Output is correct
38 Correct 614 ms 27260 KB Output is correct
39 Correct 322 ms 27192 KB Output is correct
40 Correct 321 ms 27128 KB Output is correct
41 Correct 324 ms 27100 KB Output is correct
42 Correct 347 ms 27284 KB Output is correct
43 Correct 340 ms 27384 KB Output is correct
44 Correct 343 ms 27368 KB Output is correct
45 Correct 361 ms 27360 KB Output is correct
46 Correct 353 ms 27332 KB Output is correct
47 Correct 359 ms 27384 KB Output is correct
48 Correct 477 ms 27000 KB Output is correct
49 Correct 478 ms 27256 KB Output is correct
50 Correct 470 ms 27024 KB Output is correct