oj.uz

Submission #638371

# Submission time Handle Problem Language Result Execution time Memory
638371 2022-09-05T16:43:34 Z shmad Feast (NOI19_feast) C++17
100 / 100
 239 ms 15524 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;
	multiset<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);    
	}
	r[m] = 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] != 0) {
			if (b[r[i]] > 0) cnt--;
			s.erase({abs(b[r[i]]), r[i]});
			b[i] += b[r[i]];
			if (r[r[i]] != 0) 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) {
			s.insert({b[i], i});
			cnt++;
			continue;
		}
		if (l[i] == 0) l[r[i]] = b[i] = 0;
		if (l[i] != 0 && r[i] == 0) r[l[i]] = b[i] = 0;
		s.insert({abs(b[i]), i});
	}
	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("input", "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 27 ms 2508 KB Output is correct
2 Correct 29 ms 2568 KB Output is correct
3 Correct 27 ms 2668 KB Output is correct
4 Correct 28 ms 2572 KB Output is correct
5 Correct 30 ms 2540 KB Output is correct
6 Correct 29 ms 2516 KB Output is correct
7 Correct 29 ms 2560 KB Output is correct
8 Correct 27 ms 2644 KB Output is correct
9 Correct 27 ms 2616 KB Output is correct
10 Correct 31 ms 2676 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2680 KB Output is correct
2 Correct 23 ms 2660 KB Output is correct
3 Correct 22 ms 2584 KB Output is correct
4 Correct 20 ms 2704 KB Output is correct
5 Correct 30 ms 2524 KB Output is correct
6 Correct 19 ms 2644 KB Output is correct
7 Correct 18 ms 2664 KB Output is correct
8 Correct 27 ms 2644 KB Output is correct
9 Correct 28 ms 2588 KB Output is correct
10 Correct 19 ms 2660 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 15248 KB Output is correct
2 Correct 213 ms 15164 KB Output is correct
3 Correct 190 ms 15308 KB Output is correct
4 Correct 202 ms 15180 KB Output is correct
5 Correct 212 ms 15280 KB Output is correct
6 Correct 205 ms 15412 KB Output is correct
7 Correct 224 ms 15440 KB Output is correct
8 Correct 236 ms 15180 KB Output is correct
9 Correct 205 ms 15512 KB Output is correct
10 Correct 239 ms 15452 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 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 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 288 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 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 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 288 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 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 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 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 288 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 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct

Subtask #7
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 2508 KB Output is correct
2 Correct 29 ms 2568 KB Output is correct
3 Correct 27 ms 2668 KB Output is correct
4 Correct 28 ms 2572 KB Output is correct
5 Correct 30 ms 2540 KB Output is correct
6 Correct 29 ms 2516 KB Output is correct
7 Correct 29 ms 2560 KB Output is correct
8 Correct 27 ms 2644 KB Output is correct
9 Correct 27 ms 2616 KB Output is correct
10 Correct 31 ms 2676 KB Output is correct
11 Correct 20 ms 2680 KB Output is correct
12 Correct 23 ms 2660 KB Output is correct
13 Correct 22 ms 2584 KB Output is correct
14 Correct 20 ms 2704 KB Output is correct
15 Correct 30 ms 2524 KB Output is correct
16 Correct 19 ms 2644 KB Output is correct
17 Correct 18 ms 2664 KB Output is correct
18 Correct 27 ms 2644 KB Output is correct
19 Correct 28 ms 2588 KB Output is correct
20 Correct 19 ms 2660 KB Output is correct
21 Correct 197 ms 15248 KB Output is correct
22 Correct 213 ms 15164 KB Output is correct
23 Correct 190 ms 15308 KB Output is correct
24 Correct 202 ms 15180 KB Output is correct
25 Correct 212 ms 15280 KB Output is correct
26 Correct 205 ms 15412 KB Output is correct
27 Correct 224 ms 15440 KB Output is correct
28 Correct 236 ms 15180 KB Output is correct
29 Correct 205 ms 15512 KB Output is correct
30 Correct 239 ms 15452 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 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 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 0 ms 288 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 156 ms 15140 KB Output is correct
62 Correct 111 ms 15508 KB Output is correct
63 Correct 191 ms 15092 KB Output is correct
64 Correct 153 ms 15456 KB Output is correct
65 Correct 164 ms 15304 KB Output is correct
66 Correct 160 ms 15344 KB Output is correct
67 Correct 165 ms 15052 KB Output is correct
68 Correct 211 ms 15524 KB Output is correct
69 Correct 185 ms 15132 KB Output is correct
70 Correct 180 ms 15048 KB Output is correct