답안 #42960 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
42960	2018-03-06T21:37:49 Z	alenam0161	전선 연결 (IOI17_wiring)	C++14	30 / 100	1000 ms	21532 KB

wiring

#include "wiring.h"
#include <iostream>
#include <algorithm>
using namespace std;
vector<long long> pre, suf;
vector<pair<long long, int>> all;
int n;
long long pre_gum(int l, int r) {
	if (l > r)return 0;
	if (l == 0) {
		return pre[r]-(r-l+1)*all[0].first;
	}
	return pre[r] -pre[l-1]- all[l].first * (r - l + 1);
}
long long suf_gum(int l, int r) {
	if (l > r)return 0;
	return suf[l] -suf[r+1]- (all[n-1].first-all[r].first) * (r-l+1);
}
long long sum(int l, int mid, int r) {
	return suf_gum(l, mid) + pre_gum(mid + 1, r) + 1ll*max(mid - l + 1, r - mid)*(all[mid + 1].first - all[mid].first);
}
long long min_total_length(std::vector<int> r, std::vector<int> b) {
	for (int to : r)all.push_back({ to,1 });
	for (int to : b)all.push_back({ to,2 });
	int n = all.size();
	::n = n;
	sort(all.begin(), all.end());
	vector<int> left(n + 1, 0);
	for (int i = 0; i < n; ++i) {
		if (i == 0 || (all[i].second != all[i - 1].second)) {
			left[i] = i;
		}
		else left[i] = left[i - 1];
	}
	pre.resize(n + 5, 0);
	suf.resize(n + 5, 0);
	for (int i = 0; i < n; ++i) {
		pre[i] = (i == 0 ? 0 : pre[i - 1]) + all[i].first;
	//	cout << "pre[" << i << "] = " << pre[i] << endl;
	}
	for (int i = n - 1; i >= 0;i--) {
		suf[i] = (i ==n-1? 0 : suf[i + 1]) +all[n-1].first-all[i].first;
	}
	if (left[left[n-1] - 1] == 0) {
		return sum(0, r.size() - 1, n - 1);
	}
	vector<long long> dp(n + 5, (long long)1e18);
	for (int i = 0; i < n; ++i) {
		if (left[i] == 0)continue;
		long long mn = dp[i-1];
		int lf = left[i] - 1;
		mn = dp[lf];
		for (int j = lf; j >= left[lf]; --j) {
			if (j == 0)mn = 0;
			else mn = min(mn, dp[j - 1]);
			dp[i] = min(dp[i], mn + sum(j, lf, i));
		}
	}
	return dp[n-1];
}

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	636 KB	Output is correct
2	Correct	2 ms	636 KB	Output is correct
3	Correct	38 ms	6976 KB	Output is correct
4	Correct	39 ms	8512 KB	Output is correct
5	Correct	40 ms	10020 KB	Output is correct
6	Correct	55 ms	14044 KB	Output is correct
7	Correct	53 ms	15976 KB	Output is correct
8	Correct	50 ms	18052 KB	Output is correct
9	Correct	50 ms	19904 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	19904 KB	Output is correct
2	Correct	1 ms	19904 KB	Output is correct
3	Correct	74 ms	21532 KB	Output is correct
4	Correct	88 ms	21532 KB	Output is correct
5	Correct	1 ms	21532 KB	Output is correct
6	Correct	1 ms	21532 KB	Output is correct
7	Correct	1 ms	21532 KB	Output is correct
8	Correct	2 ms	21532 KB	Output is correct
9	Correct	2 ms	21532 KB	Output is correct
10	Correct	1 ms	21532 KB	Output is correct
11	Correct	1 ms	21532 KB	Output is correct
12	Correct	1 ms	21532 KB	Output is correct
13	Correct	1 ms	21532 KB	Output is correct
14	Correct	1 ms	21532 KB	Output is correct
15	Correct	1 ms	21532 KB	Output is correct
16	Correct	1 ms	21532 KB	Output is correct
17	Correct	1 ms	21532 KB	Output is correct
18	Correct	74 ms	21532 KB	Output is correct
19	Correct	73 ms	21532 KB	Output is correct
20	Correct	80 ms	21532 KB	Output is correct
21	Correct	73 ms	21532 KB	Output is correct
22	Correct	78 ms	21532 KB	Output is correct
23	Correct	74 ms	21532 KB	Output is correct
24	Correct	73 ms	21532 KB	Output is correct

Subtask #4
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	21532 KB	Output is correct
2	Execution timed out	1061 ms	21532 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #5
0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	248 KB	Output is correct
2	Correct	1 ms	352 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	1 ms	620 KB	Output is correct
5	Correct	1 ms	620 KB	Output is correct
6	Correct	1 ms	620 KB	Output is correct
7	Correct	2 ms	620 KB	Output is correct
8	Correct	2 ms	620 KB	Output is correct
9	Correct	2 ms	620 KB	Output is correct
10	Correct	2 ms	620 KB	Output is correct
11	Correct	2 ms	636 KB	Output is correct
12	Correct	2 ms	636 KB	Output is correct
13	Correct	2 ms	636 KB	Output is correct
14	Correct	2 ms	636 KB	Output is correct
15	Correct	2 ms	636 KB	Output is correct
16	Correct	2 ms	636 KB	Output is correct
17	Correct	1 ms	636 KB	Output is correct
18	Correct	2 ms	636 KB	Output is correct
19	Correct	38 ms	6976 KB	Output is correct
20	Correct	39 ms	8512 KB	Output is correct
21	Correct	40 ms	10020 KB	Output is correct
22	Correct	55 ms	14044 KB	Output is correct
23	Correct	53 ms	15976 KB	Output is correct
24	Correct	50 ms	18052 KB	Output is correct
25	Correct	50 ms	19904 KB	Output is correct
26	Correct	1 ms	19904 KB	Output is correct
27	Correct	1 ms	19904 KB	Output is correct
28	Correct	74 ms	21532 KB	Output is correct
29	Correct	88 ms	21532 KB	Output is correct
30	Correct	1 ms	21532 KB	Output is correct
31	Correct	1 ms	21532 KB	Output is correct
32	Correct	1 ms	21532 KB	Output is correct
33	Correct	2 ms	21532 KB	Output is correct
34	Correct	2 ms	21532 KB	Output is correct
35	Correct	1 ms	21532 KB	Output is correct
36	Correct	1 ms	21532 KB	Output is correct
37	Correct	1 ms	21532 KB	Output is correct
38	Correct	1 ms	21532 KB	Output is correct
39	Correct	1 ms	21532 KB	Output is correct
40	Correct	1 ms	21532 KB	Output is correct
41	Correct	1 ms	21532 KB	Output is correct
42	Correct	1 ms	21532 KB	Output is correct
43	Correct	74 ms	21532 KB	Output is correct
44	Correct	73 ms	21532 KB	Output is correct
45	Correct	80 ms	21532 KB	Output is correct
46	Correct	73 ms	21532 KB	Output is correct
47	Correct	78 ms	21532 KB	Output is correct
48	Correct	74 ms	21532 KB	Output is correct
49	Correct	73 ms	21532 KB	Output is correct
50	Correct	1 ms	21532 KB	Output is correct
51	Execution timed out	1061 ms	21532 KB	Time limit exceeded
52	Halted	0 ms	0 KB	-

답안 #42960

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 13.0 / 13.0

Subtask #3 10.0 / 10.0

Subtask #4 0 / 25.0

Subtask #5 0 / 45.0

Subtask #1
7.0 / 7.0

Subtask #2
13.0 / 13.0

Subtask #3
10.0 / 10.0

Subtask #4
0 / 25.0

Subtask #5
0 / 45.0