Submission #59357

# Submission time Handle Problem Language Result Execution time Memory
59357 2018-07-21T18:48:49 Z ekrem Wiring (IOI17_wiring) C++
100 / 100
119 ms 75236 KB
#include <bits/stdc++.h>
#include "wiring.h"
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define inf 1000000000000007
#define N 1000005
using namespace std;
typedef long long ll;
typedef vector < ll > vi;
typedef pair < ll , ll > ii;

ll n, m, l1, r1, l2, r2, pre[N];
ii a[N], b[N];
ll dp[N];

ll f(int n, int m){
	ll &r = dp[n];
	if(r != -1)
		return r;
	return r;
}

ll min_total_length(vector < int > r, vector < int > bb) {
	for(int i = 0; i < r.size(); i++)a[++n] = mp(r[i], 1);
	for(int i = 0; i < bb.size(); i++)a[++n] = mp(bb[i], 0);
	sort(a + 1, a + n + 1);

	for(int i = 1; i <= n; i++)
		pre[i] = pre[i - 1] + a[i].st;

	for(int i = 1; i <= n; i++){
		int j = i + 1;
		while(j <= n and a[j].nd == a[j - 1].nd)
			j++;
		b[++m] = mp(i, j - 1);
		// cout << i << " " << j - 1 << endl;
		i = j - 1;
	}

	if(m == 1)return 0;

	for(ll i = 1; i <= b[1].nd; i++)
		dp[i] = i*a[b[2].st].st - pre[i];

	for(ll j = 2; j <= m; j++){
		l1 = b[j - 1].st;
		r1 = b[j - 1].nd;
		l2 = b[j].st;
		r2 = b[j].nd;
		for(ll i = l2; i <= r2; i++){
			dp[i] = inf;
			if(i - l2 + 1 <= r1 - l1 + 1){
				dp[i] = dp[r1 - (i - l2 + 1)] + (pre[i] - pre[l2 - 1]) - (pre[r1] - pre[r1 - (i - l2 + 1)]);
			}
			if(j + 1 <= m)
				dp[i] = min(dp[i], dp[i - 1] + (a[b[j + 1].st].st - a[i].st));
			dp[i] = min(dp[i], dp[i - 1] + (a[i].st - a[b[j - 1].nd].st));
				// cout << i << " " << dp[i] << endl;
		}
	}

	return dp[n];
}


// int main() {
// 	freopen("in.txt", "r", stdin);
// 	freopen("out.txt", "w", stdout);
// 	int n, m;
// 	assert(2 == scanf("%d %d", &n, &m));
// 	vector<int> r(n), b(m);
// 	for(int i = 0; i < n; i++)
// 		assert(1 == scanf("%d", &r[i]));
// 	for(int i = 0; i < m; i++)
// 		assert(1 == scanf("%d", &b[i]));

// 	ll res = min_total_length(r, b);
// 	printf("%lld\n", res);

// 	return 0;
// }

Compilation message

wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:26:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < r.size(); i++)a[++n] = mp(r[i], 1);
                 ~~^~~~~~~~~~
wiring.cpp:27:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < bb.size(); i++)a[++n] = mp(bb[i], 0);
                 ~~^~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 528 KB Output is correct
5 Correct 2 ms 568 KB Output is correct
6 Correct 2 ms 584 KB Output is correct
7 Correct 3 ms 588 KB Output is correct
8 Correct 3 ms 592 KB Output is correct
9 Correct 3 ms 628 KB Output is correct
10 Correct 2 ms 636 KB Output is correct
11 Correct 3 ms 636 KB Output is correct
12 Correct 2 ms 664 KB Output is correct
13 Correct 3 ms 664 KB Output is correct
14 Correct 3 ms 664 KB Output is correct
15 Correct 2 ms 676 KB Output is correct
16 Correct 2 ms 772 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 772 KB Output is correct
2 Correct 3 ms 772 KB Output is correct
3 Correct 60 ms 7988 KB Output is correct
4 Correct 39 ms 9440 KB Output is correct
5 Correct 40 ms 10948 KB Output is correct
6 Correct 48 ms 14776 KB Output is correct
7 Correct 68 ms 16708 KB Output is correct
8 Correct 59 ms 18640 KB Output is correct
9 Correct 58 ms 20572 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 20572 KB Output is correct
2 Correct 3 ms 20572 KB Output is correct
3 Correct 119 ms 23424 KB Output is correct
4 Correct 90 ms 24700 KB Output is correct
5 Correct 3 ms 24700 KB Output is correct
6 Correct 3 ms 24700 KB Output is correct
7 Correct 3 ms 24700 KB Output is correct
8 Correct 2 ms 24700 KB Output is correct
9 Correct 3 ms 24700 KB Output is correct
10 Correct 2 ms 24700 KB Output is correct
11 Correct 3 ms 24700 KB Output is correct
12 Correct 3 ms 24700 KB Output is correct
13 Correct 2 ms 24700 KB Output is correct
14 Correct 3 ms 24700 KB Output is correct
15 Correct 3 ms 24700 KB Output is correct
16 Correct 3 ms 24700 KB Output is correct
17 Correct 3 ms 24700 KB Output is correct
18 Correct 83 ms 26992 KB Output is correct
19 Correct 94 ms 28904 KB Output is correct
20 Correct 77 ms 30468 KB Output is correct
21 Correct 94 ms 32784 KB Output is correct
22 Correct 105 ms 34588 KB Output is correct
23 Correct 79 ms 36516 KB Output is correct
24 Correct 71 ms 38452 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 38452 KB Output is correct
2 Correct 65 ms 38952 KB Output is correct
3 Correct 60 ms 40492 KB Output is correct
4 Correct 61 ms 41496 KB Output is correct
5 Correct 59 ms 43012 KB Output is correct
6 Correct 2 ms 43012 KB Output is correct
7 Correct 2 ms 43012 KB Output is correct
8 Correct 2 ms 43012 KB Output is correct
9 Correct 2 ms 43012 KB Output is correct
10 Correct 2 ms 43012 KB Output is correct
11 Correct 3 ms 43012 KB Output is correct
12 Correct 1 ms 43012 KB Output is correct
13 Correct 3 ms 43012 KB Output is correct
14 Correct 2 ms 43012 KB Output is correct
15 Correct 3 ms 43012 KB Output is correct
16 Correct 2 ms 43012 KB Output is correct
17 Correct 3 ms 43012 KB Output is correct
18 Correct 59 ms 44196 KB Output is correct
19 Correct 69 ms 45456 KB Output is correct
20 Correct 55 ms 46588 KB Output is correct
21 Correct 53 ms 47796 KB Output is correct
22 Correct 57 ms 49112 KB Output is correct
23 Correct 67 ms 50368 KB Output is correct
24 Correct 62 ms 51588 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 528 KB Output is correct
5 Correct 2 ms 568 KB Output is correct
6 Correct 2 ms 584 KB Output is correct
7 Correct 3 ms 588 KB Output is correct
8 Correct 3 ms 592 KB Output is correct
9 Correct 3 ms 628 KB Output is correct
10 Correct 2 ms 636 KB Output is correct
11 Correct 3 ms 636 KB Output is correct
12 Correct 2 ms 664 KB Output is correct
13 Correct 3 ms 664 KB Output is correct
14 Correct 3 ms 664 KB Output is correct
15 Correct 2 ms 676 KB Output is correct
16 Correct 2 ms 772 KB Output is correct
17 Correct 4 ms 772 KB Output is correct
18 Correct 3 ms 772 KB Output is correct
19 Correct 60 ms 7988 KB Output is correct
20 Correct 39 ms 9440 KB Output is correct
21 Correct 40 ms 10948 KB Output is correct
22 Correct 48 ms 14776 KB Output is correct
23 Correct 68 ms 16708 KB Output is correct
24 Correct 59 ms 18640 KB Output is correct
25 Correct 58 ms 20572 KB Output is correct
26 Correct 3 ms 20572 KB Output is correct
27 Correct 3 ms 20572 KB Output is correct
28 Correct 119 ms 23424 KB Output is correct
29 Correct 90 ms 24700 KB Output is correct
30 Correct 3 ms 24700 KB Output is correct
31 Correct 3 ms 24700 KB Output is correct
32 Correct 3 ms 24700 KB Output is correct
33 Correct 2 ms 24700 KB Output is correct
34 Correct 3 ms 24700 KB Output is correct
35 Correct 2 ms 24700 KB Output is correct
36 Correct 3 ms 24700 KB Output is correct
37 Correct 3 ms 24700 KB Output is correct
38 Correct 2 ms 24700 KB Output is correct
39 Correct 3 ms 24700 KB Output is correct
40 Correct 3 ms 24700 KB Output is correct
41 Correct 3 ms 24700 KB Output is correct
42 Correct 3 ms 24700 KB Output is correct
43 Correct 83 ms 26992 KB Output is correct
44 Correct 94 ms 28904 KB Output is correct
45 Correct 77 ms 30468 KB Output is correct
46 Correct 94 ms 32784 KB Output is correct
47 Correct 105 ms 34588 KB Output is correct
48 Correct 79 ms 36516 KB Output is correct
49 Correct 71 ms 38452 KB Output is correct
50 Correct 3 ms 38452 KB Output is correct
51 Correct 65 ms 38952 KB Output is correct
52 Correct 60 ms 40492 KB Output is correct
53 Correct 61 ms 41496 KB Output is correct
54 Correct 59 ms 43012 KB Output is correct
55 Correct 2 ms 43012 KB Output is correct
56 Correct 2 ms 43012 KB Output is correct
57 Correct 2 ms 43012 KB Output is correct
58 Correct 2 ms 43012 KB Output is correct
59 Correct 2 ms 43012 KB Output is correct
60 Correct 3 ms 43012 KB Output is correct
61 Correct 1 ms 43012 KB Output is correct
62 Correct 3 ms 43012 KB Output is correct
63 Correct 2 ms 43012 KB Output is correct
64 Correct 3 ms 43012 KB Output is correct
65 Correct 2 ms 43012 KB Output is correct
66 Correct 3 ms 43012 KB Output is correct
67 Correct 59 ms 44196 KB Output is correct
68 Correct 69 ms 45456 KB Output is correct
69 Correct 55 ms 46588 KB Output is correct
70 Correct 53 ms 47796 KB Output is correct
71 Correct 57 ms 49112 KB Output is correct
72 Correct 67 ms 50368 KB Output is correct
73 Correct 62 ms 51588 KB Output is correct
74 Correct 49 ms 53524 KB Output is correct
75 Correct 62 ms 55072 KB Output is correct
76 Correct 69 ms 57016 KB Output is correct
77 Correct 59 ms 58456 KB Output is correct
78 Correct 58 ms 59848 KB Output is correct
79 Correct 85 ms 61068 KB Output is correct
80 Correct 56 ms 62536 KB Output is correct
81 Correct 76 ms 63900 KB Output is correct
82 Correct 57 ms 65348 KB Output is correct
83 Correct 53 ms 66852 KB Output is correct
84 Correct 58 ms 68812 KB Output is correct
85 Correct 82 ms 70732 KB Output is correct
86 Correct 86 ms 72676 KB Output is correct
87 Correct 66 ms 74672 KB Output is correct
88 Correct 84 ms 75132 KB Output is correct
89 Correct 68 ms 75160 KB Output is correct
90 Correct 70 ms 75236 KB Output is correct
91 Correct 61 ms 75236 KB Output is correct
92 Correct 68 ms 75236 KB Output is correct
93 Correct 54 ms 75236 KB Output is correct
94 Correct 62 ms 75236 KB Output is correct
95 Correct 60 ms 75236 KB Output is correct
96 Correct 87 ms 75236 KB Output is correct
97 Correct 58 ms 75236 KB Output is correct
98 Correct 58 ms 75236 KB Output is correct
99 Correct 76 ms 75236 KB Output is correct
100 Correct 65 ms 75236 KB Output is correct
101 Correct 66 ms 75236 KB Output is correct
102 Correct 100 ms 75236 KB Output is correct