oj.uz

답안 #814289

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
814289 2023-08-08T06:41:30 Z GEN 이지후(#10370) Arranging Tickets (JOI17_arranging_tickets) C++17
100 / 100
 1395 ms 18372 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
using lint = long long;
using pi = array<lint, 2>;

int n, m;
int a[MAXN], b[MAXN], c[MAXN];

bool Do(vector<lint> l, vector<lint> r, vector<array<lint, 3>> intv, lint K) {
	l[0] = r[0] = 1e18;
	for (int i = 1; i < l.size(); i++)
		l[i] = min(l[i], l[i - 1]);
	for (int i = 1; i < r.size(); i++)
		r[i] = min(r[i], r[i - 1]);
	l.push_back(0);
	r.push_back(0);
	sort(intv.begin(), intv.end());
	priority_queue<pi, vector<pi>, greater<pi>> pq;
	int ptr = 0;
	vector<lint> opt(r.size());
	for (int i = 0; i + 1 < l.size(); i++) {
		while (ptr < intv.size() && intv[ptr][0] <= i) {
			pq.push({intv[ptr][1], intv[ptr][2]});
			ptr++;
		}
		while (l[i + 1] < K) {
			if (pq.empty())
				return 0;
			auto nxt = pq.top();
			pq.pop();
			lint dx = min(K - l[i + 1], nxt[1]);
			opt[nxt[0]] += dx;
			nxt[1] -= dx;
			K -= dx;
			if (nxt[1])
				pq.push(nxt);
		}
	}
	for (int i = opt.size() - 2; i >= 0; i--)
		opt[i] += opt[i + 1];
	for (int i = 0; i < r.size(); i++) {
		if (opt[i] > r[i])
			return false;
	}
	return true;
}

lint cnt[MAXN];
bool trial(lint x) {
	int maxpos = max_element(cnt + 1, cnt + n + 1) - cnt;
	lint mx = cnt[maxpos];
	if (mx <= x)
		return true;
	for (lint i = mx - x; i <= mx - x + 1 && i <= x; i++) {
		vector<lint> surp(n - 1);
		for (int j = 0; j < n - 1; j++) {
			surp[j] = x + i - cnt[j + 1];
			surp[j] /= 2;
		}
		// number of reversal
		vector<array<lint, 3>> intv;
		for (int k = 0; k < m; k++) {
			if (a[k] <= maxpos && b[k] > maxpos) {
				intv.push_back({a[k] - 1, n - b[k], c[k]});
			}
		}
		vector<lint> l = {0};
		vector<lint> r = {0};
		for (int k = 0; k < maxpos - 1; k++)
			l.push_back(surp[k]);
		for (int k = n - 2; k >= maxpos; k--)
			r.push_back(surp[k]);
		if (Do(l, r, intv, i))
			return true;
	}

	return false;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		cin >> a[i] >> b[i] >> c[i];
		if (a[i] > b[i])
			swap(a[i], b[i]);
		cnt[a[i]] += c[i];
		cnt[b[i]] -= c[i];
	}
	for (int i = 1; i <= n; i++)
		cnt[i] += cnt[i - 1];
	lint s = 0, e = 1e14;
	while (s != e) {
		lint m = (s + e) / 2;
		if (trial(m))
			e = m;
		else
			s = m + 1;
	}
	cout << s << endl;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 340 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 340 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 360 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 340 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 360 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 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 4 ms 724 KB Output is correct
29 Correct 4 ms 608 KB Output is correct
30 Correct 4 ms 736 KB Output is correct
31 Correct 4 ms 728 KB Output is correct
32 Correct 6 ms 732 KB Output is correct
33 Correct 4 ms 736 KB Output is correct
34 Correct 3 ms 732 KB Output is correct
35 Correct 4 ms 724 KB Output is correct
36 Correct 4 ms 728 KB Output is correct
37 Correct 4 ms 724 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 2 ms 616 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 340 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 360 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 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 4 ms 724 KB Output is correct
29 Correct 4 ms 608 KB Output is correct
30 Correct 4 ms 736 KB Output is correct
31 Correct 4 ms 728 KB Output is correct
32 Correct 6 ms 732 KB Output is correct
33 Correct 4 ms 736 KB Output is correct
34 Correct 3 ms 732 KB Output is correct
35 Correct 4 ms 724 KB Output is correct
36 Correct 4 ms 728 KB Output is correct
37 Correct 4 ms 724 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 2 ms 616 KB Output is correct
40 Correct 280 ms 15532 KB Output is correct
41 Correct 246 ms 15252 KB Output is correct
42 Correct 255 ms 15192 KB Output is correct
43 Correct 349 ms 15396 KB Output is correct
44 Correct 309 ms 15176 KB Output is correct
45 Correct 485 ms 15068 KB Output is correct
46 Correct 221 ms 15232 KB Output is correct
47 Correct 165 ms 15160 KB Output is correct
48 Correct 182 ms 14784 KB Output is correct
49 Correct 133 ms 11364 KB Output is correct
50 Correct 66 ms 7268 KB Output is correct
51 Correct 101 ms 10452 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 340 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 360 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 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 4 ms 724 KB Output is correct
29 Correct 4 ms 608 KB Output is correct
30 Correct 4 ms 736 KB Output is correct
31 Correct 4 ms 728 KB Output is correct
32 Correct 6 ms 732 KB Output is correct
33 Correct 4 ms 736 KB Output is correct
34 Correct 3 ms 732 KB Output is correct
35 Correct 4 ms 724 KB Output is correct
36 Correct 4 ms 728 KB Output is correct
37 Correct 4 ms 724 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 2 ms 616 KB Output is correct
40 Correct 280 ms 15532 KB Output is correct
41 Correct 246 ms 15252 KB Output is correct
42 Correct 255 ms 15192 KB Output is correct
43 Correct 349 ms 15396 KB Output is correct
44 Correct 309 ms 15176 KB Output is correct
45 Correct 485 ms 15068 KB Output is correct
46 Correct 221 ms 15232 KB Output is correct
47 Correct 165 ms 15160 KB Output is correct
48 Correct 182 ms 14784 KB Output is correct
49 Correct 133 ms 11364 KB Output is correct
50 Correct 66 ms 7268 KB Output is correct
51 Correct 101 ms 10452 KB Output is correct
52 Correct 974 ms 15528 KB Output is correct
53 Correct 586 ms 17416 KB Output is correct
54 Correct 1304 ms 17516 KB Output is correct
55 Correct 1164 ms 17648 KB Output is correct
56 Correct 1395 ms 18372 KB Output is correct
57 Correct 1154 ms 16396 KB Output is correct
58 Correct 873 ms 16448 KB Output is correct
59 Correct 426 ms 14244 KB Output is correct