oj.uz

답안 #42992

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
42992 2018-03-07T15:25:01 Z alenam0161 전선 연결 (IOI17_wiring) C++14
100 / 100
 93 ms 75700 KB 
#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;
	}
	vector<long long> dp(n + 5, (long long)1e18);
	int pos = 0;
	long long mn;
	int lf;
	for (int i = 0; i < n; ++i) {
	//	cout << i << " is open\n";
		if (left[i] == 0)continue;
		if (left[i] == i) {
			mn = dp[i - 1];
			lf = left[i] - 1;
			mn = dp[lf];
	//		cout << "i am  " << mn << endl;
			long long cmn = mn;
			for (int j = lf; j >= left[lf]; --j) {
				if (j == 0)cmn = 0;
				else cmn = min(cmn, dp[j - 1]);
				if (cmn + sum(j, lf, i) < dp[i]) {
					pos = j;
					dp[i] = cmn + sum(j, lf, i);
					mn = cmn;
				}
			}

		}
		else {
			bool ok = true;
			int z = 0;
	//		cout << mn << endl;
			while (ok) {
				ok = false;
				if (pos == left[lf])dp[i] = mn + sum(left[lf], lf, i);
				else {
					z = pos;
					if (sum(pos, lf, i) + mn > sum(pos - 1, lf, i) + min(mn, dp[pos - 2])) {
						mn = min(mn, dp[pos - 2]);
						pos--;
					}
					if (z != pos)ok = true;
					dp[i] = mn + sum(pos, lf, i);

				}
			}
	//		cout <<mn<<" + "<< pos << endl;
		}
//		cout << "dp[" << i << "] = " << dp[i] << endl;
	}
	return dp[n - 1];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:74:41: warning: 'lf' may be used uninitialized in this function [-Wmaybe-uninitialized]
     if (pos == left[lf])dp[i] = mn + sum(left[lf], lf, i);
                                         ^

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 624 KB Output is correct
2 Correct 1 ms 624 KB Output is correct
3 Correct 43 ms 8344 KB Output is correct
4 Correct 41 ms 8344 KB Output is correct
5 Correct 39 ms 8344 KB Output is correct
6 Correct 54 ms 10724 KB Output is correct
7 Correct 73 ms 10724 KB Output is correct
8 Correct 51 ms 10724 KB Output is correct
9 Correct 56 ms 10724 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10748 KB Output is correct
2 Correct 62 ms 10748 KB Output is correct
3 Correct 66 ms 11988 KB Output is correct
4 Correct 69 ms 13340 KB Output is correct
5 Correct 75 ms 14732 KB Output is correct
6 Correct 2 ms 14732 KB Output is correct
7 Correct 2 ms 14732 KB Output is correct
8 Correct 2 ms 14732 KB Output is correct
9 Correct 2 ms 14732 KB Output is correct
10 Correct 2 ms 14732 KB Output is correct
11 Correct 2 ms 14732 KB Output is correct
12 Correct 2 ms 14732 KB Output is correct
13 Correct 1 ms 14732 KB Output is correct
14 Correct 1 ms 14732 KB Output is correct
15 Correct 1 ms 14732 KB Output is correct
16 Correct 2 ms 14732 KB Output is correct
17 Correct 2 ms 14732 KB Output is correct
18 Correct 61 ms 16084 KB Output is correct
19 Correct 66 ms 17220 KB Output is correct
20 Correct 62 ms 18480 KB Output is correct
21 Correct 66 ms 19744 KB Output is correct
22 Correct 60 ms 21004 KB Output is correct
23 Correct 53 ms 22264 KB Output is correct
24 Correct 55 ms 23524 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 2 ms 536 KB Output is correct
4 Correct 2 ms 616 KB Output is correct
5 Correct 2 ms 616 KB Output is correct
6 Correct 2 ms 616 KB Output is correct
7 Correct 2 ms 616 KB Output is correct
8 Correct 2 ms 616 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 624 KB Output is correct
11 Correct 2 ms 624 KB Output is correct
12 Correct 2 ms 624 KB Output is correct
13 Correct 2 ms 624 KB Output is correct
14 Correct 2 ms 624 KB Output is correct
15 Correct 2 ms 624 KB Output is correct
16 Correct 1 ms 624 KB Output is correct
17 Correct 1 ms 624 KB Output is correct
18 Correct 1 ms 624 KB Output is correct
19 Correct 43 ms 8344 KB Output is correct
20 Correct 41 ms 8344 KB Output is correct
21 Correct 39 ms 8344 KB Output is correct
22 Correct 54 ms 10724 KB Output is correct
23 Correct 73 ms 10724 KB Output is correct
24 Correct 51 ms 10724 KB Output is correct
25 Correct 56 ms 10724 KB Output is correct
26 Correct 2 ms 10724 KB Output is correct
27 Correct 1 ms 10724 KB Output is correct
28 Correct 83 ms 10724 KB Output is correct
29 Correct 75 ms 10748 KB Output is correct
30 Correct 1 ms 10748 KB Output is correct
31 Correct 1 ms 10748 KB Output is correct
32 Correct 1 ms 10748 KB Output is correct
33 Correct 1 ms 10748 KB Output is correct
34 Correct 2 ms 10748 KB Output is correct
35 Correct 2 ms 10748 KB Output is correct
36 Correct 2 ms 10748 KB Output is correct
37 Correct 2 ms 10748 KB Output is correct
38 Correct 2 ms 10748 KB Output is correct
39 Correct 2 ms 10748 KB Output is correct
40 Correct 2 ms 10748 KB Output is correct
41 Correct 2 ms 10748 KB Output is correct
42 Correct 1 ms 10748 KB Output is correct
43 Correct 72 ms 10748 KB Output is correct
44 Correct 73 ms 10748 KB Output is correct
45 Correct 93 ms 10748 KB Output is correct
46 Correct 78 ms 10748 KB Output is correct
47 Correct 71 ms 10748 KB Output is correct
48 Correct 74 ms 10748 KB Output is correct
49 Correct 83 ms 10748 KB Output is correct
50 Correct 1 ms 10748 KB Output is correct
51 Correct 62 ms 10748 KB Output is correct
52 Correct 66 ms 11988 KB Output is correct
53 Correct 69 ms 13340 KB Output is correct
54 Correct 75 ms 14732 KB Output is correct
55 Correct 2 ms 14732 KB Output is correct
56 Correct 2 ms 14732 KB Output is correct
57 Correct 2 ms 14732 KB Output is correct
58 Correct 2 ms 14732 KB Output is correct
59 Correct 2 ms 14732 KB Output is correct
60 Correct 2 ms 14732 KB Output is correct
61 Correct 2 ms 14732 KB Output is correct
62 Correct 1 ms 14732 KB Output is correct
63 Correct 1 ms 14732 KB Output is correct
64 Correct 1 ms 14732 KB Output is correct
65 Correct 2 ms 14732 KB Output is correct
66 Correct 2 ms 14732 KB Output is correct
67 Correct 61 ms 16084 KB Output is correct
68 Correct 66 ms 17220 KB Output is correct
69 Correct 62 ms 18480 KB Output is correct
70 Correct 66 ms 19744 KB Output is correct
71 Correct 60 ms 21004 KB Output is correct
72 Correct 53 ms 22264 KB Output is correct
73 Correct 55 ms 23524 KB Output is correct
74 Correct 59 ms 25440 KB Output is correct
75 Correct 68 ms 27048 KB Output is correct
76 Correct 68 ms 28968 KB Output is correct
77 Correct 65 ms 30388 KB Output is correct
78 Correct 62 ms 31728 KB Output is correct
79 Correct 63 ms 33144 KB Output is correct
80 Correct 56 ms 34508 KB Output is correct
81 Correct 60 ms 35872 KB Output is correct
82 Correct 53 ms 37296 KB Output is correct
83 Correct 54 ms 38948 KB Output is correct
84 Correct 56 ms 40776 KB Output is correct
85 Correct 69 ms 42708 KB Output is correct
86 Correct 65 ms 44656 KB Output is correct
87 Correct 61 ms 46588 KB Output is correct
88 Correct 74 ms 48648 KB Output is correct
89 Correct 62 ms 50452 KB Output is correct
90 Correct 73 ms 52384 KB Output is correct
91 Correct 62 ms 54324 KB Output is correct
92 Correct 92 ms 56264 KB Output is correct
93 Correct 64 ms 58404 KB Output is correct
94 Correct 66 ms 60136 KB Output is correct
95 Correct 67 ms 62076 KB Output is correct
96 Correct 60 ms 64008 KB Output is correct
97 Correct 58 ms 65956 KB Output is correct
98 Correct 66 ms 67888 KB Output is correct
99 Correct 75 ms 69816 KB Output is correct
100 Correct 74 ms 71752 KB Output is correct
101 Correct 76 ms 73872 KB Output is correct
102 Correct 72 ms 75700 KB Output is correct