Submission #200062

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
200062	2020-02-05T08:04:00 Z	maruii	Arranging Tickets (JOI17_arranging_tickets)	C++14	85 / 100	6000 ms	12272 KB

arranging_tickets

#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define ff first
#define ss second

int N, M, L, R;
ll A[200005], X[200005], mx, S[200005];
vector<pii> V[200005];
bool g(int m, int n, int p) {
	fill(S, S + N + 1, 0);
	priority_queue<pii> pq;
	ll s = 0;
	for (int i = 1; i <= p; ++i) {
		for (auto j : V[i]) if (j.ff > p) pq.push(j);
		while (s < X[i]) {
			if (pq.empty()) return 0;
			auto t = pq.top(); pq.pop();
			if (s + t.ss <= X[i]) {
				S[t.ff] += t.ss;
				s += t.ss;
			}
			else {
				S[t.ff] += X[i] - s;
				t.ss -= X[i] - s;
				s = X[i];
				pq.push(t);
			}
		}
	}
	for (int i = p + 1; i <= N; ++i) {
		s -= S[i];
		if (A[i] - s + n - s > m) return 0;
	}
	return 1;
}
bool f(int m) {
	for (int n = mx - m; n <= mx - m + 1; ++n) {
		for (int i = 1; i <= R; ++i) X[i] = (A[i] + n - m + 1) / 2;
		if (g(m, n, L)) return 1;
	}
	return 0;
}
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> N >> M;
	for (int i = 1; i <= M; ++i) {
		int a, b, c; cin >> a >> b >> c;
		if (a > b) swap(a, b);
		A[a] += c;
		A[b] -= c;
		V[a].emplace_back(b, c);
	}
	for (int i = 1; i <= N; ++i) A[i] += A[i - 1];
	mx = *max_element(A + 1, A + N + 1);
	for (int i = 1; i <= N; ++i) if (mx == A[i]) {
		L = i;
		break;
	}
	for (int i = N; i >= 1; --i) if (mx == A[i]) {
		R = i;
		break;
	}
	int l = 1, r = mx;
	while (l < r) {
		int m = l + r >> 1;
		if (f(m)) r = m;
		else l = m + 1;
	}
	cout << l;
	return 0;
 }

Subtask #1
10.0 / 10.0

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

Subtask #2
35.0 / 35.0

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

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	4984 KB	Output is correct
2	Correct	7 ms	4984 KB	Output is correct
3	Correct	7 ms	5116 KB	Output is correct
4	Correct	8 ms	4984 KB	Output is correct
5	Correct	7 ms	4984 KB	Output is correct
6	Correct	7 ms	4984 KB	Output is correct
7	Correct	8 ms	4984 KB	Output is correct
8	Correct	9 ms	4984 KB	Output is correct
9	Correct	8 ms	4984 KB	Output is correct
10	Correct	7 ms	4984 KB	Output is correct
11	Correct	8 ms	4984 KB	Output is correct
12	Correct	8 ms	4984 KB	Output is correct
13	Correct	7 ms	4984 KB	Output is correct
14	Correct	7 ms	4984 KB	Output is correct
15	Correct	7 ms	4984 KB	Output is correct
16	Correct	8 ms	5112 KB	Output is correct
17	Correct	8 ms	5112 KB	Output is correct
18	Correct	8 ms	5112 KB	Output is correct
19	Correct	7 ms	4984 KB	Output is correct
20	Correct	8 ms	5112 KB	Output is correct
21	Correct	7 ms	5112 KB	Output is correct
22	Correct	7 ms	4984 KB	Output is correct
23	Correct	8 ms	5112 KB	Output is correct
24	Correct	8 ms	5112 KB	Output is correct
25	Correct	8 ms	4984 KB	Output is correct
26	Correct	8 ms	5112 KB	Output is correct
27	Correct	8 ms	5112 KB	Output is correct
28	Correct	10 ms	5240 KB	Output is correct
29	Correct	11 ms	5240 KB	Output is correct
30	Correct	12 ms	5240 KB	Output is correct
31	Correct	11 ms	5112 KB	Output is correct
32	Correct	11 ms	5112 KB	Output is correct
33	Correct	10 ms	5240 KB	Output is correct
34	Correct	9 ms	5240 KB	Output is correct
35	Correct	9 ms	5240 KB	Output is correct
36	Correct	11 ms	5240 KB	Output is correct
37	Correct	9 ms	5240 KB	Output is correct
38	Correct	9 ms	5240 KB	Output is correct
39	Correct	9 ms	5240 KB	Output is correct

Subtask #4
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	4984 KB	Output is correct
2	Correct	7 ms	4984 KB	Output is correct
3	Correct	7 ms	5116 KB	Output is correct
4	Correct	8 ms	4984 KB	Output is correct
5	Correct	7 ms	4984 KB	Output is correct
6	Correct	7 ms	4984 KB	Output is correct
7	Correct	8 ms	4984 KB	Output is correct
8	Correct	9 ms	4984 KB	Output is correct
9	Correct	8 ms	4984 KB	Output is correct
10	Correct	7 ms	4984 KB	Output is correct
11	Correct	8 ms	4984 KB	Output is correct
12	Correct	8 ms	4984 KB	Output is correct
13	Correct	7 ms	4984 KB	Output is correct
14	Correct	7 ms	4984 KB	Output is correct
15	Correct	7 ms	4984 KB	Output is correct
16	Correct	8 ms	5112 KB	Output is correct
17	Correct	8 ms	5112 KB	Output is correct
18	Correct	8 ms	5112 KB	Output is correct
19	Correct	7 ms	4984 KB	Output is correct
20	Correct	8 ms	5112 KB	Output is correct
21	Correct	7 ms	5112 KB	Output is correct
22	Correct	7 ms	4984 KB	Output is correct
23	Correct	8 ms	5112 KB	Output is correct
24	Correct	8 ms	5112 KB	Output is correct
25	Correct	8 ms	4984 KB	Output is correct
26	Correct	8 ms	5112 KB	Output is correct
27	Correct	8 ms	5112 KB	Output is correct
28	Correct	10 ms	5240 KB	Output is correct
29	Correct	11 ms	5240 KB	Output is correct
30	Correct	12 ms	5240 KB	Output is correct
31	Correct	11 ms	5112 KB	Output is correct
32	Correct	11 ms	5112 KB	Output is correct
33	Correct	10 ms	5240 KB	Output is correct
34	Correct	9 ms	5240 KB	Output is correct
35	Correct	9 ms	5240 KB	Output is correct
36	Correct	11 ms	5240 KB	Output is correct
37	Correct	9 ms	5240 KB	Output is correct
38	Correct	9 ms	5240 KB	Output is correct
39	Correct	9 ms	5240 KB	Output is correct
40	Correct	207 ms	12024 KB	Output is correct
41	Correct	218 ms	12272 KB	Output is correct
42	Correct	69 ms	11252 KB	Output is correct
43	Correct	219 ms	11792 KB	Output is correct
44	Correct	163 ms	12172 KB	Output is correct
45	Correct	235 ms	11400 KB	Output is correct
46	Correct	84 ms	11656 KB	Output is correct
47	Correct	70 ms	11896 KB	Output is correct
48	Correct	71 ms	11312 KB	Output is correct
49	Correct	65 ms	9940 KB	Output is correct
50	Correct	53 ms	10360 KB	Output is correct
51	Correct	70 ms	9864 KB	Output is correct

Subtask #5
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	4984 KB	Output is correct
2	Correct	7 ms	4984 KB	Output is correct
3	Correct	7 ms	5116 KB	Output is correct
4	Correct	8 ms	4984 KB	Output is correct
5	Correct	7 ms	4984 KB	Output is correct
6	Correct	7 ms	4984 KB	Output is correct
7	Correct	8 ms	4984 KB	Output is correct
8	Correct	9 ms	4984 KB	Output is correct
9	Correct	8 ms	4984 KB	Output is correct
10	Correct	7 ms	4984 KB	Output is correct
11	Correct	8 ms	4984 KB	Output is correct
12	Correct	8 ms	4984 KB	Output is correct
13	Correct	7 ms	4984 KB	Output is correct
14	Correct	7 ms	4984 KB	Output is correct
15	Correct	7 ms	4984 KB	Output is correct
16	Correct	8 ms	5112 KB	Output is correct
17	Correct	8 ms	5112 KB	Output is correct
18	Correct	8 ms	5112 KB	Output is correct
19	Correct	7 ms	4984 KB	Output is correct
20	Correct	8 ms	5112 KB	Output is correct
21	Correct	7 ms	5112 KB	Output is correct
22	Correct	7 ms	4984 KB	Output is correct
23	Correct	8 ms	5112 KB	Output is correct
24	Correct	8 ms	5112 KB	Output is correct
25	Correct	8 ms	4984 KB	Output is correct
26	Correct	8 ms	5112 KB	Output is correct
27	Correct	8 ms	5112 KB	Output is correct
28	Correct	10 ms	5240 KB	Output is correct
29	Correct	11 ms	5240 KB	Output is correct
30	Correct	12 ms	5240 KB	Output is correct
31	Correct	11 ms	5112 KB	Output is correct
32	Correct	11 ms	5112 KB	Output is correct
33	Correct	10 ms	5240 KB	Output is correct
34	Correct	9 ms	5240 KB	Output is correct
35	Correct	9 ms	5240 KB	Output is correct
36	Correct	11 ms	5240 KB	Output is correct
37	Correct	9 ms	5240 KB	Output is correct
38	Correct	9 ms	5240 KB	Output is correct
39	Correct	9 ms	5240 KB	Output is correct
40	Correct	207 ms	12024 KB	Output is correct
41	Correct	218 ms	12272 KB	Output is correct
42	Correct	69 ms	11252 KB	Output is correct
43	Correct	219 ms	11792 KB	Output is correct
44	Correct	163 ms	12172 KB	Output is correct
45	Correct	235 ms	11400 KB	Output is correct
46	Correct	84 ms	11656 KB	Output is correct
47	Correct	70 ms	11896 KB	Output is correct
48	Correct	71 ms	11312 KB	Output is correct
49	Correct	65 ms	9940 KB	Output is correct
50	Correct	53 ms	10360 KB	Output is correct
51	Correct	70 ms	9864 KB	Output is correct
52	Execution timed out	6040 ms	11512 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

Submission #200062

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 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
0 / 15.0