Submission #416249

# Submission time Handle Problem Language Result Execution time Memory
416249 2021-06-02T08:27:51 Z prvocislo Wiring (IOI17_wiring) C++17
100 / 100
78 ms 11144 KB
#include "wiring.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

const ll inf = 1e18;
long long min_total_length(std::vector<int> r, std::vector<int> b) {
	int n = r.size(), m = b.size();
	vector<pair<ll, int> > rb;
	for (int i = 0; i < n; i++) rb.push_back({r[i], 0});
	for (int i = 0; i < m; i++) rb.push_back({b[i], 1});
	sort(rb.begin(), rb.end());
	vector<vector<ll> > vv;
	for (int i = 0; i < rb.size(); i++)
	{
		if (!i || rb[i-1].second != rb[i].second) vv.push_back({});
		vv.back().push_back(rb[i].first);
	}
	vector<ll> dp(1, 0);
	for (int it = 0; it < vv.size(); it++)
	{
		const vector<ll> &v = vv[it];
		ll nx = (it == vv.size() - 1 ? 1e10 : vv[it + 1][0]), pv = (it ? vv[it - 1].back() : -1e10);
		int siz = v.size();
		dp.resize(siz + 1, inf);
		for (int i = 1; i <= siz; i++) dp[i] = min(dp[i], dp[i - 1] + v[0] - pv); // pridame jednu extra hranu
		vector<ll> nwdp(siz + 1, inf);
		ll sf = 0, pf = 0;
		for (ll i : v) sf += v.back() - i;
		for (int i = 0; i <= siz; i++) // kolko sparujeme s predoslym usekom
		{
			if (i) pf += v[i - 1] - v[0], sf -= v.back() - v[i - 1];
			nwdp[siz - i] = dp[i] + pf + sf + (nx - v.back()) * (siz - i); // vyskusame dlzku prefixu a sufixu
		}
		for (int i = siz; i > 0; i--) nwdp[i - 1] = min(nwdp[i - 1], nwdp[i]); // zahodime jednu hranu
		dp = nwdp;
	}
	return dp[0];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:14:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |  for (int i = 0; i < rb.size(); i++)
      |                  ~~^~~~~~~~~~~
wiring.cpp:20:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |  for (int it = 0; it < vv.size(); it++)
      |                   ~~~^~~~~~~~~~~
wiring.cpp:23:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |   ll nx = (it == vv.size() - 1 ? 1e10 : vv[it + 1][0]), pv = (it ? vv[it - 1].back() : -1e10);
      |            ~~~^~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 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 300 KB Output is correct
7 Correct 1 ms 204 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 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 33 ms 6696 KB Output is correct
4 Correct 32 ms 6712 KB Output is correct
5 Correct 33 ms 7772 KB Output is correct
6 Correct 55 ms 8832 KB Output is correct
7 Correct 43 ms 8872 KB Output is correct
8 Correct 43 ms 8996 KB Output is correct
9 Correct 42 ms 8864 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 69 ms 11140 KB Output is correct
4 Correct 63 ms 10580 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 300 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 300 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 296 KB Output is correct
17 Correct 1 ms 292 KB Output is correct
18 Correct 78 ms 11140 KB Output is correct
19 Correct 68 ms 11144 KB Output is correct
20 Correct 67 ms 11024 KB Output is correct
21 Correct 71 ms 11136 KB Output is correct
22 Correct 67 ms 10896 KB Output is correct
23 Correct 69 ms 10928 KB Output is correct
24 Correct 71 ms 10804 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 50 ms 8340 KB Output is correct
3 Correct 58 ms 9232 KB Output is correct
4 Correct 53 ms 8496 KB Output is correct
5 Correct 59 ms 9232 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 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 0 ms 296 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 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 0 ms 204 KB Output is correct
18 Correct 48 ms 9076 KB Output is correct
19 Correct 64 ms 8076 KB Output is correct
20 Correct 47 ms 8368 KB Output is correct
21 Correct 44 ms 8564 KB Output is correct
22 Correct 47 ms 10288 KB Output is correct
23 Correct 44 ms 9364 KB Output is correct
24 Correct 44 ms 10160 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 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 300 KB Output is correct
7 Correct 1 ms 204 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 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 300 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 33 ms 6696 KB Output is correct
20 Correct 32 ms 6712 KB Output is correct
21 Correct 33 ms 7772 KB Output is correct
22 Correct 55 ms 8832 KB Output is correct
23 Correct 43 ms 8872 KB Output is correct
24 Correct 43 ms 8996 KB Output is correct
25 Correct 42 ms 8864 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 69 ms 11140 KB Output is correct
29 Correct 63 ms 10580 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 292 KB Output is correct
32 Correct 1 ms 296 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 300 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 300 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 1 ms 296 KB Output is correct
42 Correct 1 ms 292 KB Output is correct
43 Correct 78 ms 11140 KB Output is correct
44 Correct 68 ms 11144 KB Output is correct
45 Correct 67 ms 11024 KB Output is correct
46 Correct 71 ms 11136 KB Output is correct
47 Correct 67 ms 10896 KB Output is correct
48 Correct 69 ms 10928 KB Output is correct
49 Correct 71 ms 10804 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 50 ms 8340 KB Output is correct
52 Correct 58 ms 9232 KB Output is correct
53 Correct 53 ms 8496 KB Output is correct
54 Correct 59 ms 9232 KB Output is correct
55 Correct 1 ms 204 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 0 ms 204 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 0 ms 296 KB Output is correct
61 Correct 0 ms 204 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Correct 0 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 0 ms 204 KB Output is correct
67 Correct 48 ms 9076 KB Output is correct
68 Correct 64 ms 8076 KB Output is correct
69 Correct 47 ms 8368 KB Output is correct
70 Correct 44 ms 8564 KB Output is correct
71 Correct 47 ms 10288 KB Output is correct
72 Correct 44 ms 9364 KB Output is correct
73 Correct 44 ms 10160 KB Output is correct
74 Correct 48 ms 10384 KB Output is correct
75 Correct 54 ms 9872 KB Output is correct
76 Correct 51 ms 10004 KB Output is correct
77 Correct 49 ms 9748 KB Output is correct
78 Correct 46 ms 10220 KB Output is correct
79 Correct 48 ms 9676 KB Output is correct
80 Correct 43 ms 9708 KB Output is correct
81 Correct 47 ms 10640 KB Output is correct
82 Correct 47 ms 10032 KB Output is correct
83 Correct 42 ms 10256 KB Output is correct
84 Correct 44 ms 10132 KB Output is correct
85 Correct 51 ms 9884 KB Output is correct
86 Correct 45 ms 11124 KB Output is correct
87 Correct 50 ms 10336 KB Output is correct
88 Correct 51 ms 9880 KB Output is correct
89 Correct 46 ms 10176 KB Output is correct
90 Correct 55 ms 9688 KB Output is correct
91 Correct 44 ms 10004 KB Output is correct
92 Correct 48 ms 10672 KB Output is correct
93 Correct 47 ms 10008 KB Output is correct
94 Correct 48 ms 10896 KB Output is correct
95 Correct 49 ms 9776 KB Output is correct
96 Correct 45 ms 10548 KB Output is correct
97 Correct 47 ms 10640 KB Output is correct
98 Correct 47 ms 10796 KB Output is correct
99 Correct 47 ms 10800 KB Output is correct
100 Correct 51 ms 10256 KB Output is correct
101 Correct 47 ms 10392 KB Output is correct
102 Correct 53 ms 10260 KB Output is correct