oj.uz

Submission #66689

# Submission time Handle Problem Language Result Execution time Memory
66689 2018-08-12T04:59:13 Z kingpig9 Wiring (IOI17_wiring) C++11
100 / 100
 86 ms 75016 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2e5 + 10;
const ll INF = LLONG_MAX / 100;

#define debug(...) fprintf(stderr, __VA_ARGS__)
//#define debug(...)
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define fillchar(a, s) memset((a), (s), sizeof(a))

void setmin (ll &a, ll b) {
	if (a > b) {
		a = b;
	}
}

int N;
pll A[MAXN];
ll X[MAXN];
ll psum[MAXN];
ll dp[MAXN];

ll min_total_length (vector<int> rrr, vector<int> bbb) {
	for (int i = 0; i < rrr.size(); i++) {
		A[++N] = pii(rrr[i], 0);
	}
	for (int i = 0; i < bbb.size(); i++) {
		A[++N] = pii(bbb[i], 1);
	}
	sort(A + 1, A + N + 1);

	vector<int> bounds;
	for (int i = 1; i <= N; ) {
		bounds.push_back(i);
		int j = i;
		while (j <= N && A[i].se == A[j].se) {
			X[j] = A[j].fi;
			psum[j] = psum[j - 1] + X[j];
			j++;
		}
		i = j;
	}
	bounds.push_back(N + 1);

	for (int i = 1; i < bounds[1]; i++) {
		dp[i] = dp[i - 1] + (X[bounds[1]] - X[i]);
	}

	for (int b = 1; b + 1 < bounds.size(); b++) {
		int ltprv = bounds[b - 1], rtprv = bounds[b] - 1;
		int ltcur = bounds[b], rtcur = bounds[b + 1] - 1;
		int plen = rtprv - ltprv + 1;

		for (int i = ltcur; i <= rtcur; i++) {
			//need i to be matched (as well as the previous ones)
			//so 3 cases: i is matched as a group with the previous ones in the group
			//or i is matched with the largest one before
			//or i is matched with the smallest one after
			dp[i] = INF;
			int pos = i - ltcur + 1;
			if (pos <= plen) {
				setmin(dp[i], dp[rtprv - pos] + (psum[i] - psum[rtprv]) - (psum[rtprv] - psum[rtprv - pos]));
			}

			setmin(dp[i], dp[i - 1] + (X[i] - X[rtprv]));
			if (b + 2 < bounds.size()) {
				setmin(dp[i], dp[i - 1] + (X[rtcur + 1] - X[i]));
			}
		}
	}
	return dp[N];
}

Compilation message

wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:31:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < rrr.size(); i++) {
                  ~~^~~~~~~~~~~~
wiring.cpp:34:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < bbb.size(); i++) {
                  ~~^~~~~~~~~~~~
wiring.cpp:56:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int b = 1; b + 1 < bounds.size(); b++) {
                  ~~~~~~^~~~~~~~~~~~~~~
wiring.cpp:73:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (b + 2 < bounds.size()) {
        ~~~~~~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 692 KB Output is correct
2 Correct 2 ms 692 KB Output is correct
3 Correct 63 ms 7624 KB Output is correct
4 Correct 37 ms 7624 KB Output is correct
5 Correct 38 ms 7676 KB Output is correct
6 Correct 45 ms 9980 KB Output is correct
7 Correct 45 ms 9980 KB Output is correct
8 Correct 46 ms 9980 KB Output is correct
9 Correct 45 ms 10000 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10000 KB Output is correct
2 Correct 3 ms 10000 KB Output is correct
3 Correct 77 ms 10360 KB Output is correct
4 Correct 66 ms 10360 KB Output is correct
5 Correct 3 ms 10360 KB Output is correct
6 Correct 2 ms 10360 KB Output is correct
7 Correct 2 ms 10360 KB Output is correct
8 Correct 3 ms 10360 KB Output is correct
9 Correct 2 ms 10360 KB Output is correct
10 Correct 2 ms 10360 KB Output is correct
11 Correct 2 ms 10360 KB Output is correct
12 Correct 3 ms 10360 KB Output is correct
13 Correct 2 ms 10360 KB Output is correct
14 Correct 3 ms 10360 KB Output is correct
15 Correct 3 ms 10360 KB Output is correct
16 Correct 3 ms 10360 KB Output is correct
17 Correct 2 ms 10360 KB Output is correct
18 Correct 72 ms 10360 KB Output is correct
19 Correct 78 ms 10360 KB Output is correct
20 Correct 74 ms 10360 KB Output is correct
21 Correct 73 ms 10396 KB Output is correct
22 Correct 65 ms 10396 KB Output is correct
23 Correct 84 ms 10396 KB Output is correct
24 Correct 73 ms 10396 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10396 KB Output is correct
2 Correct 59 ms 10396 KB Output is correct
3 Correct 69 ms 11460 KB Output is correct
4 Correct 69 ms 12536 KB Output is correct
5 Correct 86 ms 14020 KB Output is correct
6 Correct 3 ms 14020 KB Output is correct
7 Correct 3 ms 14020 KB Output is correct
8 Correct 2 ms 14020 KB Output is correct
9 Correct 2 ms 14020 KB Output is correct
10 Correct 2 ms 14020 KB Output is correct
11 Correct 2 ms 14020 KB Output is correct
12 Correct 2 ms 14020 KB Output is correct
13 Correct 2 ms 14020 KB Output is correct
14 Correct 2 ms 14020 KB Output is correct
15 Correct 3 ms 14020 KB Output is correct
16 Correct 3 ms 14020 KB Output is correct
17 Correct 2 ms 14020 KB Output is correct
18 Correct 58 ms 15200 KB Output is correct
19 Correct 69 ms 16488 KB Output is correct
20 Correct 62 ms 17740 KB Output is correct
21 Correct 52 ms 19000 KB Output is correct
22 Correct 58 ms 20260 KB Output is correct
23 Correct 50 ms 21528 KB Output is correct
24 Correct 78 ms 22780 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 564 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 2 ms 672 KB Output is correct
6 Correct 2 ms 672 KB Output is correct
7 Correct 2 ms 672 KB Output is correct
8 Correct 2 ms 672 KB Output is correct
9 Correct 2 ms 672 KB Output is correct
10 Correct 2 ms 672 KB Output is correct
11 Correct 2 ms 672 KB Output is correct
12 Correct 3 ms 692 KB Output is correct
13 Correct 2 ms 692 KB Output is correct
14 Correct 2 ms 692 KB Output is correct
15 Correct 2 ms 692 KB Output is correct
16 Correct 2 ms 692 KB Output is correct
17 Correct 2 ms 692 KB Output is correct
18 Correct 2 ms 692 KB Output is correct
19 Correct 63 ms 7624 KB Output is correct
20 Correct 37 ms 7624 KB Output is correct
21 Correct 38 ms 7676 KB Output is correct
22 Correct 45 ms 9980 KB Output is correct
23 Correct 45 ms 9980 KB Output is correct
24 Correct 46 ms 9980 KB Output is correct
25 Correct 45 ms 10000 KB Output is correct
26 Correct 2 ms 10000 KB Output is correct
27 Correct 3 ms 10000 KB Output is correct
28 Correct 77 ms 10360 KB Output is correct
29 Correct 66 ms 10360 KB Output is correct
30 Correct 3 ms 10360 KB Output is correct
31 Correct 2 ms 10360 KB Output is correct
32 Correct 2 ms 10360 KB Output is correct
33 Correct 3 ms 10360 KB Output is correct
34 Correct 2 ms 10360 KB Output is correct
35 Correct 2 ms 10360 KB Output is correct
36 Correct 2 ms 10360 KB Output is correct
37 Correct 3 ms 10360 KB Output is correct
38 Correct 2 ms 10360 KB Output is correct
39 Correct 3 ms 10360 KB Output is correct
40 Correct 3 ms 10360 KB Output is correct
41 Correct 3 ms 10360 KB Output is correct
42 Correct 2 ms 10360 KB Output is correct
43 Correct 72 ms 10360 KB Output is correct
44 Correct 78 ms 10360 KB Output is correct
45 Correct 74 ms 10360 KB Output is correct
46 Correct 73 ms 10396 KB Output is correct
47 Correct 65 ms 10396 KB Output is correct
48 Correct 84 ms 10396 KB Output is correct
49 Correct 73 ms 10396 KB Output is correct
50 Correct 3 ms 10396 KB Output is correct
51 Correct 59 ms 10396 KB Output is correct
52 Correct 69 ms 11460 KB Output is correct
53 Correct 69 ms 12536 KB Output is correct
54 Correct 86 ms 14020 KB Output is correct
55 Correct 3 ms 14020 KB Output is correct
56 Correct 3 ms 14020 KB Output is correct
57 Correct 2 ms 14020 KB Output is correct
58 Correct 2 ms 14020 KB Output is correct
59 Correct 2 ms 14020 KB Output is correct
60 Correct 2 ms 14020 KB Output is correct
61 Correct 2 ms 14020 KB Output is correct
62 Correct 2 ms 14020 KB Output is correct
63 Correct 2 ms 14020 KB Output is correct
64 Correct 3 ms 14020 KB Output is correct
65 Correct 3 ms 14020 KB Output is correct
66 Correct 2 ms 14020 KB Output is correct
67 Correct 58 ms 15200 KB Output is correct
68 Correct 69 ms 16488 KB Output is correct
69 Correct 62 ms 17740 KB Output is correct
70 Correct 52 ms 19000 KB Output is correct
71 Correct 58 ms 20260 KB Output is correct
72 Correct 50 ms 21528 KB Output is correct
73 Correct 78 ms 22780 KB Output is correct
74 Correct 61 ms 24680 KB Output is correct
75 Correct 58 ms 26228 KB Output is correct
76 Correct 69 ms 28236 KB Output is correct
77 Correct 62 ms 29648 KB Output is correct
78 Correct 52 ms 30924 KB Output is correct
79 Correct 54 ms 32400 KB Output is correct
80 Correct 50 ms 33636 KB Output is correct
81 Correct 57 ms 35112 KB Output is correct
82 Correct 48 ms 36560 KB Output is correct
83 Correct 43 ms 38092 KB Output is correct
84 Correct 69 ms 40048 KB Output is correct
85 Correct 66 ms 41968 KB Output is correct
86 Correct 58 ms 44040 KB Output is correct
87 Correct 62 ms 45840 KB Output is correct
88 Correct 62 ms 47920 KB Output is correct
89 Correct 61 ms 49744 KB Output is correct
90 Correct 65 ms 51672 KB Output is correct
91 Correct 59 ms 53664 KB Output is correct
92 Correct 63 ms 55528 KB Output is correct
93 Correct 61 ms 57500 KB Output is correct
94 Correct 63 ms 59432 KB Output is correct
95 Correct 59 ms 61364 KB Output is correct
96 Correct 50 ms 63312 KB Output is correct
97 Correct 58 ms 65240 KB Output is correct
98 Correct 64 ms 67176 KB Output is correct
99 Correct 54 ms 69164 KB Output is correct
100 Correct 60 ms 71148 KB Output is correct
101 Correct 64 ms 73116 KB Output is correct
102 Correct 62 ms 75016 KB Output is correct