oj.uz

Submission #753915

# Submission time Handle Problem Language Result Execution time Memory
753915 2023-06-06T10:07:12 Z valerikk Wiring (IOI17_wiring) C++17
100 / 100
 54 ms 10184 KB 
#include "wiring.h"
#include <bits/stdc++.h>

using namespace std;

const long long INF = 2e18;

long long getcost(vector<int> r, vector<int> b) {
	int n = r.size();
	int m = b.size();
	long long ret = 0;
	if (n < m) {
		for (int i = 0; i < n; ++i) {
			ret -= r[i];
		}
		ret -= (m - n) * 1ll * r[n - 1];
		for (int i = 0; i < m; ++i) {
			ret += b[i];
		}
	} else {
		for (int i = 0; i < n; ++i) {
			ret -= r[i];
		}
		ret += (n - m) * 1ll * b[0];
		for (int i = 0; i < m; ++i) {
			ret += b[i];
		}
	}
	return ret;
}

long long min_total_length(std::vector<int> r, std::vector<int> b) {
	int n = r.size();
	int m = b.size();
	vector<pair<int, int>> kek;
	for (int i = 0; i < n; ++i) {
		kek.push_back({r[i], 0});
	}
	for (int i = 0; i < m; ++i) {
		kek.push_back({b[i], 1});
	}
	sort(kek.begin(), kek.end());
	vector<long long> dp(n + m + 1, INF);
	vector<long long> dp1(n + m + 1, INF), dp2(n + m + 1, INF);
	dp[0] = 0;
	for (int i = 0; i < n + m; ++i) {
		dp[i] = min(dp[i], dp[i + 1]);
		if (i < n + m - 1 && kek[i].second != kek[i + 1].second) {
			int prv = i;
			while (prv > 0 && kek[prv - 1].second == kek[i].second) {
				--prv;
			}
			int nxt = i + 1;
			while (nxt < n + m - 1 && kek[nxt + 1].second == kek[i + 1].second) {
				++nxt;
			}
			for (int j = i + 2; j <= nxt + 1; ++j) {
				dp1[j] = INF;
				dp2[j] = INF;
			}
			long long sum = 0;
			for (int j = 0; i + j + 1 <= nxt && i - j >= prv; ++j) {
				sum -= kek[i - j].first;
				sum += kek[i + j + 1].first;
				dp1[i + j + 2] = min(dp1[i + j + 2], dp[i - j] + sum);
				dp2[i + j + 2] = min(dp2[i + j + 2], dp[i - j] + sum);
			}
			if (nxt - i < i - prv + 1) {
				int d = nxt - i;
				for (int j = i - d; j >= prv; --j) {
					sum -= kek[j].first;
					sum += kek[i + 1].first;
					dp2[nxt + 1] = min(dp2[nxt + 1], dp[j] + sum);
				}
			}
			for (int j = i + 2; j + 1 <= nxt + 1; ++j) {
				if (dp1[j] != INF) {
					dp1[j + 1] = min(dp1[j + 1], dp1[j] + kek[j].first - kek[i].first);
				}
			}
			for (int j = nxt + 1; j >= i + 3; --j) {
				if (dp2[j] != INF) {
					dp2[j - 1] = min(dp2[j - 1], dp2[j] - kek[j - 1].first + kek[i + 1].first);
				}
			}
			for (int j = i + 2; j <= nxt + 1; ++j) {
				dp[j] = min(dp[j], dp1[j]);
				dp[j] = min(dp[j], dp2[j]);
				if (j > 0) {
					dp[j - 1] = min(dp[j - 1], dp[j]);
					dp[j - 1] = min(dp[j - 1], dp[j]);
				}
			}
		}
		// for (int j = 0; j <= n + m; ++j) {
		// 	cout << dp[j] << " " << kek[j].second << " ";
		// }
		// cout << endl;

		// bool was = 0;
		// vector<int> r1, b1;
		// for (int j = i; j < n + m; ++j) {
		// 	if (was) {
		// 		if (kek[j].second == kek[i].second) {
		// 			break;
		// 		}
		// 	}
		// 	if (kek[j].second == kek[i].second) {
		// 		r1.push_back(kek[j].first);
		// 	} else {
		// 		was = 1;
		// 		b1.push_back(kek[j].first);
		// 	}
		// 	if (was) {
		// 		long long cost = getcost(r1, b1);
		// 		dp[j + 1] = min(dp[j + 1], dp[i] + cost);
		// 	}
		// }
	}
	return dp[n + m];
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 25 ms 6224 KB Output is correct
4 Correct 22 ms 6256 KB Output is correct
5 Correct 24 ms 6252 KB Output is correct
6 Correct 30 ms 8248 KB Output is correct
7 Correct 40 ms 8232 KB Output is correct
8 Correct 31 ms 8252 KB Output is correct
9 Correct 29 ms 8160 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 50 ms 8404 KB Output is correct
4 Correct 44 ms 8692 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 45 ms 8672 KB Output is correct
19 Correct 45 ms 8676 KB Output is correct
20 Correct 50 ms 8680 KB Output is correct
21 Correct 42 ms 8632 KB Output is correct
22 Correct 49 ms 8676 KB Output is correct
23 Correct 49 ms 8736 KB Output is correct
24 Correct 47 ms 8744 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 39 ms 8180 KB Output is correct
3 Correct 42 ms 9440 KB Output is correct
4 Correct 49 ms 9432 KB Output is correct
5 Correct 42 ms 9500 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 50 ms 9504 KB Output is correct
19 Correct 48 ms 9500 KB Output is correct
20 Correct 51 ms 9436 KB Output is correct
21 Correct 35 ms 9404 KB Output is correct
22 Correct 38 ms 9504 KB Output is correct
23 Correct 33 ms 9504 KB Output is correct
24 Correct 37 ms 9492 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 25 ms 6224 KB Output is correct
20 Correct 22 ms 6256 KB Output is correct
21 Correct 24 ms 6252 KB Output is correct
22 Correct 30 ms 8248 KB Output is correct
23 Correct 40 ms 8232 KB Output is correct
24 Correct 31 ms 8252 KB Output is correct
25 Correct 29 ms 8160 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 50 ms 8404 KB Output is correct
29 Correct 44 ms 8692 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 296 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 300 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 296 KB Output is correct
39 Correct 1 ms 296 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 45 ms 8672 KB Output is correct
44 Correct 45 ms 8676 KB Output is correct
45 Correct 50 ms 8680 KB Output is correct
46 Correct 42 ms 8632 KB Output is correct
47 Correct 49 ms 8676 KB Output is correct
48 Correct 49 ms 8736 KB Output is correct
49 Correct 47 ms 8744 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 39 ms 8180 KB Output is correct
52 Correct 42 ms 9440 KB Output is correct
53 Correct 49 ms 9432 KB Output is correct
54 Correct 42 ms 9500 KB Output is correct
55 Correct 1 ms 296 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 304 KB Output is correct
58 Correct 1 ms 300 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 50 ms 9504 KB Output is correct
68 Correct 48 ms 9500 KB Output is correct
69 Correct 51 ms 9436 KB Output is correct
70 Correct 35 ms 9404 KB Output is correct
71 Correct 38 ms 9504 KB Output is correct
72 Correct 33 ms 9504 KB Output is correct
73 Correct 37 ms 9492 KB Output is correct
74 Correct 45 ms 10172 KB Output is correct
75 Correct 41 ms 9776 KB Output is correct
76 Correct 39 ms 10144 KB Output is correct
77 Correct 39 ms 9596 KB Output is correct
78 Correct 38 ms 9512 KB Output is correct
79 Correct 50 ms 9520 KB Output is correct
80 Correct 36 ms 9532 KB Output is correct
81 Correct 37 ms 9608 KB Output is correct
82 Correct 31 ms 9532 KB Output is correct
83 Correct 32 ms 9760 KB Output is correct
84 Correct 34 ms 10172 KB Output is correct
85 Correct 54 ms 10144 KB Output is correct
86 Correct 36 ms 10148 KB Output is correct
87 Correct 38 ms 10144 KB Output is correct
88 Correct 39 ms 10140 KB Output is correct
89 Correct 34 ms 10152 KB Output is correct
90 Correct 44 ms 10108 KB Output is correct
91 Correct 37 ms 10140 KB Output is correct
92 Correct 43 ms 10144 KB Output is correct
93 Correct 42 ms 10180 KB Output is correct
94 Correct 40 ms 10140 KB Output is correct
95 Correct 45 ms 10136 KB Output is correct
96 Correct 33 ms 10144 KB Output is correct
97 Correct 33 ms 10112 KB Output is correct
98 Correct 35 ms 10184 KB Output is correct
99 Correct 41 ms 10140 KB Output is correct
100 Correct 49 ms 10136 KB Output is correct
101 Correct 36 ms 10172 KB Output is correct
102 Correct 43 ms 10140 KB Output is correct