oj.uz

답안 #371263

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
371263 2021-02-26T10:11:30 Z KoD 전선 연결 (IOI17_wiring) C++17
100 / 100
 47 ms 7912 KB 
#include <bits/stdc++.h>
#include "wiring.h"

template <class T>
using Vec = std::vector<T>;
using ll = long long;

constexpr ll INF = std::numeric_limits<ll>::max() / 2;

ll min_total_length(Vec<int> r, Vec<int> b) {
	Vec<Vec<int>> component;
	const int n = (int) r.size();
	const int m = (int) b.size();
	{
		int last = -1;
		int i = 0, j = 0;
		while (i != n || j != m) {
			if ((j == m) || (i != n && r[i] < b[j])) {
				if (last != 0) {
					component.push_back({ });
					last = 0;
				}
				component.back().push_back(r[i]);
				i += 1;
			}
			else {
				if (last != 1) {
					component.push_back({ });
					last = 1;
				}
				component.back().push_back(b[j]);
				j += 1;
			}
		}
	}
	Vec<ll> dp(component[0].size() + 1, INF);
	{
		ll sum = 0;
		for (const auto x: component[0]) {
			sum += component[0].back() - x;
		}
		dp.back() = sum;
	}
	for (int i = 1; i < (int) component.size(); ++i) {
		const ll dif = component[i].front() - component[i - 1].back();
		Vec<ll> left_min(dp.size() + 1, INF);
		for (int j = 0; j < (int) dp.size(); ++j) {
			left_min[j + 1] = left_min[j];
			left_min[j + 1] = std::min(left_min[j + 1], dp[j]);
		}
		Vec<ll> right_min(dp.size() + 1, INF);
		for (int j = (int) dp.size() - 1; j >= 0; --j) {
			right_min[j] = right_min[j + 1];
			right_min[j] = std::min(right_min[j], dp[j] + dif * j);
		}
		const auto cost = [&](const int k) {
			const int l = (int) component[i].size() - k;
			ll ret = left_min[std::min((int) left_min.size() - 1, l)] + dif * l;
			if (l < right_min.size()) {
				ret = std::min(ret, right_min[l]);
			}
			return ret;
		};
		dp.resize(component[i].size() + 1, INF);
		ll sum = 0;
		for (const auto x: component[i]) {
			sum += x - component[i].front();
		}
		dp[0] = cost(0) + sum;
		for (int j = (int) component[i].size() - 1; j >= 0; --j) {
			const int r = (int) component[i].size() - j;
			sum -= component[i][j] - component[i].front();
			sum += component[i].back() - component[i][j];
			dp[r] = cost(r) + sum;
		}
	}
	return dp[0];
}

Compilation message

wiring.cpp: In lambda function:
wiring.cpp:59:10: warning: comparison of integer expressions of different signedness: 'const int' and 'std::vector<long long int, std::allocator<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |    if (l < right_min.size()) {
      |        ~~^~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 25 ms 6116 KB Output is correct
4 Correct 25 ms 6116 KB Output is correct
5 Correct 24 ms 5608 KB Output is correct
6 Correct 34 ms 7912 KB Output is correct
7 Correct 32 ms 7144 KB Output is correct
8 Correct 32 ms 7144 KB Output is correct
9 Correct 34 ms 7272 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 45 ms 7200 KB Output is correct
4 Correct 36 ms 6564 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 43 ms 7200 KB Output is correct
19 Correct 43 ms 7200 KB Output is correct
20 Correct 39 ms 6948 KB Output is correct
21 Correct 43 ms 7200 KB Output is correct
22 Correct 42 ms 6816 KB Output is correct
23 Correct 43 ms 6816 KB Output is correct
24 Correct 43 ms 7072 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 30 ms 4416 KB Output is correct
3 Correct 34 ms 5160 KB Output is correct
4 Correct 28 ms 4332 KB Output is correct
5 Correct 35 ms 5160 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 30 ms 5108 KB Output is correct
19 Correct 31 ms 4076 KB Output is correct
20 Correct 28 ms 4332 KB Output is correct
21 Correct 28 ms 4800 KB Output is correct
22 Correct 30 ms 6120 KB Output is correct
23 Correct 31 ms 6520 KB Output is correct
24 Correct 31 ms 6120 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 25 ms 6116 KB Output is correct
20 Correct 25 ms 6116 KB Output is correct
21 Correct 24 ms 5608 KB Output is correct
22 Correct 34 ms 7912 KB Output is correct
23 Correct 32 ms 7144 KB Output is correct
24 Correct 32 ms 7144 KB Output is correct
25 Correct 34 ms 7272 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 45 ms 7200 KB Output is correct
29 Correct 36 ms 6564 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 43 ms 7200 KB Output is correct
44 Correct 43 ms 7200 KB Output is correct
45 Correct 39 ms 6948 KB Output is correct
46 Correct 43 ms 7200 KB Output is correct
47 Correct 42 ms 6816 KB Output is correct
48 Correct 43 ms 6816 KB Output is correct
49 Correct 43 ms 7072 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 30 ms 4416 KB Output is correct
52 Correct 34 ms 5160 KB Output is correct
53 Correct 28 ms 4332 KB Output is correct
54 Correct 35 ms 5160 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 1 ms 364 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 1 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 30 ms 5108 KB Output is correct
68 Correct 31 ms 4076 KB Output is correct
69 Correct 28 ms 4332 KB Output is correct
70 Correct 28 ms 4800 KB Output is correct
71 Correct 30 ms 6120 KB Output is correct
72 Correct 31 ms 6520 KB Output is correct
73 Correct 31 ms 6120 KB Output is correct
74 Correct 32 ms 6760 KB Output is correct
75 Correct 38 ms 5768 KB Output is correct
76 Correct 47 ms 6372 KB Output is correct
77 Correct 30 ms 5740 KB Output is correct
78 Correct 30 ms 5984 KB Output is correct
79 Correct 31 ms 5920 KB Output is correct
80 Correct 30 ms 5988 KB Output is correct
81 Correct 30 ms 6564 KB Output is correct
82 Correct 30 ms 6372 KB Output is correct
83 Correct 36 ms 6628 KB Output is correct
84 Correct 32 ms 7268 KB Output is correct
85 Correct 33 ms 5884 KB Output is correct
86 Correct 33 ms 6888 KB Output is correct
87 Correct 32 ms 6756 KB Output is correct
88 Correct 32 ms 6156 KB Output is correct
89 Correct 33 ms 6636 KB Output is correct
90 Correct 34 ms 6136 KB Output is correct
91 Correct 32 ms 7012 KB Output is correct
92 Correct 34 ms 6516 KB Output is correct
93 Correct 33 ms 6372 KB Output is correct
94 Correct 34 ms 6984 KB Output is correct
95 Correct 33 ms 6036 KB Output is correct
96 Correct 32 ms 6884 KB Output is correct
97 Correct 35 ms 7528 KB Output is correct
98 Correct 34 ms 7016 KB Output is correct
99 Correct 35 ms 7144 KB Output is correct
100 Correct 35 ms 7076 KB Output is correct
101 Correct 33 ms 6632 KB Output is correct
102 Correct 33 ms 6500 KB Output is correct