답안 #526624

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
526624	2022-02-15T18:09:35 Z	sliviu	꿈 (IOI13_dreaming)	C++17	24 / 100	194 ms	23328 KB

dreaming

#include <dreaming.h>
#include <bits/stdc++.h>

using namespace std;

int travelTime(int n, int m, int cost, int A[], int B[], int T[]) {
	int ans = 0, t = 0;
	vector<int> seen(n), dpu(n), dpb(n), cn;
	vector<vector<int>> pref(n), suf(n);
	deque<pair<int, int>> cur;
	vector<vector<pair<int, int>>> G(n);
	for (int i = 0; i < m; ++i) {
		G[A[i]].emplace_back(B[i], T[i]);
		G[B[i]].emplace_back(A[i], T[i]);
	}
	function<void(int, int)> dfs = [&](int node, int last) {
		cn.emplace_back(node);
		seen[node] = t;
		pref[node].emplace_back(0), suf[node].emplace_back(0);
		for (auto x : G[node])
			if (x.first != last) {
				dfs(x.first, node);
				dpb[node] = max(dpb[node], dpb[x.first] + x.second);
				pref[node].emplace_back(dpb[x.first] + x.second);
				suf[node].emplace_back(dpb[x.first] + x.second);
			}
		pref[node].emplace_back(0), suf[node].emplace_back(0);
		int s = pref[node].size() - 1;
		for (int i = 1; i <= s; ++i)
			pref[node][i] = max(pref[node][i], pref[node][i - 1]);
		for (int i = s; i; --i)
			suf[node][i] = max(suf[node][i], suf[node][i + 1]);
	};
	function<void(int, int)> dfs2 = [&](int node, int last) {
		int ct = 1;
		for (auto x : G[node])
			if (x.first != last) {
				dpu[x.first] = x.second + max(max(pref[node][ct - 1], suf[node][ct + 1]), dpu[node]);
				dfs2(x.first, node);
				++ct;
			}
	};


	for (int i = 0; i < n; ++i)
		if (!seen[i]) {
			++t;
			cn.clear();
			dfs(i, -1);
			dfs2(i, -1);
			pair<int, int> ans = {INT_MAX, 0};
			//cout << "ROOT : " << i << '\n';
			for (auto x : cn)
				//printf("%d : U %d D %d\n", x, dpu[x], dpb[x]);
				ans = min(ans, {max(dpu[x],dpb[x]),x});
			cur.emplace_back(ans);
			//cout << ans.first << ' ' << ans.second << '\n';
		}
	sort(cur.begin(), cur.end());
	reverse(cur.begin(), cur.end());
	pair<int, int> node = cur.front();
	cur.pop_front();
	for (auto [c, n] : cur) {
		//cout << "ADD " << n << ' ' << node.second << '\n';
		G[n].emplace_back(node.second, cost);
		G[node.second].emplace_back(n, cost);
		if (c < node.second)
			node.first = max(node.first, c + cost);
		else
			node.first = max(node.first, c + cost), node.second = n;
	}
	dpb.assign(n, 0), dpu.assign(n, 0);
	pref.assign(n, vector<int>()), suf.assign(n, vector<int>());
	dfs(0, -1);
	dfs2(0, -1);
	for (int i = 0; i < n; ++i)
		ans = max(ans, dpu[i] + dpb[i]);
	return ans;
}

Subtask #1
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	136 ms	23228 KB	Output is correct
2	Correct	135 ms	22872 KB	Output is correct
3	Correct	103 ms	17256 KB	Output is correct
4	Correct	13 ms	3660 KB	Output is correct
5	Correct	14 ms	2508 KB	Output is correct
6	Correct	24 ms	5312 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	52 ms	10212 KB	Output is correct
9	Correct	76 ms	14144 KB	Output is correct
10	Correct	1 ms	460 KB	Output is correct
11	Correct	129 ms	17600 KB	Output is correct
12	Correct	151 ms	20200 KB	Output is correct
13	Correct	1 ms	460 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	272 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	0 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	0 ms	204 KB	Output is correct

Subtask #3
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	136 ms	23228 KB	Output is correct
2	Correct	135 ms	22872 KB	Output is correct
3	Correct	103 ms	17256 KB	Output is correct
4	Correct	13 ms	3660 KB	Output is correct
5	Correct	14 ms	2508 KB	Output is correct
6	Correct	24 ms	5312 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	52 ms	10212 KB	Output is correct
9	Correct	76 ms	14144 KB	Output is correct
10	Correct	1 ms	460 KB	Output is correct
11	Correct	129 ms	17600 KB	Output is correct
12	Correct	151 ms	20200 KB	Output is correct
13	Correct	1 ms	460 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	272 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	0 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Correct	0 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	1 ms	204 KB	Output is correct
35	Correct	0 ms	204 KB	Output is correct
36	Correct	1 ms	204 KB	Output is correct
37	Correct	1 ms	204 KB	Output is correct
38	Correct	0 ms	204 KB	Output is correct
39	Correct	147 ms	23328 KB	Output is correct
40	Correct	142 ms	22880 KB	Output is correct
41	Correct	74 ms	17368 KB	Output is correct
42	Correct	12 ms	3644 KB	Output is correct
43	Correct	1 ms	204 KB	Output is correct
44	Correct	1 ms	204 KB	Output is correct
45	Correct	1 ms	204 KB	Output is correct
46	Correct	1 ms	204 KB	Output is correct
47	Correct	0 ms	204 KB	Output is correct
48	Correct	1 ms	204 KB	Output is correct
49	Correct	1 ms	204 KB	Output is correct
50	Correct	1 ms	204 KB	Output is correct
51	Correct	0 ms	204 KB	Output is correct
52	Correct	1 ms	204 KB	Output is correct
53	Correct	1 ms	204 KB	Output is correct
54	Correct	0 ms	204 KB	Output is correct
55	Correct	0 ms	216 KB	Output is correct
56	Correct	1 ms	216 KB	Output is correct
57	Incorrect	194 ms	19948 KB	Output isn't correct
58	Halted	0 ms	0 KB	-

Subtask #4
0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	98 ms	19648 KB	Output is correct
2	Correct	94 ms	20012 KB	Output is correct
3	Correct	105 ms	19940 KB	Output is correct
4	Incorrect	101 ms	20040 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #5
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	272 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	0 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	0 ms	204 KB	Output is correct
26	Correct	1 ms	460 KB	Output is correct
27	Correct	2 ms	812 KB	Output is correct
28	Correct	3 ms	944 KB	Output is correct
29	Correct	1 ms	432 KB	Output is correct
30	Correct	2 ms	692 KB	Output is correct
31	Correct	4 ms	972 KB	Output is correct
32	Incorrect	1 ms	460 KB	Output isn't correct
33	Halted	0 ms	0 KB	-

Subtask #6
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	136 ms	23228 KB	Output is correct
2	Correct	135 ms	22872 KB	Output is correct
3	Correct	103 ms	17256 KB	Output is correct
4	Correct	13 ms	3660 KB	Output is correct
5	Correct	14 ms	2508 KB	Output is correct
6	Correct	24 ms	5312 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	52 ms	10212 KB	Output is correct
9	Correct	76 ms	14144 KB	Output is correct
10	Correct	1 ms	460 KB	Output is correct
11	Correct	129 ms	17600 KB	Output is correct
12	Correct	151 ms	20200 KB	Output is correct
13	Correct	1 ms	460 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	272 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	0 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Correct	0 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	1 ms	204 KB	Output is correct
35	Correct	0 ms	204 KB	Output is correct
36	Correct	1 ms	204 KB	Output is correct
37	Correct	1 ms	204 KB	Output is correct
38	Correct	0 ms	204 KB	Output is correct
39	Correct	147 ms	23328 KB	Output is correct
40	Correct	142 ms	22880 KB	Output is correct
41	Correct	74 ms	17368 KB	Output is correct
42	Correct	12 ms	3644 KB	Output is correct
43	Correct	1 ms	204 KB	Output is correct
44	Correct	1 ms	204 KB	Output is correct
45	Correct	1 ms	204 KB	Output is correct
46	Correct	1 ms	204 KB	Output is correct
47	Correct	0 ms	204 KB	Output is correct
48	Correct	1 ms	204 KB	Output is correct
49	Correct	1 ms	204 KB	Output is correct
50	Correct	1 ms	204 KB	Output is correct
51	Correct	0 ms	204 KB	Output is correct
52	Correct	1 ms	204 KB	Output is correct
53	Correct	1 ms	204 KB	Output is correct
54	Correct	0 ms	204 KB	Output is correct
55	Correct	0 ms	216 KB	Output is correct
56	Correct	1 ms	216 KB	Output is correct
57	Incorrect	194 ms	19948 KB	Output isn't correct
58	Halted	0 ms	0 KB	-

답안 #526624

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 23.0

Subtask #4 0 / 18.0

Subtask #5 0 / 12.0

Subtask #6 0 / 23.0

Subtask #1
14.0 / 14.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 23.0

Subtask #4
0 / 18.0

Subtask #5
0 / 12.0

Subtask #6
0 / 23.0