oj.uz

Submission #332572

# Submission time Handle Problem Language Result Execution time Memory
332572 2020-12-02T21:57:23 Z MetB Wiring (IOI17_wiring) C++14
100 / 100
 63 ms 14296 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace __gnu_pbds;
 
 
using namespace std;
 
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
 
const int N = 2000001;
const ll INF = 1e18, MOD = 1e9 + 7, MOD2 = 1e6 + 3;

ll d[N];

void process(vector<ll>& fst, vector<ll>& snd, ll from) {
	if(fst.empty()) return;

	vector<ll> dleft(fst.size() + snd.size() + 1, INF);
	vector<ll> dright(fst.size() + snd.size() + 1, INF);

	from -= (ll)fst.size() + (ll)snd.size();
	
	ll dist = snd[0] - fst.back();
	ll sum_len = 0, sz = 0;

	for (ll i = fst.size(); i >= 0; i--) {
		ll last = (i + from ? d[i + from - 1] : 0);

		if (i != fst.size()) sum_len += fst.back() - fst[i];

		dleft[sz] = last + sum_len;
		dright[sz] = last + sum_len + sz * dist;
		sz++;
	}

	for (ll i = 1; i <= max(fst.size(), snd.size()); i++) {
		dleft[i] = min(dleft[i-1], dleft[i]);
	}

	for (ll i = max(fst.size(), snd.size()) - 1; i >= 0; i--) {
		dright[i] = min(dright[i+1], dright[i]);
	}

	sum_len = 0;

	from += (ll)fst.size();
	for (ll i = 0; i < snd.size(); i++) {
		sum_len += snd[i] - snd[0];
		d[i + from] = sum_len;
		d[i + from] += min(dright[i+1], dleft[i+1] + (i + 1) * dist);
	}
}

ll min_total_length(vector<int> r, vector<int> b) {
	auto pr = r.begin(), pb = b.begin();

	ll n = r.size() + b.size();

	fill(d, d + n, INF);

	struct point {
		ll x;
		char color;

		bool operator<(point b) {
			return x < b.x;
		}
	};

	vector<point> v;
	vector<ll> red, blue;

	for (ll a : r) {
		v.push_back({a, 'r'});
	}

	for (ll a : b) {
		v.push_back({a, 'b'});
	}

	sort(v.begin(), v.end());

	for (ll i = 0; i < n; i++) {
		if (i && v[i-1].color != v[i].color) {
			if (v[i].color == 'r') {
				process(red, blue, i);
				red.clear();
			}
			else {
				process(blue, red, i);
				blue.clear();
			}
		}

		if (v[i].color == 'r') red.push_back(v[i].x);
		else blue.push_back(v[i].x);
	}

	if(v.back().color == 'r') process(blue, red, n);
	else process(red, blue, n);

	return d[v.size() - 1];
}

/*int main () {
	ll sr, sb;
	cin >> sr >> sb;

	vector<int> r, b;

	for (ll i = 0; i < sr; i++) {
		ll x;
		cin >> x;
		r.push_back(x);
	}

	for (ll i = 0; i < sb; i++) {
		ll x;
		cin >> x;
		b.push_back(x);
	}

	cout << min_total_length(r, b);
}*/

Compilation message

wiring.cpp: In function 'void process(std::vector<long long int>&, std::vector<long long int>&, ll)':
wiring.cpp:32:9: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |   if (i != fst.size()) sum_len += fst.back() - fst[i];
      |       ~~^~~~~~~~~~~~~
wiring.cpp:39:19: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'const long unsigned int' [-Wsign-compare]
   39 |  for (ll i = 1; i <= max(fst.size(), snd.size()); i++) {
      |                 ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
wiring.cpp:50:19: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |  for (ll i = 0; i < snd.size(); i++) {
      |                 ~~^~~~~~~~~~~~
wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:58:7: warning: variable 'pr' set but not used [-Wunused-but-set-variable]
   58 |  auto pr = r.begin(), pb = b.begin();
      |       ^~
wiring.cpp:58:23: warning: variable 'pb' set but not used [-Wunused-but-set-variable]
   58 |  auto pr = r.begin(), pb = b.begin();
      |                       ^~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 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 384 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 34 ms 10732 KB Output is correct
4 Correct 35 ms 10584 KB Output is correct
5 Correct 33 ms 10988 KB Output is correct
6 Correct 44 ms 14296 KB Output is correct
7 Correct 44 ms 14296 KB Output is correct
8 Correct 44 ms 14296 KB Output is correct
9 Correct 45 ms 14296 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 56 ms 7644 KB Output is correct
4 Correct 57 ms 9308 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 364 KB Output is correct
18 Correct 59 ms 9564 KB Output is correct
19 Correct 57 ms 9564 KB Output is correct
20 Correct 58 ms 9692 KB Output is correct
21 Correct 57 ms 9564 KB Output is correct
22 Correct 56 ms 9564 KB Output is correct
23 Correct 58 ms 9564 KB Output is correct
24 Correct 60 ms 9576 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 49 ms 7644 KB Output is correct
3 Correct 51 ms 8924 KB Output is correct
4 Correct 54 ms 8944 KB Output is correct
5 Correct 51 ms 8924 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 512 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 51 ms 10200 KB Output is correct
19 Correct 56 ms 8924 KB Output is correct
20 Correct 48 ms 8924 KB Output is correct
21 Correct 46 ms 8924 KB Output is correct
22 Correct 51 ms 12120 KB Output is correct
23 Correct 43 ms 11992 KB Output is correct
24 Correct 46 ms 12128 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 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 384 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 384 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 34 ms 10732 KB Output is correct
20 Correct 35 ms 10584 KB Output is correct
21 Correct 33 ms 10988 KB Output is correct
22 Correct 44 ms 14296 KB Output is correct
23 Correct 44 ms 14296 KB Output is correct
24 Correct 44 ms 14296 KB Output is correct
25 Correct 45 ms 14296 KB Output is correct
26 Correct 0 ms 364 KB Output is correct
27 Correct 0 ms 364 KB Output is correct
28 Correct 56 ms 7644 KB Output is correct
29 Correct 57 ms 9308 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 364 KB Output is correct
43 Correct 59 ms 9564 KB Output is correct
44 Correct 57 ms 9564 KB Output is correct
45 Correct 58 ms 9692 KB Output is correct
46 Correct 57 ms 9564 KB Output is correct
47 Correct 56 ms 9564 KB Output is correct
48 Correct 58 ms 9564 KB Output is correct
49 Correct 60 ms 9576 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 49 ms 7644 KB Output is correct
52 Correct 51 ms 8924 KB Output is correct
53 Correct 54 ms 8944 KB Output is correct
54 Correct 51 ms 8924 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 512 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 51 ms 10200 KB Output is correct
68 Correct 56 ms 8924 KB Output is correct
69 Correct 48 ms 8924 KB Output is correct
70 Correct 46 ms 8924 KB Output is correct
71 Correct 51 ms 12120 KB Output is correct
72 Correct 43 ms 11992 KB Output is correct
73 Correct 46 ms 12128 KB Output is correct
74 Correct 46 ms 13400 KB Output is correct
75 Correct 55 ms 10328 KB Output is correct
76 Correct 55 ms 11480 KB Output is correct
77 Correct 52 ms 11352 KB Output is correct
78 Correct 49 ms 11864 KB Output is correct
79 Correct 53 ms 11220 KB Output is correct
80 Correct 46 ms 11352 KB Output is correct
81 Correct 51 ms 11736 KB Output is correct
82 Correct 44 ms 12120 KB Output is correct
83 Correct 44 ms 11736 KB Output is correct
84 Correct 47 ms 12504 KB Output is correct
85 Correct 55 ms 11352 KB Output is correct
86 Correct 47 ms 12760 KB Output is correct
87 Correct 50 ms 12132 KB Output is correct
88 Correct 52 ms 11352 KB Output is correct
89 Correct 49 ms 11864 KB Output is correct
90 Correct 57 ms 11628 KB Output is correct
91 Correct 47 ms 12504 KB Output is correct
92 Correct 51 ms 12248 KB Output is correct
93 Correct 49 ms 12120 KB Output is correct
94 Correct 52 ms 13144 KB Output is correct
95 Correct 54 ms 11992 KB Output is correct
96 Correct 46 ms 12376 KB Output is correct
97 Correct 47 ms 13784 KB Output is correct
98 Correct 51 ms 13272 KB Output is correct
99 Correct 51 ms 13144 KB Output is correct
100 Correct 56 ms 11864 KB Output is correct
101 Correct 50 ms 13400 KB Output is correct
102 Correct 63 ms 11608 KB Output is correct