oj.uz

Submission #166537

# Submission time Handle Problem Language Result Execution time Memory
166537 2019-12-02T17:47:29 Z Eae02 Wiring (IOI17_wiring) C++14
100 / 100
 78 ms 16504 KB 
#include "wiring.h"

#include <bits/stdc++.h>
#define all(x) begin(x),end(x)
using namespace std;
using ll = long long;

vector<pair<ll, bool>> nodes;

vector<ll> prevDiff, nextDiff;
vector<ll> costToNext, costToPrev;
vector<ll> dp;

ll min_total_length(std::vector<int> r, std::vector<int> b) {
	for (int x : r)
		nodes.emplace_back(x, true);
	for (int x : b)
		nodes.emplace_back(x, false);
	
	sort(all(nodes));
	
	prevDiff.resize(nodes.size(), -1);
	costToPrev.resize(nodes.size(), 0);
	for (ll i = 1; i < nodes.size(); i++) {
		if (nodes[i].second == nodes[i - 1].second) {
			prevDiff[i] = prevDiff[i - 1];
			if (prevDiff[i] != -1) {
				costToPrev[i] = costToPrev[i - 1] + nodes[i].first - nodes[prevDiff[i] + 1].first;
			}
		} else {
			prevDiff[i] = i - 1;
			costToPrev[i] = 0;
		}
	}
	
	nextDiff.resize(nodes.size() + 1, nodes.size());
	costToNext.resize(nodes.size());
	for (ll i = nodes.size() - 2; i >= 0; i--) {
		if (nodes[i].second == nodes[i + 1].second) {
			nextDiff[i] = nextDiff[i + 1];
			if (nextDiff[i] != nodes.size()) {
				costToNext[i] = costToNext[i + 1] + nodes[nextDiff[i]].first - nodes[i].first;
			}
		} else {
			nextDiff[i] = i + 1;
			costToNext[i] = nodes[i + 1].first - nodes[i].first;
		}
	}
	
	//for (ll x : costToNext)
	//	cout << x << " ";
	//cout << "\n";
	
	dp.resize(nodes.size() + 1, 0);
	vector<ll> bestAnsR(nodes.size());
	for (ll i = nodes.size() - 1; i >= 0; i--) {
		dp[i] = LLONG_MAX;
		
		if (nextDiff[i] != nodes.size()) { // match right
			ll dstToNext = nextDiff[i] - i;
			ll ilen = min(nextDiff[nextDiff[i]] - nextDiff[i], dstToNext);
			dp[i] = costToNext[i] + bestAnsR[nextDiff[i] + ilen - 1];
		}
		
		if (prevDiff[i] != -1) { // match left
			dp[i] = min(dp[i], dp[i + 1] + nodes[i].first - nodes[prevDiff[i]].first);
		}
		
		bestAnsR[i] = costToPrev[i] + dp[i + 1];
		if (i != 0 && nodes[i - 1].second != nodes[i].second) {
			for (ll r = i + 1; r < nextDiff[i]; r++) {
				bestAnsR[r] = min(bestAnsR[r - 1], bestAnsR[r]);
			}
		}
	}
	
	return dp[0];
}

Compilation message

wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:24:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (ll i = 1; i < nodes.size(); i++) {
                 ~~^~~~~~~~~~~~~~
wiring.cpp:41:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (nextDiff[i] != nodes.size()) {
wiring.cpp:59:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (nextDiff[i] != nodes.size()) { // match right

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 464 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 400 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 44 ms 10976 KB Output is correct
4 Correct 43 ms 11160 KB Output is correct
5 Correct 43 ms 11104 KB Output is correct
6 Correct 58 ms 14816 KB Output is correct
7 Correct 56 ms 14688 KB Output is correct
8 Correct 56 ms 14736 KB Output is correct
9 Correct 57 ms 14560 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 76 ms 14848 KB Output is correct
4 Correct 76 ms 14944 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 75 ms 14944 KB Output is correct
19 Correct 74 ms 14816 KB Output is correct
20 Correct 77 ms 14820 KB Output is correct
21 Correct 73 ms 14688 KB Output is correct
22 Correct 74 ms 14816 KB Output is correct
23 Correct 75 ms 14816 KB Output is correct
24 Correct 73 ms 14816 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 62 ms 14816 KB Output is correct
3 Correct 66 ms 15680 KB Output is correct
4 Correct 69 ms 15712 KB Output is correct
5 Correct 72 ms 15684 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 3 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 380 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 61 ms 15712 KB Output is correct
19 Correct 68 ms 15712 KB Output is correct
20 Correct 62 ms 15716 KB Output is correct
21 Correct 58 ms 15712 KB Output is correct
22 Correct 61 ms 15744 KB Output is correct
23 Correct 57 ms 15712 KB Output is correct
24 Correct 55 ms 15712 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 464 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 400 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 44 ms 10976 KB Output is correct
20 Correct 43 ms 11160 KB Output is correct
21 Correct 43 ms 11104 KB Output is correct
22 Correct 58 ms 14816 KB Output is correct
23 Correct 56 ms 14688 KB Output is correct
24 Correct 56 ms 14736 KB Output is correct
25 Correct 57 ms 14560 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 76 ms 14848 KB Output is correct
29 Correct 76 ms 14944 KB Output is correct
30 Correct 3 ms 256 KB Output is correct
31 Correct 2 ms 256 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 256 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 2 ms 256 KB Output is correct
38 Correct 2 ms 256 KB Output is correct
39 Correct 2 ms 256 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 256 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 75 ms 14944 KB Output is correct
44 Correct 74 ms 14816 KB Output is correct
45 Correct 77 ms 14820 KB Output is correct
46 Correct 73 ms 14688 KB Output is correct
47 Correct 74 ms 14816 KB Output is correct
48 Correct 75 ms 14816 KB Output is correct
49 Correct 73 ms 14816 KB Output is correct
50 Correct 2 ms 256 KB Output is correct
51 Correct 62 ms 14816 KB Output is correct
52 Correct 66 ms 15680 KB Output is correct
53 Correct 69 ms 15712 KB Output is correct
54 Correct 72 ms 15684 KB Output is correct
55 Correct 2 ms 376 KB Output is correct
56 Correct 2 ms 256 KB Output is correct
57 Correct 2 ms 376 KB Output is correct
58 Correct 2 ms 256 KB Output is correct
59 Correct 2 ms 376 KB Output is correct
60 Correct 2 ms 256 KB Output is correct
61 Correct 3 ms 256 KB Output is correct
62 Correct 2 ms 376 KB Output is correct
63 Correct 2 ms 380 KB Output is correct
64 Correct 2 ms 376 KB Output is correct
65 Correct 2 ms 380 KB Output is correct
66 Correct 2 ms 376 KB Output is correct
67 Correct 61 ms 15712 KB Output is correct
68 Correct 68 ms 15712 KB Output is correct
69 Correct 62 ms 15716 KB Output is correct
70 Correct 58 ms 15712 KB Output is correct
71 Correct 61 ms 15744 KB Output is correct
72 Correct 57 ms 15712 KB Output is correct
73 Correct 55 ms 15712 KB Output is correct
74 Correct 60 ms 16504 KB Output is correct
75 Correct 78 ms 15968 KB Output is correct
76 Correct 68 ms 16480 KB Output is correct
77 Correct 63 ms 15864 KB Output is correct
78 Correct 60 ms 15840 KB Output is correct
79 Correct 63 ms 15812 KB Output is correct
80 Correct 55 ms 15712 KB Output is correct
81 Correct 63 ms 15872 KB Output is correct
82 Correct 55 ms 15840 KB Output is correct
83 Correct 53 ms 16124 KB Output is correct
84 Correct 57 ms 16352 KB Output is correct
85 Correct 69 ms 16356 KB Output is correct
86 Correct 61 ms 16348 KB Output is correct
87 Correct 63 ms 16352 KB Output is correct
88 Correct 64 ms 16344 KB Output is correct
89 Correct 65 ms 16356 KB Output is correct
90 Correct 72 ms 16344 KB Output is correct
91 Correct 61 ms 16352 KB Output is correct
92 Correct 75 ms 16352 KB Output is correct
93 Correct 62 ms 16344 KB Output is correct
94 Correct 68 ms 16492 KB Output is correct
95 Correct 78 ms 16372 KB Output is correct
96 Correct 59 ms 16352 KB Output is correct
97 Correct 59 ms 16352 KB Output is correct
98 Correct 66 ms 16352 KB Output is correct
99 Correct 63 ms 16380 KB Output is correct
100 Correct 69 ms 16348 KB Output is correct
101 Correct 71 ms 16444 KB Output is correct
102 Correct 72 ms 16348 KB Output is correct