Submission #89134

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
89134	2018-12-10T13:17:39 Z	nikolapesic2802	Arranging Tickets (JOI17_arranging_tickets)	C++14	100 / 100	1665 ms	19036 KB

arranging_tickets

#include <bits/stdc++.h>

using namespace std;


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;

int N, M; ti Nr[MAX_M];
ll Sum[MAX_N], Temp[MAX_N], maxV;
vector<vector<pi> > interval(MAX_N);
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];
		for(auto p:interval[i])
            Q.push(p);
		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);
		interval[x].push_back({y,c});
		Sum[x] += c; Sum[y] -= c;
	}
	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:44: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	6 ms	5156 KB	Output is correct
2	Correct	6 ms	5244 KB	Output is correct
3	Correct	6 ms	5300 KB	Output is correct
4	Correct	6 ms	5300 KB	Output is correct
5	Correct	6 ms	5300 KB	Output is correct
6	Correct	6 ms	5300 KB	Output is correct
7	Correct	6 ms	5300 KB	Output is correct
8	Correct	6 ms	5348 KB	Output is correct
9	Correct	6 ms	5348 KB	Output is correct
10	Correct	6 ms	5348 KB	Output is correct
11	Correct	5 ms	5348 KB	Output is correct
12	Correct	6 ms	5348 KB	Output is correct
13	Correct	5 ms	5348 KB	Output is correct
14	Correct	6 ms	5348 KB	Output is correct
15	Correct	6 ms	5348 KB	Output is correct

Subtask #2
35.0 / 35.0

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

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	5156 KB	Output is correct
2	Correct	6 ms	5244 KB	Output is correct
3	Correct	6 ms	5300 KB	Output is correct
4	Correct	6 ms	5300 KB	Output is correct
5	Correct	6 ms	5300 KB	Output is correct
6	Correct	6 ms	5300 KB	Output is correct
7	Correct	6 ms	5300 KB	Output is correct
8	Correct	6 ms	5348 KB	Output is correct
9	Correct	6 ms	5348 KB	Output is correct
10	Correct	6 ms	5348 KB	Output is correct
11	Correct	5 ms	5348 KB	Output is correct
12	Correct	6 ms	5348 KB	Output is correct
13	Correct	5 ms	5348 KB	Output is correct
14	Correct	6 ms	5348 KB	Output is correct
15	Correct	6 ms	5348 KB	Output is correct
16	Correct	6 ms	5348 KB	Output is correct
17	Correct	6 ms	5348 KB	Output is correct
18	Correct	6 ms	5348 KB	Output is correct
19	Correct	7 ms	5436 KB	Output is correct
20	Correct	7 ms	5440 KB	Output is correct
21	Correct	6 ms	5440 KB	Output is correct
22	Correct	7 ms	5440 KB	Output is correct
23	Correct	6 ms	5440 KB	Output is correct
24	Correct	7 ms	5440 KB	Output is correct
25	Correct	6 ms	5440 KB	Output is correct
26	Correct	6 ms	5440 KB	Output is correct
27	Correct	6 ms	5440 KB	Output is correct
28	Correct	10 ms	5600 KB	Output is correct
29	Correct	10 ms	5600 KB	Output is correct
30	Correct	11 ms	5672 KB	Output is correct
31	Correct	10 ms	5708 KB	Output is correct
32	Correct	10 ms	5744 KB	Output is correct
33	Correct	10 ms	5776 KB	Output is correct
34	Correct	8 ms	5812 KB	Output is correct
35	Correct	10 ms	5848 KB	Output is correct
36	Correct	10 ms	5876 KB	Output is correct
37	Correct	8 ms	5912 KB	Output is correct
38	Correct	7 ms	5948 KB	Output is correct
39	Correct	7 ms	6020 KB	Output is correct

Subtask #4
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	5156 KB	Output is correct
2	Correct	6 ms	5244 KB	Output is correct
3	Correct	6 ms	5300 KB	Output is correct
4	Correct	6 ms	5300 KB	Output is correct
5	Correct	6 ms	5300 KB	Output is correct
6	Correct	6 ms	5300 KB	Output is correct
7	Correct	6 ms	5300 KB	Output is correct
8	Correct	6 ms	5348 KB	Output is correct
9	Correct	6 ms	5348 KB	Output is correct
10	Correct	6 ms	5348 KB	Output is correct
11	Correct	5 ms	5348 KB	Output is correct
12	Correct	6 ms	5348 KB	Output is correct
13	Correct	5 ms	5348 KB	Output is correct
14	Correct	6 ms	5348 KB	Output is correct
15	Correct	6 ms	5348 KB	Output is correct
16	Correct	6 ms	5348 KB	Output is correct
17	Correct	6 ms	5348 KB	Output is correct
18	Correct	6 ms	5348 KB	Output is correct
19	Correct	7 ms	5436 KB	Output is correct
20	Correct	7 ms	5440 KB	Output is correct
21	Correct	6 ms	5440 KB	Output is correct
22	Correct	7 ms	5440 KB	Output is correct
23	Correct	6 ms	5440 KB	Output is correct
24	Correct	7 ms	5440 KB	Output is correct
25	Correct	6 ms	5440 KB	Output is correct
26	Correct	6 ms	5440 KB	Output is correct
27	Correct	6 ms	5440 KB	Output is correct
28	Correct	10 ms	5600 KB	Output is correct
29	Correct	10 ms	5600 KB	Output is correct
30	Correct	11 ms	5672 KB	Output is correct
31	Correct	10 ms	5708 KB	Output is correct
32	Correct	10 ms	5744 KB	Output is correct
33	Correct	10 ms	5776 KB	Output is correct
34	Correct	8 ms	5812 KB	Output is correct
35	Correct	10 ms	5848 KB	Output is correct
36	Correct	10 ms	5876 KB	Output is correct
37	Correct	8 ms	5912 KB	Output is correct
38	Correct	7 ms	5948 KB	Output is correct
39	Correct	7 ms	6020 KB	Output is correct
40	Correct	371 ms	14284 KB	Output is correct
41	Correct	282 ms	15776 KB	Output is correct
42	Correct	299 ms	16760 KB	Output is correct
43	Correct	375 ms	18296 KB	Output is correct
44	Correct	378 ms	18928 KB	Output is correct
45	Correct	411 ms	18928 KB	Output is correct
46	Correct	327 ms	18928 KB	Output is correct
47	Correct	101 ms	18928 KB	Output is correct
48	Correct	114 ms	18928 KB	Output is correct
49	Correct	98 ms	18928 KB	Output is correct
50	Correct	110 ms	18928 KB	Output is correct
51	Correct	79 ms	18928 KB	Output is correct

Subtask #5
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	5156 KB	Output is correct
2	Correct	6 ms	5244 KB	Output is correct
3	Correct	6 ms	5300 KB	Output is correct
4	Correct	6 ms	5300 KB	Output is correct
5	Correct	6 ms	5300 KB	Output is correct
6	Correct	6 ms	5300 KB	Output is correct
7	Correct	6 ms	5300 KB	Output is correct
8	Correct	6 ms	5348 KB	Output is correct
9	Correct	6 ms	5348 KB	Output is correct
10	Correct	6 ms	5348 KB	Output is correct
11	Correct	5 ms	5348 KB	Output is correct
12	Correct	6 ms	5348 KB	Output is correct
13	Correct	5 ms	5348 KB	Output is correct
14	Correct	6 ms	5348 KB	Output is correct
15	Correct	6 ms	5348 KB	Output is correct
16	Correct	6 ms	5348 KB	Output is correct
17	Correct	6 ms	5348 KB	Output is correct
18	Correct	6 ms	5348 KB	Output is correct
19	Correct	7 ms	5436 KB	Output is correct
20	Correct	7 ms	5440 KB	Output is correct
21	Correct	6 ms	5440 KB	Output is correct
22	Correct	7 ms	5440 KB	Output is correct
23	Correct	6 ms	5440 KB	Output is correct
24	Correct	7 ms	5440 KB	Output is correct
25	Correct	6 ms	5440 KB	Output is correct
26	Correct	6 ms	5440 KB	Output is correct
27	Correct	6 ms	5440 KB	Output is correct
28	Correct	10 ms	5600 KB	Output is correct
29	Correct	10 ms	5600 KB	Output is correct
30	Correct	11 ms	5672 KB	Output is correct
31	Correct	10 ms	5708 KB	Output is correct
32	Correct	10 ms	5744 KB	Output is correct
33	Correct	10 ms	5776 KB	Output is correct
34	Correct	8 ms	5812 KB	Output is correct
35	Correct	10 ms	5848 KB	Output is correct
36	Correct	10 ms	5876 KB	Output is correct
37	Correct	8 ms	5912 KB	Output is correct
38	Correct	7 ms	5948 KB	Output is correct
39	Correct	7 ms	6020 KB	Output is correct
40	Correct	371 ms	14284 KB	Output is correct
41	Correct	282 ms	15776 KB	Output is correct
42	Correct	299 ms	16760 KB	Output is correct
43	Correct	375 ms	18296 KB	Output is correct
44	Correct	378 ms	18928 KB	Output is correct
45	Correct	411 ms	18928 KB	Output is correct
46	Correct	327 ms	18928 KB	Output is correct
47	Correct	101 ms	18928 KB	Output is correct
48	Correct	114 ms	18928 KB	Output is correct
49	Correct	98 ms	18928 KB	Output is correct
50	Correct	110 ms	18928 KB	Output is correct
51	Correct	79 ms	18928 KB	Output is correct
52	Correct	1596 ms	19036 KB	Output is correct
53	Correct	967 ms	19036 KB	Output is correct
54	Correct	1519 ms	19036 KB	Output is correct
55	Correct	1665 ms	19036 KB	Output is correct
56	Correct	1127 ms	19036 KB	Output is correct
57	Correct	1394 ms	19036 KB	Output is correct
58	Correct	1350 ms	19036 KB	Output is correct
59	Correct	635 ms	19036 KB	Output is correct

Submission #89134

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