Submission #701368

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
701368	2023-02-21T04:28:13 Z	GusterGoose27	Arranging Tickets (JOI17_arranging_tickets)	C++11	100 / 100	2349 ms	17080 KB

arranging_tickets

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int MAXN = 2e5+10;
int n, m;
ll overall[MAXN];
ll arr[MAXN];
ll req_red[MAXN];
ll r_end[MAXN];
vector<pii> ranges[MAXN]; // right endpoint, index

ll max(ll a, ll b) {
	if (a > b) return a;
	return b;
}

ll num_req(ll target) {
	for (int i = 0; i < n; i++) req_red[i] = max(0, arr[i]-target);
	fill(r_end, r_end+n, 0);
	priority_queue<pii> pq;
	ll sub = 0;
	ll num = 0;
	for (pii i: ranges[0]) pq.push(i);
	for (int i = 0; i < n; i++) {
		if (sub < req_red[i]) {
			pii r = pq.top();
			pq.pop();
			ll amt;
			if (r.second > req_red[i]-sub) {
				r.second -= (req_red[i]-sub);
				amt = (req_red[i]-sub);
				pq.push(r);
			}
			else amt = r.second;
			r_end[r.first] += amt;
			sub += amt;
			i--;
			num += amt;
			continue;
		}
		for (pii v: ranges[i+1]) pq.push(v);
		sub -= r_end[i];
	}
	return num;
}

ll solve() {
	ll mn = -1;
	ll mx = 0;
	for (int i = 0; i < n; i++) mx = max(mx, arr[i]);
	mx++;
	// int b = -1;
	// for (int i = mn+1; i < mx; i++) {
	// 	int v = 2*i+num_req(i);
	// 	if (b == -1 || v < b) b = v;
	// }
	// return b;
	while (mx > mn+2) {
		ll cur = (mn+mx)/2;
		ll v1 = num_req(cur);
		ll v2 = num_req(cur+1);
		if (v1 >= v2+2) mn = cur;
		else mx = cur+1;
	}
	return 2*(mn+1)+num_req(mn+1);
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	cin >> n >> m;
	n--;
	for (int i = 0; i < m; i++) {
		int a, b, c; cin >> a >> b >> c;
		a--; b--;
		if (a > b) swap(a, b);
		ranges[a].push_back(pii(b-1, c));
		overall[a] += c;
		overall[b] -= c;
	}
	for (int i = 0; i < n; i++) {
		overall[i+1] += overall[i];
	}
	for (int i = 0; i < n; i++) {
		arr[i] = (overall[i]+1)/2;
	}
	ll ans = solve();
	for (int i = 0; i < n; i++) arr[i] = overall[i]/2;
	ans = min(ans, solve()+1);
	cout << ans << "\n";
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	4948 KB	Output is correct
2	Correct	3 ms	4948 KB	Output is correct
3	Correct	3 ms	4948 KB	Output is correct
4	Correct	3 ms	4948 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	2 ms	4948 KB	Output is correct
7	Correct	3 ms	4948 KB	Output is correct
8	Correct	2 ms	4948 KB	Output is correct
9	Correct	2 ms	4948 KB	Output is correct
10	Correct	2 ms	4948 KB	Output is correct
11	Correct	2 ms	4948 KB	Output is correct
12	Correct	2 ms	4948 KB	Output is correct
13	Correct	2 ms	4948 KB	Output is correct
14	Correct	2 ms	4948 KB	Output is correct
15	Correct	3 ms	4948 KB	Output is correct

Subtask #2
35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	4948 KB	Output is correct
2	Correct	3 ms	4948 KB	Output is correct
3	Correct	3 ms	4948 KB	Output is correct
4	Correct	3 ms	4948 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	2 ms	4948 KB	Output is correct
7	Correct	3 ms	4948 KB	Output is correct
8	Correct	2 ms	4948 KB	Output is correct
9	Correct	2 ms	4948 KB	Output is correct
10	Correct	2 ms	4948 KB	Output is correct
11	Correct	2 ms	4948 KB	Output is correct
12	Correct	2 ms	4948 KB	Output is correct
13	Correct	2 ms	4948 KB	Output is correct
14	Correct	2 ms	4948 KB	Output is correct
15	Correct	3 ms	4948 KB	Output is correct
16	Correct	3 ms	5008 KB	Output is correct
17	Correct	3 ms	4948 KB	Output is correct
18	Correct	3 ms	4948 KB	Output is correct
19	Correct	3 ms	4948 KB	Output is correct
20	Correct	3 ms	5064 KB	Output is correct
21	Correct	3 ms	4948 KB	Output is correct
22	Correct	3 ms	4956 KB	Output is correct
23	Correct	3 ms	5064 KB	Output is correct
24	Correct	3 ms	4948 KB	Output is correct
25	Correct	3 ms	4948 KB	Output is correct
26	Correct	3 ms	4948 KB	Output is correct
27	Correct	4 ms	4948 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	4948 KB	Output is correct
2	Correct	3 ms	4948 KB	Output is correct
3	Correct	3 ms	4948 KB	Output is correct
4	Correct	3 ms	4948 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	2 ms	4948 KB	Output is correct
7	Correct	3 ms	4948 KB	Output is correct
8	Correct	2 ms	4948 KB	Output is correct
9	Correct	2 ms	4948 KB	Output is correct
10	Correct	2 ms	4948 KB	Output is correct
11	Correct	2 ms	4948 KB	Output is correct
12	Correct	2 ms	4948 KB	Output is correct
13	Correct	2 ms	4948 KB	Output is correct
14	Correct	2 ms	4948 KB	Output is correct
15	Correct	3 ms	4948 KB	Output is correct
16	Correct	3 ms	5008 KB	Output is correct
17	Correct	3 ms	4948 KB	Output is correct
18	Correct	3 ms	4948 KB	Output is correct
19	Correct	3 ms	4948 KB	Output is correct
20	Correct	3 ms	5064 KB	Output is correct
21	Correct	3 ms	4948 KB	Output is correct
22	Correct	3 ms	4956 KB	Output is correct
23	Correct	3 ms	5064 KB	Output is correct
24	Correct	3 ms	4948 KB	Output is correct
25	Correct	3 ms	4948 KB	Output is correct
26	Correct	3 ms	4948 KB	Output is correct
27	Correct	4 ms	4948 KB	Output is correct
28	Correct	10 ms	5204 KB	Output is correct
29	Correct	10 ms	5204 KB	Output is correct
30	Correct	10 ms	5252 KB	Output is correct
31	Correct	10 ms	5256 KB	Output is correct
32	Correct	11 ms	5232 KB	Output is correct
33	Correct	10 ms	5256 KB	Output is correct
34	Correct	10 ms	5204 KB	Output is correct
35	Correct	10 ms	5256 KB	Output is correct
36	Correct	10 ms	5204 KB	Output is correct
37	Correct	9 ms	5204 KB	Output is correct
38	Correct	6 ms	5304 KB	Output is correct
39	Correct	6 ms	5284 KB	Output is correct

Subtask #4
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	4948 KB	Output is correct
2	Correct	3 ms	4948 KB	Output is correct
3	Correct	3 ms	4948 KB	Output is correct
4	Correct	3 ms	4948 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	2 ms	4948 KB	Output is correct
7	Correct	3 ms	4948 KB	Output is correct
8	Correct	2 ms	4948 KB	Output is correct
9	Correct	2 ms	4948 KB	Output is correct
10	Correct	2 ms	4948 KB	Output is correct
11	Correct	2 ms	4948 KB	Output is correct
12	Correct	2 ms	4948 KB	Output is correct
13	Correct	2 ms	4948 KB	Output is correct
14	Correct	2 ms	4948 KB	Output is correct
15	Correct	3 ms	4948 KB	Output is correct
16	Correct	3 ms	5008 KB	Output is correct
17	Correct	3 ms	4948 KB	Output is correct
18	Correct	3 ms	4948 KB	Output is correct
19	Correct	3 ms	4948 KB	Output is correct
20	Correct	3 ms	5064 KB	Output is correct
21	Correct	3 ms	4948 KB	Output is correct
22	Correct	3 ms	4956 KB	Output is correct
23	Correct	3 ms	5064 KB	Output is correct
24	Correct	3 ms	4948 KB	Output is correct
25	Correct	3 ms	4948 KB	Output is correct
26	Correct	3 ms	4948 KB	Output is correct
27	Correct	4 ms	4948 KB	Output is correct
28	Correct	10 ms	5204 KB	Output is correct
29	Correct	10 ms	5204 KB	Output is correct
30	Correct	10 ms	5252 KB	Output is correct
31	Correct	10 ms	5256 KB	Output is correct
32	Correct	11 ms	5232 KB	Output is correct
33	Correct	10 ms	5256 KB	Output is correct
34	Correct	10 ms	5204 KB	Output is correct
35	Correct	10 ms	5256 KB	Output is correct
36	Correct	10 ms	5204 KB	Output is correct
37	Correct	9 ms	5204 KB	Output is correct
38	Correct	6 ms	5304 KB	Output is correct
39	Correct	6 ms	5284 KB	Output is correct
40	Correct	547 ms	15060 KB	Output is correct
41	Correct	552 ms	15116 KB	Output is correct
42	Correct	527 ms	14892 KB	Output is correct
43	Correct	526 ms	14908 KB	Output is correct
44	Correct	516 ms	14976 KB	Output is correct
45	Correct	489 ms	14804 KB	Output is correct
46	Correct	504 ms	14756 KB	Output is correct
47	Correct	515 ms	14920 KB	Output is correct
48	Correct	495 ms	14736 KB	Output is correct
49	Correct	373 ms	11872 KB	Output is correct
50	Correct	285 ms	12872 KB	Output is correct
51	Correct	380 ms	12068 KB	Output is correct

Subtask #5
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	4948 KB	Output is correct
2	Correct	3 ms	4948 KB	Output is correct
3	Correct	3 ms	4948 KB	Output is correct
4	Correct	3 ms	4948 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	2 ms	4948 KB	Output is correct
7	Correct	3 ms	4948 KB	Output is correct
8	Correct	2 ms	4948 KB	Output is correct
9	Correct	2 ms	4948 KB	Output is correct
10	Correct	2 ms	4948 KB	Output is correct
11	Correct	2 ms	4948 KB	Output is correct
12	Correct	2 ms	4948 KB	Output is correct
13	Correct	2 ms	4948 KB	Output is correct
14	Correct	2 ms	4948 KB	Output is correct
15	Correct	3 ms	4948 KB	Output is correct
16	Correct	3 ms	5008 KB	Output is correct
17	Correct	3 ms	4948 KB	Output is correct
18	Correct	3 ms	4948 KB	Output is correct
19	Correct	3 ms	4948 KB	Output is correct
20	Correct	3 ms	5064 KB	Output is correct
21	Correct	3 ms	4948 KB	Output is correct
22	Correct	3 ms	4956 KB	Output is correct
23	Correct	3 ms	5064 KB	Output is correct
24	Correct	3 ms	4948 KB	Output is correct
25	Correct	3 ms	4948 KB	Output is correct
26	Correct	3 ms	4948 KB	Output is correct
27	Correct	4 ms	4948 KB	Output is correct
28	Correct	10 ms	5204 KB	Output is correct
29	Correct	10 ms	5204 KB	Output is correct
30	Correct	10 ms	5252 KB	Output is correct
31	Correct	10 ms	5256 KB	Output is correct
32	Correct	11 ms	5232 KB	Output is correct
33	Correct	10 ms	5256 KB	Output is correct
34	Correct	10 ms	5204 KB	Output is correct
35	Correct	10 ms	5256 KB	Output is correct
36	Correct	10 ms	5204 KB	Output is correct
37	Correct	9 ms	5204 KB	Output is correct
38	Correct	6 ms	5304 KB	Output is correct
39	Correct	6 ms	5284 KB	Output is correct
40	Correct	547 ms	15060 KB	Output is correct
41	Correct	552 ms	15116 KB	Output is correct
42	Correct	527 ms	14892 KB	Output is correct
43	Correct	526 ms	14908 KB	Output is correct
44	Correct	516 ms	14976 KB	Output is correct
45	Correct	489 ms	14804 KB	Output is correct
46	Correct	504 ms	14756 KB	Output is correct
47	Correct	515 ms	14920 KB	Output is correct
48	Correct	495 ms	14736 KB	Output is correct
49	Correct	373 ms	11872 KB	Output is correct
50	Correct	285 ms	12872 KB	Output is correct
51	Correct	380 ms	12068 KB	Output is correct
52	Correct	2349 ms	15392 KB	Output is correct
53	Correct	2060 ms	14936 KB	Output is correct
54	Correct	2205 ms	15112 KB	Output is correct
55	Correct	2155 ms	14956 KB	Output is correct
56	Correct	1940 ms	17080 KB	Output is correct
57	Correct	2048 ms	16856 KB	Output is correct
58	Correct	2181 ms	16988 KB	Output is correct
59	Correct	1106 ms	13596 KB	Output is correct

Submission #701368

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 35.0 / 35.0

Subtask #3 20.0 / 20.0

Subtask #4 20.0 / 20.0

Subtask #5 15.0 / 15.0

Subtask #1
10.0 / 10.0

Subtask #2
35.0 / 35.0

Subtask #3
20.0 / 20.0

Subtask #4
20.0 / 20.0

Subtask #5
15.0 / 15.0