oj.uz

Submission #638364

# Submission time Handle Problem Language Result Execution time Memory
638364 2022-09-05T16:05:54 Z shmad Feast (NOI19_feast) C++17
30 / 100
 226 ms 15612 KB 
#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vvt = vt< vt<int> >;

const int N = 1e6 + 5, mod = 1e9 + 7, B = 500;
const ll inf = 1e18 + 7, LIM = (1ll << 60);
const double eps = 1e-6;

int n, k;
ll l[N], r[N];
ll a[N], b[N];

void solve () {
	cin >> n >> k;
	for (int i = 1; i <= n; i++) cin >> a[i];
	int m = 0;
	for (int i = 1; i <= n; i++) {
		if (m == 0) {
			if (a[i] > 0) b[++m] = a[i];
			continue;
		}
		if ((a[i] > 0 && b[m] > 0) || (a[i] < 0 && b[m] < 0)) b[m] += a[i];
		else b[++m] = a[i];
	}
	if (b[m] < 0) b[m--] = 0;
	set<pii> s;
	int cnt = 0;
	for (int i = 1; i <= m; i++) {
		s.insert({abs(b[i]), i});
		l[i] = i - 1;
		r[i] = i + 1;
		cnt += (b[i] > 0);    
	}
	while (cnt > k) {
		pii v = *s.begin();
		s.erase(s.begin());
		ll i = v.ss;
		if (b[i] > 0) cnt--;
        if (l[i] != 0) {
        	if (b[l[i]] > 0) cnt--;
        	s.erase({abs(b[l[i]]), l[i]});
        	b[i] += b[l[i]];
        	if (l[l[i]] != 0) r[l[l[i]]] = i;
        }
        if (r[i] != m + 1) {
        	if (b[r[i]] > 0) cnt--;
        	s.erase({abs(b[r[i]]), r[i]});
        	b[i] += b[r[i]];
        	if (r[r[i]] != m + 1) l[r[r[i]]] = i;
        }
        b[l[i]] = b[r[i]] = 0;
        l[i] = l[l[i]];
        r[i] = r[r[i]];
        if (b[i] < 0) {
        	if (l[i] == 0) l[r[i]] = b[i] = 0;
        	if (l[i] != 0 && r[i] == m + 1) r[l[i]] = m + 1, b[i] = 0;
        }
        s.insert({abs(b[i]), i});
        cnt += (b[i] > 0);
	}
	ll ans = 0;
	for (auto [val, i]: s) if (b[i] > 0) ans += b[i];
	cout << ans;
	cout << '\n';
}

bool testcases = 0;

signed main() {
#ifdef ONLINE_JUDGE
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 2568 KB Output is correct
2 Correct 27 ms 2576 KB Output is correct
3 Correct 27 ms 2584 KB Output is correct
4 Correct 29 ms 2636 KB Output is correct
5 Correct 27 ms 2604 KB Output is correct
6 Correct 34 ms 2584 KB Output is correct
7 Correct 26 ms 2516 KB Output is correct
8 Correct 27 ms 2556 KB Output is correct
9 Correct 27 ms 2612 KB Output is correct
10 Correct 28 ms 2656 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2636 KB Output is correct
2 Correct 17 ms 2644 KB Output is correct
3 Correct 19 ms 2644 KB Output is correct
4 Correct 18 ms 2632 KB Output is correct
5 Correct 28 ms 2592 KB Output is correct
6 Correct 18 ms 2600 KB Output is correct
7 Correct 20 ms 2608 KB Output is correct
8 Correct 28 ms 2656 KB Output is correct
9 Correct 26 ms 2516 KB Output is correct
10 Correct 18 ms 2712 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 15436 KB Output is correct
2 Correct 191 ms 15176 KB Output is correct
3 Correct 203 ms 15336 KB Output is correct
4 Correct 185 ms 15180 KB Output is correct
5 Correct 184 ms 15284 KB Output is correct
6 Correct 192 ms 15416 KB Output is correct
7 Correct 223 ms 15456 KB Output is correct
8 Correct 190 ms 15304 KB Output is correct
9 Correct 186 ms 15612 KB Output is correct
10 Correct 226 ms 15524 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Incorrect 1 ms 340 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Incorrect 1 ms 340 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Incorrect 1 ms 340 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 2568 KB Output is correct
2 Correct 27 ms 2576 KB Output is correct
3 Correct 27 ms 2584 KB Output is correct
4 Correct 29 ms 2636 KB Output is correct
5 Correct 27 ms 2604 KB Output is correct
6 Correct 34 ms 2584 KB Output is correct
7 Correct 26 ms 2516 KB Output is correct
8 Correct 27 ms 2556 KB Output is correct
9 Correct 27 ms 2612 KB Output is correct
10 Correct 28 ms 2656 KB Output is correct
11 Correct 17 ms 2636 KB Output is correct
12 Correct 17 ms 2644 KB Output is correct
13 Correct 19 ms 2644 KB Output is correct
14 Correct 18 ms 2632 KB Output is correct
15 Correct 28 ms 2592 KB Output is correct
16 Correct 18 ms 2600 KB Output is correct
17 Correct 20 ms 2608 KB Output is correct
18 Correct 28 ms 2656 KB Output is correct
19 Correct 26 ms 2516 KB Output is correct
20 Correct 18 ms 2712 KB Output is correct
21 Correct 193 ms 15436 KB Output is correct
22 Correct 191 ms 15176 KB Output is correct
23 Correct 203 ms 15336 KB Output is correct
24 Correct 185 ms 15180 KB Output is correct
25 Correct 184 ms 15284 KB Output is correct
26 Correct 192 ms 15416 KB Output is correct
27 Correct 223 ms 15456 KB Output is correct
28 Correct 190 ms 15304 KB Output is correct
29 Correct 186 ms 15612 KB Output is correct
30 Correct 226 ms 15524 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Incorrect 1 ms 340 KB Output isn't correct
39 Halted 0 ms 0 KB -