oj.uz

Submission #49045

# Submission time Handle Problem Language Result Execution time Memory
49045 2018-05-21T13:25:43 Z polyfish Wiring (IOI17_wiring) C++14
100 / 100
 247 ms 25080 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define debug(x) cerr << #x << " = " << x << '\n';
#define BP() cerr << "OK!\n";
#define PR(A, n) cerr << #A << " = "; for (int64_t _=1; _<=n; ++_) cerr << A[_] << ' '; cerr << '\n';
#define PR0(A, n) cerr << #A << " = "; for (int64_t _=0; _<n; ++_) cerr << A[_] << ' '; cerr << '\n';

const int64_t maxn = 200002;
const int64_t inf = 1e18;

struct rmq {
	int64_t n;
	int64_t container[maxn*4];

	void init(int64_t _n) {
		n = _n;
		for (int64_t i=0; i<=4*n; ++i)
			container[i] = inf;
	}

	void update(int64_t pos, int64_t val, int64_t l, int64_t r, int64_t id) {
		if (pos<l || pos>r)
			return;
		if (l==pos && pos==r) {
			container[id] = val;
			return;
		}
		int64_t mid = (l+r)/2;
		update(pos, val, l, mid, id*2);
		update(pos, val, mid+1, r, id*2+1);
		container[id] = min(container[id*2], container[id*2+1]);
	}

	int64_t get(int64_t u, int64_t v, int64_t l, int64_t r, int64_t id) {
		if (v<l || u>r)
			return inf;
		if (u<=l && r<=v)
			return container[id];
		int64_t mid = (l+r)/2;
		return min(get(u, v, l, mid, id*2),
					get(u, v, mid+1, r, id*2+1));
	}

	void update(int64_t pos, int64_t val) {
		update(pos, val, 1, n, 1);
	}

	int64_t get(int64_t u, int64_t v) {
		if (u>v)
			return inf;
		return get(u, v, 1, n, 1);
	}
} T1, T2;

int64_t m, n, L[maxn], R[maxn], pos[maxn];
pair<int64_t, int64_t> a[maxn];
int64_t f[maxn], ps[2][maxn];

void enter(vector<int> r, vector<int> b) {
	m = r.size(); n = b.size();
	for (int64_t i=1; i<=m; ++i) {
		a[i] = make_pair(r[i-1], 0);
	}
	for (int64_t i=1; i<=n; ++i) {
		a[m+i] = make_pair(b[i-1], 1);
	}
}

void init() {
	n = m+n;
	sort(a+1, a+n+1);
	int64_t cnt = 0;
	for (int64_t i=1; i<=n+1; ++i) {
		if (i==1 || i==n+1 || a[i].second!=a[i-1].second) {
			++cnt;
			L[cnt] = i;
			R[cnt-1] = i-1;
		}
		pos[i] = cnt;
	}
	for (int64_t i=1; i<=n; ++i) {
		for (int64_t j=0; j<2; ++j)
			ps[j][i] = ps[j][i-1] + (a[i].second==j ? a[i].first : 0);
	}
	T1.init(n);
	T2.init(n);
}

int64_t min_total_length(vector<int> red, vector<int> blue) {
	// freopen("wiring.inp", "r", stdin);
	// freopen("wiring.out", "w", stdout);
	// ios::sync_with_stdio(0); cin.tie(0);
	enter(red, blue);
	init();
	int64_t extra1 = 1LL*(-1+R[pos[1]])*a[L[pos[1]+1]].first;
	int64_t extra2 = -1LL*(1-R[pos[1]])*a[R[pos[1]]].first;
	T1.update(1, extra1);
	T2.update(1, extra2);
	for (int64_t i=1; i<=n; ++i) {
		f[i] = inf;
		if (pos[i]==1) {
			continue;
		}
		int64_t l = L[pos[i]-1], r = R[pos[i]-1];
		int64_t w = a[i].second, b = w^1;
		f[i] = T1.get(l, r-i+L[pos[i]]) + (-i + L[pos[i]])*a[L[pos[i]]].first
				+ ps[w][i] - ps[b][i];
		f[i] = min(f[i], T2.get(max(l, r-i+L[pos[i]]), r) - (i-L[pos[i]])*a[R[pos[i]-1]].first
				 + ps[w][i] - ps[b][i]);
		int64_t extra1 = 1LL*(-i+R[pos[i]])*a[L[pos[i]+1]].first;
		int64_t extra2 = -1LL*(i-R[pos[i]])*a[R[pos[i]]].first;
		T1.update(i, min(f[i], f[i-1])+ps[w][i-1]-ps[b][i-1] + extra1);
		T2.update(i, min(f[i], f[i-1])+ps[w][i-1]-ps[b][i-1] + extra2);
	}
	return f[n];
}

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 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 3 ms 516 KB Output is correct
6 Correct 2 ms 688 KB Output is correct
7 Correct 2 ms 688 KB Output is correct
8 Correct 3 ms 692 KB Output is correct
9 Correct 2 ms 692 KB Output is correct
10 Correct 2 ms 692 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 2 ms 748 KB Output is correct
13 Correct 2 ms 748 KB Output is correct
14 Correct 2 ms 748 KB Output is correct
15 Correct 2 ms 748 KB Output is correct
16 Correct 3 ms 748 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 748 KB Output is correct
2 Correct 2 ms 748 KB Output is correct
3 Correct 89 ms 18176 KB Output is correct
4 Correct 76 ms 18208 KB Output is correct
5 Correct 134 ms 18344 KB Output is correct
6 Correct 138 ms 24044 KB Output is correct
7 Correct 143 ms 24044 KB Output is correct
8 Correct 116 ms 24072 KB Output is correct
9 Correct 113 ms 24092 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 24092 KB Output is correct
2 Correct 2 ms 24092 KB Output is correct
3 Correct 203 ms 25080 KB Output is correct
4 Correct 185 ms 25080 KB Output is correct
5 Correct 2 ms 25080 KB Output is correct
6 Correct 2 ms 25080 KB Output is correct
7 Correct 3 ms 25080 KB Output is correct
8 Correct 2 ms 25080 KB Output is correct
9 Correct 2 ms 25080 KB Output is correct
10 Correct 2 ms 25080 KB Output is correct
11 Correct 2 ms 25080 KB Output is correct
12 Correct 2 ms 25080 KB Output is correct
13 Correct 2 ms 25080 KB Output is correct
14 Correct 3 ms 25080 KB Output is correct
15 Correct 2 ms 25080 KB Output is correct
16 Correct 2 ms 25080 KB Output is correct
17 Correct 2 ms 25080 KB Output is correct
18 Correct 199 ms 25080 KB Output is correct
19 Correct 181 ms 25080 KB Output is correct
20 Correct 210 ms 25080 KB Output is correct
21 Correct 239 ms 25080 KB Output is correct
22 Correct 247 ms 25080 KB Output is correct
23 Correct 188 ms 25080 KB Output is correct
24 Correct 185 ms 25080 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 25080 KB Output is correct
2 Correct 178 ms 25080 KB Output is correct
3 Correct 171 ms 25080 KB Output is correct
4 Correct 205 ms 25080 KB Output is correct
5 Correct 170 ms 25080 KB Output is correct
6 Correct 2 ms 25080 KB Output is correct
7 Correct 2 ms 25080 KB Output is correct
8 Correct 2 ms 25080 KB Output is correct
9 Correct 2 ms 25080 KB Output is correct
10 Correct 2 ms 25080 KB Output is correct
11 Correct 2 ms 25080 KB Output is correct
12 Correct 2 ms 25080 KB Output is correct
13 Correct 2 ms 25080 KB Output is correct
14 Correct 2 ms 25080 KB Output is correct
15 Correct 2 ms 25080 KB Output is correct
16 Correct 2 ms 25080 KB Output is correct
17 Correct 2 ms 25080 KB Output is correct
18 Correct 209 ms 25080 KB Output is correct
19 Correct 239 ms 25080 KB Output is correct
20 Correct 179 ms 25080 KB Output is correct
21 Correct 217 ms 25080 KB Output is correct
22 Correct 172 ms 25080 KB Output is correct
23 Correct 223 ms 25080 KB Output is correct
24 Correct 145 ms 25080 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 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 3 ms 516 KB Output is correct
6 Correct 2 ms 688 KB Output is correct
7 Correct 2 ms 688 KB Output is correct
8 Correct 3 ms 692 KB Output is correct
9 Correct 2 ms 692 KB Output is correct
10 Correct 2 ms 692 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 2 ms 748 KB Output is correct
13 Correct 2 ms 748 KB Output is correct
14 Correct 2 ms 748 KB Output is correct
15 Correct 2 ms 748 KB Output is correct
16 Correct 3 ms 748 KB Output is correct
17 Correct 2 ms 748 KB Output is correct
18 Correct 2 ms 748 KB Output is correct
19 Correct 89 ms 18176 KB Output is correct
20 Correct 76 ms 18208 KB Output is correct
21 Correct 134 ms 18344 KB Output is correct
22 Correct 138 ms 24044 KB Output is correct
23 Correct 143 ms 24044 KB Output is correct
24 Correct 116 ms 24072 KB Output is correct
25 Correct 113 ms 24092 KB Output is correct
26 Correct 2 ms 24092 KB Output is correct
27 Correct 2 ms 24092 KB Output is correct
28 Correct 203 ms 25080 KB Output is correct
29 Correct 185 ms 25080 KB Output is correct
30 Correct 2 ms 25080 KB Output is correct
31 Correct 2 ms 25080 KB Output is correct
32 Correct 3 ms 25080 KB Output is correct
33 Correct 2 ms 25080 KB Output is correct
34 Correct 2 ms 25080 KB Output is correct
35 Correct 2 ms 25080 KB Output is correct
36 Correct 2 ms 25080 KB Output is correct
37 Correct 2 ms 25080 KB Output is correct
38 Correct 2 ms 25080 KB Output is correct
39 Correct 3 ms 25080 KB Output is correct
40 Correct 2 ms 25080 KB Output is correct
41 Correct 2 ms 25080 KB Output is correct
42 Correct 2 ms 25080 KB Output is correct
43 Correct 199 ms 25080 KB Output is correct
44 Correct 181 ms 25080 KB Output is correct
45 Correct 210 ms 25080 KB Output is correct
46 Correct 239 ms 25080 KB Output is correct
47 Correct 247 ms 25080 KB Output is correct
48 Correct 188 ms 25080 KB Output is correct
49 Correct 185 ms 25080 KB Output is correct
50 Correct 2 ms 25080 KB Output is correct
51 Correct 178 ms 25080 KB Output is correct
52 Correct 171 ms 25080 KB Output is correct
53 Correct 205 ms 25080 KB Output is correct
54 Correct 170 ms 25080 KB Output is correct
55 Correct 2 ms 25080 KB Output is correct
56 Correct 2 ms 25080 KB Output is correct
57 Correct 2 ms 25080 KB Output is correct
58 Correct 2 ms 25080 KB Output is correct
59 Correct 2 ms 25080 KB Output is correct
60 Correct 2 ms 25080 KB Output is correct
61 Correct 2 ms 25080 KB Output is correct
62 Correct 2 ms 25080 KB Output is correct
63 Correct 2 ms 25080 KB Output is correct
64 Correct 2 ms 25080 KB Output is correct
65 Correct 2 ms 25080 KB Output is correct
66 Correct 2 ms 25080 KB Output is correct
67 Correct 209 ms 25080 KB Output is correct
68 Correct 239 ms 25080 KB Output is correct
69 Correct 179 ms 25080 KB Output is correct
70 Correct 217 ms 25080 KB Output is correct
71 Correct 172 ms 25080 KB Output is correct
72 Correct 223 ms 25080 KB Output is correct
73 Correct 145 ms 25080 KB Output is correct
74 Correct 146 ms 25080 KB Output is correct
75 Correct 181 ms 25080 KB Output is correct
76 Correct 175 ms 25080 KB Output is correct
77 Correct 198 ms 25080 KB Output is correct
78 Correct 148 ms 25080 KB Output is correct
79 Correct 208 ms 25080 KB Output is correct
80 Correct 152 ms 25080 KB Output is correct
81 Correct 130 ms 25080 KB Output is correct
82 Correct 190 ms 25080 KB Output is correct
83 Correct 122 ms 25080 KB Output is correct
84 Correct 114 ms 25080 KB Output is correct
85 Correct 163 ms 25080 KB Output is correct
86 Correct 151 ms 25080 KB Output is correct
87 Correct 205 ms 25080 KB Output is correct
88 Correct 230 ms 25080 KB Output is correct
89 Correct 170 ms 25080 KB Output is correct
90 Correct 199 ms 25080 KB Output is correct
91 Correct 146 ms 25080 KB Output is correct
92 Correct 216 ms 25080 KB Output is correct
93 Correct 162 ms 25080 KB Output is correct
94 Correct 190 ms 25080 KB Output is correct
95 Correct 212 ms 25080 KB Output is correct
96 Correct 136 ms 25080 KB Output is correct
97 Correct 163 ms 25080 KB Output is correct
98 Correct 150 ms 25080 KB Output is correct
99 Correct 151 ms 25080 KB Output is correct
100 Correct 228 ms 25080 KB Output is correct
101 Correct 148 ms 25080 KB Output is correct
102 Correct 190 ms 25080 KB Output is correct