답안 #145187

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
145187	2019-08-19T08:37:16 Z	ecnerwala	Job Scheduling (IOI19_job)	C++14	100 / 100	324 ms	18036 KB

#include "job.h"
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

ll scheduling_cost(vector<int> P, vector<int> U_, vector<int> D_) {
	vector<ll> U(U_.begin(), U_.end());
	vector<ll> D(D_.begin(), D_.end());
	int N = int(P.size());
	ll ans = 0;
	for (int i = 0; i < N; i++) {
		ans += U[i] * D[i];
	}

	// build things earlier with high U[i] / D[i]
	auto cmp = [](pair<pair<ll, ll>, int> i, pair<pair<ll, ll>, int> j) {
		// returns true if j comes first
		return j.first.second * i.first.first < i.first.second * j.first.first;
	};

	priority_queue<pair<pair<ll, ll>, int>, vector<pair<pair<ll, ll>, int>>, decltype(cmp)> pq(cmp);
	vector<char> dead(N);

	for (int i = 1; i < N; i++) {
		if (U[i] == 0 && D[i] == 0) {
			dead[i] = true;
		} else {
			pq.emplace(pair<ll, ll>(U[i], D[i]), i);
		}
	}

	int cnt = 0;
	while (!pq.empty()) {
		auto it = pq.top(); pq.pop();
		int cur = it.second;
		if (dead[cur] || it.first != pair<ll, ll>(U[cur], D[cur])) continue;

		int prv = P[cur];
		while (dead[prv]) {
			assert(0 <= P[prv] && P[prv] < prv);
			prv = P[prv];
		}

		for (int v = P[cur]; v != prv; ) {
			int nxt = P[v];
			P[v] = prv;
			v = nxt;
		}

		ans += D[prv] * U[cur];
		U[prv] += U[cur];
		D[prv] += D[cur];
		dead[cur] = true;
		if (prv != 0) {
			pq.emplace(pair<ll, ll>(U[prv], D[prv]), prv);
		}
		cnt++;
	}
	return ans;
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	3 ms	376 KB	Output is correct
5	Correct	52 ms	4848 KB	Output is correct
6	Correct	112 ms	9068 KB	Output is correct
7	Correct	193 ms	15076 KB	Output is correct
8	Correct	274 ms	18036 KB	Output is correct
9	Correct	271 ms	17768 KB	Output is correct
10	Correct	270 ms	17780 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	274 ms	17896 KB	Output is correct
13	Correct	209 ms	17892 KB	Output is correct
14	Correct	234 ms	17888 KB	Output is correct
15	Correct	179 ms	17876 KB	Output is correct
16	Correct	229 ms	17760 KB	Output is correct
17	Correct	318 ms	17768 KB	Output is correct
18	Correct	277 ms	17764 KB	Output is correct
19	Correct	172 ms	17892 KB	Output is correct
20	Correct	144 ms	17776 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	183 ms	16340 KB	Output is correct
5	Correct	193 ms	16488 KB	Output is correct
6	Correct	167 ms	16360 KB	Output is correct
7	Correct	163 ms	16388 KB	Output is correct
8	Correct	173 ms	16356 KB	Output is correct
9	Correct	163 ms	16360 KB	Output is correct
10	Correct	200 ms	16376 KB	Output is correct
11	Correct	162 ms	16360 KB	Output is correct

Subtask #3
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	3 ms	376 KB	Output is correct
5	Correct	8 ms	1336 KB	Output is correct
6	Correct	173 ms	17028 KB	Output is correct
7	Correct	169 ms	17016 KB	Output is correct
8	Correct	173 ms	17000 KB	Output is correct
9	Correct	180 ms	16972 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	3 ms	504 KB	Output is correct
12	Correct	8 ms	1216 KB	Output is correct
13	Correct	10 ms	1340 KB	Output is correct
14	Correct	194 ms	16892 KB	Output is correct
15	Correct	172 ms	17000 KB	Output is correct
16	Correct	175 ms	16936 KB	Output is correct
17	Correct	195 ms	17000 KB	Output is correct
18	Correct	192 ms	16940 KB	Output is correct
19	Correct	176 ms	16992 KB	Output is correct
20	Correct	180 ms	17000 KB	Output is correct
21	Correct	197 ms	17016 KB	Output is correct
22	Correct	180 ms	16992 KB	Output is correct
23	Correct	173 ms	17000 KB	Output is correct
24	Correct	174 ms	17004 KB	Output is correct

Subtask #4
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	280 ms	17768 KB	Output is correct
3	Correct	324 ms	17760 KB	Output is correct
4	Correct	283 ms	17760 KB	Output is correct

Subtask #5
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	3 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	3 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct

Subtask #6
37.0 / 37.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	3 ms	376 KB	Output is correct
5	Correct	52 ms	4848 KB	Output is correct
6	Correct	112 ms	9068 KB	Output is correct
7	Correct	193 ms	15076 KB	Output is correct
8	Correct	274 ms	18036 KB	Output is correct
9	Correct	271 ms	17768 KB	Output is correct
10	Correct	270 ms	17780 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	274 ms	17896 KB	Output is correct
13	Correct	209 ms	17892 KB	Output is correct
14	Correct	234 ms	17888 KB	Output is correct
15	Correct	179 ms	17876 KB	Output is correct
16	Correct	229 ms	17760 KB	Output is correct
17	Correct	318 ms	17768 KB	Output is correct
18	Correct	277 ms	17764 KB	Output is correct
19	Correct	172 ms	17892 KB	Output is correct
20	Correct	144 ms	17776 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	183 ms	16340 KB	Output is correct
25	Correct	193 ms	16488 KB	Output is correct
26	Correct	167 ms	16360 KB	Output is correct
27	Correct	163 ms	16388 KB	Output is correct
28	Correct	173 ms	16356 KB	Output is correct
29	Correct	163 ms	16360 KB	Output is correct
30	Correct	200 ms	16376 KB	Output is correct
31	Correct	162 ms	16360 KB	Output is correct
32	Correct	2 ms	256 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	2 ms	256 KB	Output is correct
35	Correct	3 ms	376 KB	Output is correct
36	Correct	8 ms	1336 KB	Output is correct
37	Correct	173 ms	17028 KB	Output is correct
38	Correct	169 ms	17016 KB	Output is correct
39	Correct	173 ms	17000 KB	Output is correct
40	Correct	180 ms	16972 KB	Output is correct
41	Correct	2 ms	376 KB	Output is correct
42	Correct	3 ms	504 KB	Output is correct
43	Correct	8 ms	1216 KB	Output is correct
44	Correct	10 ms	1340 KB	Output is correct
45	Correct	194 ms	16892 KB	Output is correct
46	Correct	172 ms	17000 KB	Output is correct
47	Correct	175 ms	16936 KB	Output is correct
48	Correct	195 ms	17000 KB	Output is correct
49	Correct	192 ms	16940 KB	Output is correct
50	Correct	176 ms	16992 KB	Output is correct
51	Correct	180 ms	17000 KB	Output is correct
52	Correct	197 ms	17016 KB	Output is correct
53	Correct	180 ms	16992 KB	Output is correct
54	Correct	173 ms	17000 KB	Output is correct
55	Correct	174 ms	17004 KB	Output is correct
56	Correct	2 ms	256 KB	Output is correct
57	Correct	280 ms	17768 KB	Output is correct
58	Correct	324 ms	17760 KB	Output is correct
59	Correct	283 ms	17760 KB	Output is correct
60	Correct	2 ms	256 KB	Output is correct
61	Correct	2 ms	376 KB	Output is correct
62	Correct	2 ms	376 KB	Output is correct
63	Correct	2 ms	376 KB	Output is correct
64	Correct	2 ms	376 KB	Output is correct
65	Correct	2 ms	376 KB	Output is correct
66	Correct	2 ms	376 KB	Output is correct
67	Correct	2 ms	376 KB	Output is correct
68	Correct	2 ms	376 KB	Output is correct
69	Correct	3 ms	376 KB	Output is correct
70	Correct	2 ms	376 KB	Output is correct
71	Correct	3 ms	376 KB	Output is correct
72	Correct	2 ms	376 KB	Output is correct
73	Correct	2 ms	376 KB	Output is correct
74	Correct	2 ms	376 KB	Output is correct
75	Correct	2 ms	376 KB	Output is correct
76	Correct	2 ms	376 KB	Output is correct
77	Correct	2 ms	256 KB	Output is correct
78	Correct	2 ms	376 KB	Output is correct
79	Correct	2 ms	376 KB	Output is correct
80	Correct	2 ms	376 KB	Output is correct
81	Correct	2 ms	376 KB	Output is correct
82	Correct	2 ms	376 KB	Output is correct
83	Correct	2 ms	252 KB	Output is correct
84	Correct	2 ms	256 KB	Output is correct
85	Correct	2 ms	256 KB	Output is correct
86	Correct	2 ms	376 KB	Output is correct
87	Correct	2 ms	376 KB	Output is correct
88	Correct	6 ms	888 KB	Output is correct
89	Correct	8 ms	1084 KB	Output is correct
90	Correct	10 ms	1336 KB	Output is correct
91	Correct	47 ms	4720 KB	Output is correct
92	Correct	104 ms	9068 KB	Output is correct
93	Correct	252 ms	17868 KB	Output is correct
94	Correct	253 ms	17768 KB	Output is correct
95	Correct	243 ms	17772 KB	Output is correct
96	Correct	230 ms	17768 KB	Output is correct
97	Correct	227 ms	17640 KB	Output is correct
98	Correct	233 ms	17892 KB	Output is correct
99	Correct	203 ms	17640 KB	Output is correct
100	Correct	249 ms	17884 KB	Output is correct
101	Correct	270 ms	17768 KB	Output is correct
102	Correct	197 ms	17768 KB	Output is correct
103	Correct	249 ms	17892 KB	Output is correct
104	Correct	259 ms	17896 KB	Output is correct
105	Correct	192 ms	17892 KB	Output is correct
106	Correct	185 ms	17200 KB	Output is correct

답안 #145187

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 12.0 / 12.0

Subtask #4 18.0 / 18.0

Subtask #5 21.0 / 21.0

Subtask #6 37.0 / 37.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
12.0 / 12.0

Subtask #4
18.0 / 18.0

Subtask #5
21.0 / 21.0

Subtask #6
37.0 / 37.0