oj.uz

Submission #837318

# Submission time Handle Problem Language Result Execution time Memory
837318 2023-08-25T09:33:33 Z Johann Wiring (IOI17_wiring) C++14
100 / 100
 94 ms 17796 KB 
#include "wiring.h"
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

const ll INF = 1LL << 60;

int N, M;
vi pos, color;
vi dp, intervals;

struct segtree
{
	int size;
	vi arr;
	void init(int _size)
	{
		size = 1;
		while (size < _size)
			size *= 2;
		arr.assign(2 * size, INF);
	}
	void set(int i, ll v)
	{
		i += size;
		arr[i] = v;
		while (i >>= 1 > 0)
			arr[i] = min(arr[2 * i], arr[2 * i + 1]);
	}
	ll query(int l, int r) { return query(l, r, 1, 0, size); }
	ll query(int l, int r, int x, int lx, int rx)
	{
		if (l <= lx && rx <= r)
			return arr[x];
		if (r <= lx || rx <= l)
			return INF;
		int m = (lx + rx) / 2;
		ll a = query(l, r, 2 * x, lx, m);
		ll b = query(l, r, 2 * x + 1, m, rx);
		return min(a, b);
	}
};
segtree segL; // compensation for gap will be done on the left
segtree segR; // compenstation for gap will be on the right <==> this is the pure naive cost

long long min_total_length(std::vector<int> _R, std::vector<int> _B)
{
	N = sz(_R), M = sz(_B);
	int ir = 0, ib = 0;
	while (ir + ib < N + M)
	{
		if (ir == N)
			color.push_back(1), pos.push_back(_B[ib++]);
		else if (ib == M)
			color.push_back(0), pos.push_back(_R[ir++]);
		else
		{
			if (_R[ir] < _B[ib])
				color.push_back(0), pos.push_back(_R[ir++]);
			else
				color.push_back(1), pos.push_back(_B[ib++]);
		}
	}

	int c = -1;
	for (int i = 0; i < sz(color); ++i)
	{
		if (c == color[i])
			continue;
		c = color[i];
		intervals.push_back(i);
	}
	intervals.push_back(sz(color)); // for the end of the last interval

	// init dp
	dp.assign(sz(pos) + 1, INF);
	segL.init(sz(dp));
	segR.init(sz(dp));
	dp[0] = 0; // cost of connection all stuff [0, i) only to the left
	{
		int l = 0, r = intervals[1];
		ll sum = (r - l) * pos[r] - accumulate(pos.begin(), pos.begin() + r, 0LL);
		segR.set(0, sum);
		sum -= (r - l) * (pos[r] - pos[r - 1]);
		segL.set(0, sum);
	}
	// do dp
	for (int j = 1, l, m, r; j < sz(intervals) - 1; ++j)
	{
		l = intervals[j - 1], m = intervals[j], r = intervals[j + 1];

		ll cost = 0;
		ll costComp = 0;
		for (int i = m; i < r; ++i)
		{
			cost += pos[i] - pos[m - 1];
			costComp += pos[i] - pos[m];
			ll tmp;
			int change = max(l, m - (i - m + 1));
			tmp = segL.query(change, m + 1);
			if (tmp != INF)
				dp[i + 1] = min(dp[i + 1], cost + tmp);
			tmp = segR.query(l, change);
			if (tmp != INF)
				dp[i + 1] = min(dp[i + 1], costComp + tmp);
		}
		if (r < sz(pos))
		{
			cost = 0;
			costComp = 0;
			for (int i = r - 1; i >= m; --i)
			{
				if (dp[i + 1] != INF)
					segR.set(i + 1, dp[i + 1] + cost),
						segL.set(i + 1, dp[i + 1] + costComp);
				cost += pos[r] - pos[i];
				costComp += pos[r - 1] - pos[i];
			}
			if (dp[m] != INF)
				segR.set(m, dp[m] + cost),
					segL.set(m, dp[m] + costComp);
		}
	}

	return dp[N + M];
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 33 ms 13352 KB Output is correct
4 Correct 31 ms 13352 KB Output is correct
5 Correct 33 ms 13404 KB Output is correct
6 Correct 53 ms 14996 KB Output is correct
7 Correct 46 ms 14904 KB Output is correct
8 Correct 49 ms 14904 KB Output is correct
9 Correct 46 ms 14904 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 88 ms 15748 KB Output is correct
4 Correct 79 ms 17072 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 81 ms 17796 KB Output is correct
19 Correct 82 ms 17672 KB Output is correct
20 Correct 83 ms 17500 KB Output is correct
21 Correct 83 ms 17584 KB Output is correct
22 Correct 81 ms 17628 KB Output is correct
23 Correct 94 ms 17560 KB Output is correct
24 Correct 88 ms 17632 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 77 ms 14996 KB Output is correct
3 Correct 77 ms 16432 KB Output is correct
4 Correct 81 ms 16152 KB Output is correct
5 Correct 76 ms 16452 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 76 ms 16280 KB Output is correct
19 Correct 83 ms 16200 KB Output is correct
20 Correct 83 ms 16264 KB Output is correct
21 Correct 80 ms 16260 KB Output is correct
22 Correct 64 ms 16184 KB Output is correct
23 Correct 49 ms 16256 KB Output is correct
24 Correct 62 ms 16148 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 33 ms 13352 KB Output is correct
20 Correct 31 ms 13352 KB Output is correct
21 Correct 33 ms 13404 KB Output is correct
22 Correct 53 ms 14996 KB Output is correct
23 Correct 46 ms 14904 KB Output is correct
24 Correct 49 ms 14904 KB Output is correct
25 Correct 46 ms 14904 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 88 ms 15748 KB Output is correct
29 Correct 79 ms 17072 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 81 ms 17796 KB Output is correct
44 Correct 82 ms 17672 KB Output is correct
45 Correct 83 ms 17500 KB Output is correct
46 Correct 83 ms 17584 KB Output is correct
47 Correct 81 ms 17628 KB Output is correct
48 Correct 94 ms 17560 KB Output is correct
49 Correct 88 ms 17632 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 77 ms 14996 KB Output is correct
52 Correct 77 ms 16432 KB Output is correct
53 Correct 81 ms 16152 KB Output is correct
54 Correct 76 ms 16452 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 0 ms 300 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 76 ms 16280 KB Output is correct
68 Correct 83 ms 16200 KB Output is correct
69 Correct 83 ms 16264 KB Output is correct
70 Correct 80 ms 16260 KB Output is correct
71 Correct 64 ms 16184 KB Output is correct
72 Correct 49 ms 16256 KB Output is correct
73 Correct 62 ms 16148 KB Output is correct
74 Correct 60 ms 16932 KB Output is correct
75 Correct 64 ms 16568 KB Output is correct
76 Correct 71 ms 17052 KB Output is correct
77 Correct 78 ms 16412 KB Output is correct
78 Correct 66 ms 16344 KB Output is correct
79 Correct 75 ms 16312 KB Output is correct
80 Correct 60 ms 16312 KB Output is correct
81 Correct 51 ms 16440 KB Output is correct
82 Correct 49 ms 16312 KB Output is correct
83 Correct 53 ms 16532 KB Output is correct
84 Correct 53 ms 16944 KB Output is correct
85 Correct 70 ms 16940 KB Output is correct
86 Correct 65 ms 16936 KB Output is correct
87 Correct 65 ms 16936 KB Output is correct
88 Correct 68 ms 16992 KB Output is correct
89 Correct 66 ms 16952 KB Output is correct
90 Correct 72 ms 16992 KB Output is correct
91 Correct 54 ms 16936 KB Output is correct
92 Correct 77 ms 16932 KB Output is correct
93 Correct 74 ms 16908 KB Output is correct
94 Correct 71 ms 16936 KB Output is correct
95 Correct 86 ms 16884 KB Output is correct
96 Correct 58 ms 16916 KB Output is correct
97 Correct 56 ms 16904 KB Output is correct
98 Correct 60 ms 16920 KB Output is correct
99 Correct 62 ms 16956 KB Output is correct
100 Correct 78 ms 16924 KB Output is correct
101 Correct 62 ms 16816 KB Output is correct
102 Correct 59 ms 16816 KB Output is correct