oj.uz

Submission #88759

# Submission time Handle Problem Language Result Execution time Memory
88759 2018-12-08T13:51:02 Z nikolapesic2802 Arranging Tickets (JOI17_arranging_tickets) C++14
100 / 100
 1200 ms 39460 KB 
#include <stdio.h>
#include <bits/stdc++.h>
 
using namespace std;
 
#define SZ(v) ((int)(v).size())
#define ALL(v) (v).begin(),(v).end()
#define one first
#define two second
typedef long long ll;
typedef pair<int, int> pi; typedef pair<ll, int> pli; typedef pair<ll, pi> plp;
typedef tuple<int, int, int> ti; typedef tuple<ll, int, int> tli;
const int INF = 0x3f2f1f0f;
const ll LINF = 1ll * INF * INF;
 
const int MAX_N = 2e5 + 100, MAX_M = 1e5 + 100, MAX_C = 1e9 + 100;
 
int N, M; ti Nr[MAX_M];
ll Sum[MAX_N], Temp[MAX_N], maxV;
bool isCan(ll use, ll up) {
	ll cnt = 0;
	priority_queue<pi> Q;
	for(int i=0; i<=N; i++) Temp[i] = 0;
	for(int i=1, j=0; i<=N; i++) {
		Temp[i] += Temp[i-1];
		while(j < M && get<0>(Nr[j]) == i) Q.push(pi(get<1>(Nr[j]), get<2>(Nr[j]))), j++;
		ll now = Sum[i] + Temp[i];
		while(!Q.empty() && now > up) {
			int y, c; tie(y, c) = Q.top(); Q.pop();
			if(y <= i) continue;
			int v = min((ll)c, (now - up + 1) / 2);
			Temp[i] -= 2 * v;
			Temp[y] += 2 * v;
			cnt += v;
			now -= 2 * v;
			if(c - v > 0) Q.push(pi(y, c-v));
		}
		if(now > up) return false;
		if(cnt > use) return false;
	}
	return true;
}
int main() {
	cin >> N >> M;
	for(int i=0; i<M; i++) {
		int x, y, c; scanf("%d%d%d", &x, &y, &c);
		if(x > y) swap(x, y);
		Nr[i] = ti(x, y, c);
		Sum[x] += c; Sum[y] -= c;
	}
	sort(Nr, Nr+M);
	for(int i=1; i<=N; i++) Sum[i] += Sum[i-1], maxV = max(maxV, Sum[i]);
 
	ll ans = -1;
	for(ll l=0, r=maxV; l<=r; ) {
		ll m = (l+r) >> 1;
		if(isCan(maxV-m, 2*m-maxV) || isCan(maxV-m+1, 2*m-maxV-1)) ans = m, r = m-1; else l = m+1;
	}
	printf("%lld\n", ans);
	return 0;
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:46:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int x, y, c; scanf("%d%d%d", &x, &y, &c);
                ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 628 KB Output is correct
3 Correct 2 ms 628 KB Output is correct
4 Correct 2 ms 652 KB Output is correct
5 Correct 2 ms 672 KB Output is correct
6 Correct 2 ms 804 KB Output is correct
7 Correct 2 ms 808 KB Output is correct
8 Correct 2 ms 1032 KB Output is correct
9 Correct 2 ms 1032 KB Output is correct
10 Correct 2 ms 1032 KB Output is correct
11 Correct 2 ms 1056 KB Output is correct
12 Correct 2 ms 1056 KB Output is correct
13 Correct 2 ms 1056 KB Output is correct
14 Correct 2 ms 1056 KB Output is correct
15 Correct 2 ms 1056 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 628 KB Output is correct
3 Correct 2 ms 628 KB Output is correct
4 Correct 2 ms 652 KB Output is correct
5 Correct 2 ms 672 KB Output is correct
6 Correct 2 ms 804 KB Output is correct
7 Correct 2 ms 808 KB Output is correct
8 Correct 2 ms 1032 KB Output is correct
9 Correct 2 ms 1032 KB Output is correct
10 Correct 2 ms 1032 KB Output is correct
11 Correct 2 ms 1056 KB Output is correct
12 Correct 2 ms 1056 KB Output is correct
13 Correct 2 ms 1056 KB Output is correct
14 Correct 2 ms 1056 KB Output is correct
15 Correct 2 ms 1056 KB Output is correct
16 Correct 2 ms 1056 KB Output is correct
17 Correct 2 ms 1100 KB Output is correct
18 Correct 2 ms 1100 KB Output is correct
19 Correct 2 ms 1100 KB Output is correct
20 Correct 3 ms 1100 KB Output is correct
21 Correct 2 ms 1100 KB Output is correct
22 Correct 2 ms 1100 KB Output is correct
23 Correct 2 ms 1100 KB Output is correct
24 Correct 3 ms 1100 KB Output is correct
25 Correct 2 ms 1100 KB Output is correct
26 Correct 2 ms 1100 KB Output is correct
27 Correct 2 ms 1100 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 628 KB Output is correct
3 Correct 2 ms 628 KB Output is correct
4 Correct 2 ms 652 KB Output is correct
5 Correct 2 ms 672 KB Output is correct
6 Correct 2 ms 804 KB Output is correct
7 Correct 2 ms 808 KB Output is correct
8 Correct 2 ms 1032 KB Output is correct
9 Correct 2 ms 1032 KB Output is correct
10 Correct 2 ms 1032 KB Output is correct
11 Correct 2 ms 1056 KB Output is correct
12 Correct 2 ms 1056 KB Output is correct
13 Correct 2 ms 1056 KB Output is correct
14 Correct 2 ms 1056 KB Output is correct
15 Correct 2 ms 1056 KB Output is correct
16 Correct 2 ms 1056 KB Output is correct
17 Correct 2 ms 1100 KB Output is correct
18 Correct 2 ms 1100 KB Output is correct
19 Correct 2 ms 1100 KB Output is correct
20 Correct 3 ms 1100 KB Output is correct
21 Correct 2 ms 1100 KB Output is correct
22 Correct 2 ms 1100 KB Output is correct
23 Correct 2 ms 1100 KB Output is correct
24 Correct 3 ms 1100 KB Output is correct
25 Correct 2 ms 1100 KB Output is correct
26 Correct 2 ms 1100 KB Output is correct
27 Correct 2 ms 1100 KB Output is correct
28 Correct 6 ms 1148 KB Output is correct
29 Correct 6 ms 1184 KB Output is correct
30 Correct 6 ms 1236 KB Output is correct
31 Correct 6 ms 1312 KB Output is correct
32 Correct 6 ms 1428 KB Output is correct
33 Correct 6 ms 1428 KB Output is correct
34 Correct 4 ms 1428 KB Output is correct
35 Correct 6 ms 1456 KB Output is correct
36 Correct 6 ms 1488 KB Output is correct
37 Correct 3 ms 1524 KB Output is correct
38 Correct 4 ms 1524 KB Output is correct
39 Correct 4 ms 1604 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 628 KB Output is correct
3 Correct 2 ms 628 KB Output is correct
4 Correct 2 ms 652 KB Output is correct
5 Correct 2 ms 672 KB Output is correct
6 Correct 2 ms 804 KB Output is correct
7 Correct 2 ms 808 KB Output is correct
8 Correct 2 ms 1032 KB Output is correct
9 Correct 2 ms 1032 KB Output is correct
10 Correct 2 ms 1032 KB Output is correct
11 Correct 2 ms 1056 KB Output is correct
12 Correct 2 ms 1056 KB Output is correct
13 Correct 2 ms 1056 KB Output is correct
14 Correct 2 ms 1056 KB Output is correct
15 Correct 2 ms 1056 KB Output is correct
16 Correct 2 ms 1056 KB Output is correct
17 Correct 2 ms 1100 KB Output is correct
18 Correct 2 ms 1100 KB Output is correct
19 Correct 2 ms 1100 KB Output is correct
20 Correct 3 ms 1100 KB Output is correct
21 Correct 2 ms 1100 KB Output is correct
22 Correct 2 ms 1100 KB Output is correct
23 Correct 2 ms 1100 KB Output is correct
24 Correct 3 ms 1100 KB Output is correct
25 Correct 2 ms 1100 KB Output is correct
26 Correct 2 ms 1100 KB Output is correct
27 Correct 2 ms 1100 KB Output is correct
28 Correct 6 ms 1148 KB Output is correct
29 Correct 6 ms 1184 KB Output is correct
30 Correct 6 ms 1236 KB Output is correct
31 Correct 6 ms 1312 KB Output is correct
32 Correct 6 ms 1428 KB Output is correct
33 Correct 6 ms 1428 KB Output is correct
34 Correct 4 ms 1428 KB Output is correct
35 Correct 6 ms 1456 KB Output is correct
36 Correct 6 ms 1488 KB Output is correct
37 Correct 3 ms 1524 KB Output is correct
38 Correct 4 ms 1524 KB Output is correct
39 Correct 4 ms 1604 KB Output is correct
40 Correct 262 ms 8804 KB Output is correct
41 Correct 255 ms 10296 KB Output is correct
42 Correct 235 ms 11580 KB Output is correct
43 Correct 256 ms 13092 KB Output is correct
44 Correct 393 ms 14564 KB Output is correct
45 Correct 266 ms 15992 KB Output is correct
46 Correct 220 ms 17212 KB Output is correct
47 Correct 66 ms 17652 KB Output is correct
48 Correct 75 ms 19164 KB Output is correct
49 Correct 69 ms 19164 KB Output is correct
50 Correct 59 ms 20864 KB Output is correct
51 Correct 66 ms 22096 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 628 KB Output is correct
3 Correct 2 ms 628 KB Output is correct
4 Correct 2 ms 652 KB Output is correct
5 Correct 2 ms 672 KB Output is correct
6 Correct 2 ms 804 KB Output is correct
7 Correct 2 ms 808 KB Output is correct
8 Correct 2 ms 1032 KB Output is correct
9 Correct 2 ms 1032 KB Output is correct
10 Correct 2 ms 1032 KB Output is correct
11 Correct 2 ms 1056 KB Output is correct
12 Correct 2 ms 1056 KB Output is correct
13 Correct 2 ms 1056 KB Output is correct
14 Correct 2 ms 1056 KB Output is correct
15 Correct 2 ms 1056 KB Output is correct
16 Correct 2 ms 1056 KB Output is correct
17 Correct 2 ms 1100 KB Output is correct
18 Correct 2 ms 1100 KB Output is correct
19 Correct 2 ms 1100 KB Output is correct
20 Correct 3 ms 1100 KB Output is correct
21 Correct 2 ms 1100 KB Output is correct
22 Correct 2 ms 1100 KB Output is correct
23 Correct 2 ms 1100 KB Output is correct
24 Correct 3 ms 1100 KB Output is correct
25 Correct 2 ms 1100 KB Output is correct
26 Correct 2 ms 1100 KB Output is correct
27 Correct 2 ms 1100 KB Output is correct
28 Correct 6 ms 1148 KB Output is correct
29 Correct 6 ms 1184 KB Output is correct
30 Correct 6 ms 1236 KB Output is correct
31 Correct 6 ms 1312 KB Output is correct
32 Correct 6 ms 1428 KB Output is correct
33 Correct 6 ms 1428 KB Output is correct
34 Correct 4 ms 1428 KB Output is correct
35 Correct 6 ms 1456 KB Output is correct
36 Correct 6 ms 1488 KB Output is correct
37 Correct 3 ms 1524 KB Output is correct
38 Correct 4 ms 1524 KB Output is correct
39 Correct 4 ms 1604 KB Output is correct
40 Correct 262 ms 8804 KB Output is correct
41 Correct 255 ms 10296 KB Output is correct
42 Correct 235 ms 11580 KB Output is correct
43 Correct 256 ms 13092 KB Output is correct
44 Correct 393 ms 14564 KB Output is correct
45 Correct 266 ms 15992 KB Output is correct
46 Correct 220 ms 17212 KB Output is correct
47 Correct 66 ms 17652 KB Output is correct
48 Correct 75 ms 19164 KB Output is correct
49 Correct 69 ms 19164 KB Output is correct
50 Correct 59 ms 20864 KB Output is correct
51 Correct 66 ms 22096 KB Output is correct
52 Correct 1175 ms 26364 KB Output is correct
53 Correct 800 ms 28532 KB Output is correct
54 Correct 1054 ms 30736 KB Output is correct
55 Correct 1200 ms 32980 KB Output is correct
56 Correct 965 ms 35308 KB Output is correct
57 Correct 1077 ms 37300 KB Output is correct
58 Correct 963 ms 39088 KB Output is correct
59 Correct 565 ms 39460 KB Output is correct