답안 #638370

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
638370	2022-09-05T16:39:45 Z	shmad	Feast (NOI19_feast)	C++17	100 / 100	210 ms	18460 KB

feast

#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) {
        	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});
        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("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

#	결과	실행 시간	메모리	Grader output
1	Correct	28 ms	2516 KB	Output is correct
2	Correct	28 ms	2660 KB	Output is correct
3	Correct	28 ms	2664 KB	Output is correct
4	Correct	27 ms	2656 KB	Output is correct
5	Correct	27 ms	2612 KB	Output is correct
6	Correct	28 ms	2536 KB	Output is correct
7	Correct	29 ms	2592 KB	Output is correct
8	Correct	31 ms	2604 KB	Output is correct
9	Correct	29 ms	2612 KB	Output is correct
10	Correct	30 ms	2696 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	18 ms	2584 KB	Output is correct
2	Correct	19 ms	2660 KB	Output is correct
3	Correct	18 ms	2644 KB	Output is correct
4	Correct	19 ms	2656 KB	Output is correct
5	Correct	28 ms	2556 KB	Output is correct
6	Correct	17 ms	2664 KB	Output is correct
7	Correct	18 ms	2696 KB	Output is correct
8	Correct	28 ms	2636 KB	Output is correct
9	Correct	26 ms	2532 KB	Output is correct
10	Correct	18 ms	2636 KB	Output is correct

Subtask #3
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	200 ms	15356 KB	Output is correct
2	Correct	182 ms	15140 KB	Output is correct
3	Correct	188 ms	15308 KB	Output is correct
4	Correct	195 ms	15064 KB	Output is correct
5	Correct	189 ms	15468 KB	Output is correct
6	Correct	196 ms	15408 KB	Output is correct
7	Correct	188 ms	15308 KB	Output is correct
8	Correct	210 ms	15304 KB	Output is correct
9	Correct	202 ms	15416 KB	Output is correct
10	Correct	197 ms	15436 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	356 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	1 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	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct

Subtask #5
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	356 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	1 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	Correct	1 ms	340 KB	Output is correct
9	Correct	0 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	0 ms	340 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 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	0 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct

Subtask #6
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	356 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	1 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	Correct	1 ms	340 KB	Output is correct
9	Correct	0 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	0 ms	340 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 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	0 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	1 ms	472 KB	Output is correct
23	Correct	1 ms	468 KB	Output is correct
24	Correct	1 ms	472 KB	Output is correct
25	Correct	1 ms	472 KB	Output is correct
26	Correct	1 ms	468 KB	Output is correct
27	Correct	1 ms	456 KB	Output is correct
28	Correct	1 ms	468 KB	Output is correct
29	Correct	1 ms	468 KB	Output is correct
30	Correct	1 ms	468 KB	Output is correct

Subtask #7
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	28 ms	2516 KB	Output is correct
2	Correct	28 ms	2660 KB	Output is correct
3	Correct	28 ms	2664 KB	Output is correct
4	Correct	27 ms	2656 KB	Output is correct
5	Correct	27 ms	2612 KB	Output is correct
6	Correct	28 ms	2536 KB	Output is correct
7	Correct	29 ms	2592 KB	Output is correct
8	Correct	31 ms	2604 KB	Output is correct
9	Correct	29 ms	2612 KB	Output is correct
10	Correct	30 ms	2696 KB	Output is correct
11	Correct	18 ms	2584 KB	Output is correct
12	Correct	19 ms	2660 KB	Output is correct
13	Correct	18 ms	2644 KB	Output is correct
14	Correct	19 ms	2656 KB	Output is correct
15	Correct	28 ms	2556 KB	Output is correct
16	Correct	17 ms	2664 KB	Output is correct
17	Correct	18 ms	2696 KB	Output is correct
18	Correct	28 ms	2636 KB	Output is correct
19	Correct	26 ms	2532 KB	Output is correct
20	Correct	18 ms	2636 KB	Output is correct
21	Correct	200 ms	15356 KB	Output is correct
22	Correct	182 ms	15140 KB	Output is correct
23	Correct	188 ms	15308 KB	Output is correct
24	Correct	195 ms	15064 KB	Output is correct
25	Correct	189 ms	15468 KB	Output is correct
26	Correct	196 ms	15408 KB	Output is correct
27	Correct	188 ms	15308 KB	Output is correct
28	Correct	210 ms	15304 KB	Output is correct
29	Correct	202 ms	15416 KB	Output is correct
30	Correct	197 ms	15436 KB	Output is correct
31	Correct	0 ms	356 KB	Output is correct
32	Correct	0 ms	340 KB	Output is correct
33	Correct	0 ms	340 KB	Output is correct
34	Correct	1 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	Correct	1 ms	340 KB	Output is correct
39	Correct	0 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	0 ms	340 KB	Output is correct
43	Correct	1 ms	332 KB	Output is correct
44	Correct	1 ms	340 KB	Output is correct
45	Correct	1 ms	340 KB	Output is correct
46	Correct	1 ms	340 KB	Output is correct
47	Correct	1 ms	340 KB	Output is correct
48	Correct	1 ms	340 KB	Output is correct
49	Correct	0 ms	340 KB	Output is correct
50	Correct	1 ms	340 KB	Output is correct
51	Correct	1 ms	468 KB	Output is correct
52	Correct	1 ms	472 KB	Output is correct
53	Correct	1 ms	468 KB	Output is correct
54	Correct	1 ms	472 KB	Output is correct
55	Correct	1 ms	472 KB	Output is correct
56	Correct	1 ms	468 KB	Output is correct
57	Correct	1 ms	456 KB	Output is correct
58	Correct	1 ms	468 KB	Output is correct
59	Correct	1 ms	468 KB	Output is correct
60	Correct	1 ms	468 KB	Output is correct
61	Correct	129 ms	18064 KB	Output is correct
62	Correct	106 ms	18460 KB	Output is correct
63	Correct	201 ms	18076 KB	Output is correct
64	Correct	131 ms	18352 KB	Output is correct
65	Correct	159 ms	18384 KB	Output is correct
66	Correct	164 ms	18412 KB	Output is correct
67	Correct	165 ms	18100 KB	Output is correct
68	Correct	203 ms	18368 KB	Output is correct
69	Correct	193 ms	18080 KB	Output is correct
70	Correct	184 ms	18008 KB	Output is correct

답안 #638370

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 8.0 / 8.0

Subtask #3 18.0 / 18.0

Subtask #4 10.0 / 10.0

Subtask #5 11.0 / 11.0

Subtask #6 20.0 / 20.0

Subtask #7 29.0 / 29.0

Subtask #1
4.0 / 4.0

Subtask #2
8.0 / 8.0

Subtask #3
18.0 / 18.0

Subtask #4
10.0 / 10.0

Subtask #5
11.0 / 11.0

Subtask #6
20.0 / 20.0

Subtask #7
29.0 / 29.0