oj.uz

Submission #53143

# Submission time Handle Problem Language Result Execution time Memory
53143 2018-06-28T20:00:37 Z FLDutchman Wiring (IOI17_wiring) C++14
100 / 100
 170 ms 96900 KB 
#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;

typedef vector<int> VI;

#define int long long
#define pb push_back
#define snd second
#define fst first
#define FOR(i, l, r) for(int i = (l); i < (r); i++)

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;

const int NMAX = 2e5+10;
const int INF = 1e18+10;


int N = 0, C = 0;
vi color, pos;
vi size, dist; 
vii comps;
vi le[NMAX], ri[NMAX], v[NMAX];
vi dp[NMAX];

// min segtree
struct segTree{
	int size;
	vi tree, lazy;


	segTree(vi &arr){
		size = arr.size();
		tree.assign(4*size, 0);
		lazy.assign(4*size, 0);
		buildTree(arr, 0, size, 1);
	}

	void buildTree(vi &arr, int lb, int rb, int n){
		if(lb+1==rb) {
			tree[n] = arr[lb];
			return;
		}
		int mb = (lb+rb)/2;
		buildTree(arr, lb, mb, 2*n);
		buildTree(arr, mb, rb, 2*n+1);
		tree[n] = min(tree[2*n], tree[2*n+1]);
	}

	void recAdd(int v, int l, int r, int lb, int rb, int n){
		//cout << "recAdd " << v << " " << l << " " << r << " " << lb << " " << rb << " " << n << endl;
		if(l <= lb and rb <= r){
			tree[n] += v;
			lazy[n] += v;
			return;
		}
		int mb = (lb+rb)/2;
		
		if(lazy[n]){
			recAdd(lazy[n], lb, rb, lb, mb, 2*n);
			recAdd(lazy[n], lb, rb, mb, rb, 2*n+1);
			lazy[n] = 0;
		}

		if(l < mb) recAdd(v, l, r, lb, mb, 2*n);
		if(r > mb) recAdd(v, l, r, mb, rb, 2*n+1);
		tree[n] = min(tree[2*n], tree[2*n+1]);
	}

	int zero(int rb, int n=1){
		if(rb == 1) return tree[n];
		int mb = rb/2;
		if(lazy[n]){
			recAdd(lazy[n], 0, rb, 0, mb, 2*n);
			recAdd(lazy[n], 0, rb, mb, rb, 2*n+1);
			lazy[n] = 0;
		}
		return zero(mb, 2*n);
	}

	int zero(){
		return zero(size);
	}

	void add(int v, int l){
		recAdd(v, l, size, 0, size, 1);
	}

	int mq(){
		return tree[1];
	}
};

long long min_total_length(VI r, VI b) {
	N = r.size() + b.size();
	int i = 0, j = 0;
	r.pb(1e9+10); b.pb(1e9+10);
	while(i + j < N){
		//cout << i << " " << j << endl;
		if(r[i] < b[j]) {
			pos.pb(r[i++]);
			color.pb(0);
		} else {
			pos.pb(b[j++]);
			color.pb(1);
		}
	}
	int start = 0;
	//cout << "Built pos" << endl;
	FOR(i, 1, N){
		if(color[i-1] != color[i]){
			comps.pb({start, i-1});
			size.pb(i-start);
			start = i;
		}
	}
	comps.pb({start, N-1});
	size.pb(N-start);
	C = comps.size();
	//cout << "Built comps" << endl;

	FOR(i, 0, C){
		//cout << i << endl;
		int s = size[i];
		le[i].assign(s+1, 0); ri[i].assign(s+1, 0);
		//  leftmost, rightmost
		int l = pos[comps[i].fst], r = pos[comps[i].snd];
		FOR(j, 1, s+1) le[i][j] = le[i][j-1] + pos[comps[i].fst + j-1] - l;
		for(int j = s-1; j >= 0; j--) ri[i][j] = ri[i][j+1] + r - pos[comps[i].fst + j];
	}
	//dp[i][k] => min wire needed to connect comp i onwards, given that k wires are coming in from the left
	dist.assign(C, 0);
	dist[0] = INF;
	FOR(i, 1, C) dist[i] = pos[comps[i].fst] - pos[comps[i-1].snd];
	FOR(i, 0, C) FOR(j, 0, le[i].size()) v[i].pb(le[i][j] + ri[i][j]);
	dp[C].pb(0);
	dp[C].pb(INF);
	
	for(int i = C-1; i >= 0; i--){
		//cout << "i = " << i << endl;
		// dp[C]
		vi arr(size[i]+1, 0);
		dp[i].assign(size[i]+1, INF);
		FOR(j, 0, size[i]+1) {
			arr[j] = v[i][j] + dp[i+1][ min(size[i] - j, (int) dp[i+1].size() -1 ) ];
			if(i != C and size[i]-j > (int)dp[i+1].size()-1){
				arr[j] += dist[i+1] * (size[i]-j - (int) dp[i+1].size()+1);
			}
		}
		//cout << "Made array" << endl;
		segTree t(arr);
		//cout << "Built tree" << endl;
		int extra = size[i] * dist[i];
		dp[i][size[i]] = t.mq() + extra;
		for(int k = size[i]-1; k >= 0; k--){
			//cout << "k = " <<k<<endl;
			t.add(dist[i], k+1);
			//cout << "added" << endl;
			extra -= dist[i];
			dp[i][k] = t.mq() + extra;
			if(i == 0) dp[i][k] = t.zero();
		}
	}
	/*
	cout << "pos: \t\t";
	for(int k : pos) cout << k << " ";
	cout << endl;
	cout << "color: \t\t";
	for(int k : color) cout << k << " ";
	cout << endl;
	cout << "comps: \t\t";
	for(ii k : comps) cout << k.fst << " " << k.snd << "\t";
	cout << endl;
	cout << "dist: \t\t";
	for(int k : dist) cout << k << " ";
	cout << endl;
	
	cout << "left: \n";
	FOR(i, 0, C) {
		for(int k : le[i]) cout << k << " ";
		cout << endl;
	}
	cout << "right: \n";
	FOR(i, 0, C) {
		for(int k : ri[i]) cout << k << " ";
		cout << endl;
	}
	
	cout << "v: \n";
	FOR(i, 0, C) {
		for(int k : v[i]) cout << k << " ";
		cout << endl;
	}
	segTree t(pos);
	t.add(-9, 5);
	cout << t.mq() << endl;

	cout << "dp: \n";
	FOR(i, 0, C+1) {
		for(int k : dp[i]) cout << k << " ";
		cout << endl;
	}
	*/
	

	return dp[0][0];
}

/*
4 5
1 2 3 7
0 4 5 9 10


5 3
1 3 9 102 103
5 125 130
*/

Compilation message

wiring.cpp: In function 'long long int min_total_length(VI, VI)':
wiring.cpp:11:41: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define FOR(i, l, r) for(int i = (l); i < (r); i++)
                                         ^
wiring.cpp:137:15: note: in expansion of macro 'FOR'
  FOR(i, 0, C) FOR(j, 0, le[i].size()) v[i].pb(le[i][j] + ri[i][j]);
               ^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 19064 KB Output is correct
2 Correct 16 ms 19172 KB Output is correct
3 Correct 19 ms 19248 KB Output is correct
4 Correct 16 ms 19324 KB Output is correct
5 Correct 18 ms 19528 KB Output is correct
6 Correct 17 ms 19528 KB Output is correct
7 Correct 24 ms 19528 KB Output is correct
8 Correct 22 ms 19528 KB Output is correct
9 Correct 17 ms 19528 KB Output is correct
10 Correct 17 ms 19528 KB Output is correct
11 Correct 17 ms 19528 KB Output is correct
12 Correct 17 ms 19528 KB Output is correct
13 Correct 20 ms 19528 KB Output is correct
14 Correct 20 ms 19528 KB Output is correct
15 Correct 17 ms 19528 KB Output is correct
16 Correct 17 ms 19528 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 19528 KB Output is correct
2 Correct 17 ms 19528 KB Output is correct
3 Correct 103 ms 35220 KB Output is correct
4 Correct 94 ms 35308 KB Output is correct
5 Correct 96 ms 35364 KB Output is correct
6 Correct 118 ms 39524 KB Output is correct
7 Correct 126 ms 41576 KB Output is correct
8 Correct 119 ms 43516 KB Output is correct
9 Correct 166 ms 45320 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 45320 KB Output is correct
2 Correct 17 ms 45320 KB Output is correct
3 Correct 115 ms 45320 KB Output is correct
4 Correct 84 ms 45320 KB Output is correct
5 Correct 16 ms 45320 KB Output is correct
6 Correct 20 ms 45320 KB Output is correct
7 Correct 17 ms 45320 KB Output is correct
8 Correct 17 ms 45320 KB Output is correct
9 Correct 21 ms 45320 KB Output is correct
10 Correct 17 ms 45320 KB Output is correct
11 Correct 18 ms 45320 KB Output is correct
12 Correct 21 ms 45320 KB Output is correct
13 Correct 20 ms 45320 KB Output is correct
14 Correct 17 ms 45320 KB Output is correct
15 Correct 17 ms 45320 KB Output is correct
16 Correct 18 ms 45320 KB Output is correct
17 Correct 17 ms 45320 KB Output is correct
18 Correct 117 ms 45320 KB Output is correct
19 Correct 124 ms 45320 KB Output is correct
20 Correct 93 ms 45320 KB Output is correct
21 Correct 170 ms 45320 KB Output is correct
22 Correct 105 ms 45320 KB Output is correct
23 Correct 107 ms 45320 KB Output is correct
24 Correct 106 ms 45320 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 45320 KB Output is correct
2 Correct 88 ms 45320 KB Output is correct
3 Correct 86 ms 45320 KB Output is correct
4 Correct 78 ms 45320 KB Output is correct
5 Correct 82 ms 45320 KB Output is correct
6 Correct 16 ms 45320 KB Output is correct
7 Correct 16 ms 45320 KB Output is correct
8 Correct 16 ms 45320 KB Output is correct
9 Correct 27 ms 45320 KB Output is correct
10 Correct 29 ms 45320 KB Output is correct
11 Correct 23 ms 45320 KB Output is correct
12 Correct 21 ms 45320 KB Output is correct
13 Correct 17 ms 45320 KB Output is correct
14 Correct 17 ms 45320 KB Output is correct
15 Correct 20 ms 45320 KB Output is correct
16 Correct 17 ms 45320 KB Output is correct
17 Correct 17 ms 45320 KB Output is correct
18 Correct 103 ms 45320 KB Output is correct
19 Correct 77 ms 45320 KB Output is correct
20 Correct 112 ms 45320 KB Output is correct
21 Correct 97 ms 45320 KB Output is correct
22 Correct 111 ms 45320 KB Output is correct
23 Correct 107 ms 45716 KB Output is correct
24 Correct 104 ms 45716 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 19064 KB Output is correct
2 Correct 16 ms 19172 KB Output is correct
3 Correct 19 ms 19248 KB Output is correct
4 Correct 16 ms 19324 KB Output is correct
5 Correct 18 ms 19528 KB Output is correct
6 Correct 17 ms 19528 KB Output is correct
7 Correct 24 ms 19528 KB Output is correct
8 Correct 22 ms 19528 KB Output is correct
9 Correct 17 ms 19528 KB Output is correct
10 Correct 17 ms 19528 KB Output is correct
11 Correct 17 ms 19528 KB Output is correct
12 Correct 17 ms 19528 KB Output is correct
13 Correct 20 ms 19528 KB Output is correct
14 Correct 20 ms 19528 KB Output is correct
15 Correct 17 ms 19528 KB Output is correct
16 Correct 17 ms 19528 KB Output is correct
17 Correct 17 ms 19528 KB Output is correct
18 Correct 17 ms 19528 KB Output is correct
19 Correct 103 ms 35220 KB Output is correct
20 Correct 94 ms 35308 KB Output is correct
21 Correct 96 ms 35364 KB Output is correct
22 Correct 118 ms 39524 KB Output is correct
23 Correct 126 ms 41576 KB Output is correct
24 Correct 119 ms 43516 KB Output is correct
25 Correct 166 ms 45320 KB Output is correct
26 Correct 17 ms 45320 KB Output is correct
27 Correct 17 ms 45320 KB Output is correct
28 Correct 115 ms 45320 KB Output is correct
29 Correct 84 ms 45320 KB Output is correct
30 Correct 16 ms 45320 KB Output is correct
31 Correct 20 ms 45320 KB Output is correct
32 Correct 17 ms 45320 KB Output is correct
33 Correct 17 ms 45320 KB Output is correct
34 Correct 21 ms 45320 KB Output is correct
35 Correct 17 ms 45320 KB Output is correct
36 Correct 18 ms 45320 KB Output is correct
37 Correct 21 ms 45320 KB Output is correct
38 Correct 20 ms 45320 KB Output is correct
39 Correct 17 ms 45320 KB Output is correct
40 Correct 17 ms 45320 KB Output is correct
41 Correct 18 ms 45320 KB Output is correct
42 Correct 17 ms 45320 KB Output is correct
43 Correct 117 ms 45320 KB Output is correct
44 Correct 124 ms 45320 KB Output is correct
45 Correct 93 ms 45320 KB Output is correct
46 Correct 170 ms 45320 KB Output is correct
47 Correct 105 ms 45320 KB Output is correct
48 Correct 107 ms 45320 KB Output is correct
49 Correct 106 ms 45320 KB Output is correct
50 Correct 17 ms 45320 KB Output is correct
51 Correct 88 ms 45320 KB Output is correct
52 Correct 86 ms 45320 KB Output is correct
53 Correct 78 ms 45320 KB Output is correct
54 Correct 82 ms 45320 KB Output is correct
55 Correct 16 ms 45320 KB Output is correct
56 Correct 16 ms 45320 KB Output is correct
57 Correct 16 ms 45320 KB Output is correct
58 Correct 27 ms 45320 KB Output is correct
59 Correct 29 ms 45320 KB Output is correct
60 Correct 23 ms 45320 KB Output is correct
61 Correct 21 ms 45320 KB Output is correct
62 Correct 17 ms 45320 KB Output is correct
63 Correct 17 ms 45320 KB Output is correct
64 Correct 20 ms 45320 KB Output is correct
65 Correct 17 ms 45320 KB Output is correct
66 Correct 17 ms 45320 KB Output is correct
67 Correct 103 ms 45320 KB Output is correct
68 Correct 77 ms 45320 KB Output is correct
69 Correct 112 ms 45320 KB Output is correct
70 Correct 97 ms 45320 KB Output is correct
71 Correct 111 ms 45320 KB Output is correct
72 Correct 107 ms 45716 KB Output is correct
73 Correct 104 ms 45716 KB Output is correct
74 Correct 114 ms 47108 KB Output is correct
75 Correct 108 ms 47108 KB Output is correct
76 Correct 141 ms 49480 KB Output is correct
77 Correct 105 ms 49532 KB Output is correct
78 Correct 120 ms 51436 KB Output is correct
79 Correct 120 ms 52924 KB Output is correct
80 Correct 107 ms 55172 KB Output is correct
81 Correct 111 ms 58612 KB Output is correct
82 Correct 107 ms 59316 KB Output is correct
83 Correct 110 ms 61460 KB Output is correct
84 Correct 116 ms 64428 KB Output is correct
85 Correct 109 ms 64428 KB Output is correct
86 Correct 115 ms 64752 KB Output is correct
87 Correct 115 ms 67408 KB Output is correct
88 Correct 109 ms 68236 KB Output is correct
89 Correct 112 ms 70284 KB Output is correct
90 Correct 117 ms 70992 KB Output is correct
91 Correct 114 ms 76408 KB Output is correct
92 Correct 109 ms 76408 KB Output is correct
93 Correct 112 ms 78704 KB Output is correct
94 Correct 110 ms 80188 KB Output is correct
95 Correct 109 ms 81484 KB Output is correct
96 Correct 116 ms 85464 KB Output is correct
97 Correct 117 ms 87408 KB Output is correct
98 Correct 117 ms 88984 KB Output is correct
99 Correct 121 ms 90948 KB Output is correct
100 Correct 107 ms 91260 KB Output is correct
101 Correct 114 ms 95268 KB Output is correct
102 Correct 113 ms 96900 KB Output is correct