oj.uz

Submission #262247

# Submission time Handle Problem Language Result Execution time Memory
262247 2020-08-12T14:26:02 Z Namnamseo Wiring (IOI17_wiring) C++17
100 / 100
 76 ms 12364 KB 
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pp=pair<int,int>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)((x).size()))
#define rep(i,n) for(int i=0; i<(n); ++i)
#define rrep(i,n) for(int i=1; i<=(n); ++i)
#define x first
#define y second

const int maxn = int(2e5) + 10;
ll dp[maxn];
const ll inf = 1ll<<60;

int n;
vector<pp> a;

int lev[maxn];
int levbef[maxn*2];

int bef[maxn];
int bx[maxn];

int nx[maxn];

ll pd[maxn];

void pre() {
	rep(i, n) {
		if (i) pd[i] = pd[i-1];
		if (a[i].y) pd[i] += a[i].x;
		else pd[i] -= a[i].x;
	}

	int l = n;
	rep(i, n) {
		if (a[i].y) ++l; else --l;
		lev[i] = l;
		levbef[l] = -2;
	}
	levbef[n] = -1;

	int last[2] = {-1, -1};
	rep(i, n) {
		int c = a[i].y, d = c^1;
		bef[i] = last[c];
		bx[i] = last[d];

		last[c] = i;
	}

	last[0] = last[1] = -1;
	for(int i=n-1; 0<=i; --i) {
		int c = a[i].y, d = c^1;
		nx[i] = last[d];

		last[c] = i;
	}
}

ll min_total_length(vector<int> vr, vector<int> vb) {
	a.clear();
	for(int x:vr) a.eb(x, 0);
	for(int x:vb) a.eb(x, 1);
	sort(all(a));

	n = sz(a);
	pre();

	fill(dp, dp+n, inf);

	{
		int p = nx[0];
		for(int j=0; a[j].y == a[0].y; ++j) {
			int cnt = j+1;
			ll ps = abs(pd[j]);
			dp[j] = a[p].x * 1ll * cnt - ps;
		}
	}

	rep(i, n) {
		{
			int k = levbef[lev[i]];
			if (k != -2) {
				ll df = abs(pd[i] - (k >= 0 ? pd[k] : 0ll));
				ll tmp = (k >= 0 ? dp[k] : 0ll) + df;
				dp[i] = min(dp[i], tmp);
			}
			levbef[lev[i]] = i;
		}

		if (nx[i] != -1) {
			ll tmp = dp[i-1] + abs(a[nx[i]].x-a[i].x);
			dp[i] = min(dp[i], tmp);
		}

		if (bx[i] != -1) {
			ll tmp = ((bx[i] == i-1) ? dp[i-2] : dp[i-1]) + abs(a[bx[i]].x-a[i].x);
			dp[i] = min(dp[i], tmp);
		}

		if (i+1 < n && nx[i+1] != -1) {
			int j = nx[i+1];
			ll ps = abs(pd[j-1]-pd[i]);
			int cnt = j-i-1;
			ll tmp = dp[i] + a[j].x * 1ll * cnt - ps;
			dp[j] = min(dp[j], tmp);
		}
	}

	return dp[n-1];
}

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 38 ms 7912 KB Output is correct
4 Correct 38 ms 7900 KB Output is correct
5 Correct 37 ms 7912 KB Output is correct
6 Correct 49 ms 10216 KB Output is correct
7 Correct 52 ms 10236 KB Output is correct
8 Correct 49 ms 10216 KB Output is correct
9 Correct 48 ms 10240 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 76 ms 9832 KB Output is correct
4 Correct 61 ms 9836 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 416 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 64 ms 11880 KB Output is correct
19 Correct 63 ms 11772 KB Output is correct
20 Correct 76 ms 11752 KB Output is correct
21 Correct 66 ms 11752 KB Output is correct
22 Correct 67 ms 11752 KB Output is correct
23 Correct 64 ms 11752 KB Output is correct
24 Correct 64 ms 11756 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 52 ms 10088 KB Output is correct
3 Correct 54 ms 9832 KB Output is correct
4 Correct 56 ms 9832 KB Output is correct
5 Correct 56 ms 9832 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 63 ms 9960 KB Output is correct
19 Correct 53 ms 9832 KB Output is correct
20 Correct 53 ms 9832 KB Output is correct
21 Correct 49 ms 9960 KB Output is correct
22 Correct 60 ms 10216 KB Output is correct
23 Correct 47 ms 10196 KB Output is correct
24 Correct 51 ms 10088 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 38 ms 7912 KB Output is correct
20 Correct 38 ms 7900 KB Output is correct
21 Correct 37 ms 7912 KB Output is correct
22 Correct 49 ms 10216 KB Output is correct
23 Correct 52 ms 10236 KB Output is correct
24 Correct 49 ms 10216 KB Output is correct
25 Correct 48 ms 10240 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 76 ms 9832 KB Output is correct
29 Correct 61 ms 9836 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 512 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 416 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 64 ms 11880 KB Output is correct
44 Correct 63 ms 11772 KB Output is correct
45 Correct 76 ms 11752 KB Output is correct
46 Correct 66 ms 11752 KB Output is correct
47 Correct 67 ms 11752 KB Output is correct
48 Correct 64 ms 11752 KB Output is correct
49 Correct 64 ms 11756 KB Output is correct
50 Correct 0 ms 384 KB Output is correct
51 Correct 52 ms 10088 KB Output is correct
52 Correct 54 ms 9832 KB Output is correct
53 Correct 56 ms 9832 KB Output is correct
54 Correct 56 ms 9832 KB Output is correct
55 Correct 0 ms 384 KB Output is correct
56 Correct 0 ms 384 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 0 ms 384 KB Output is correct
61 Correct 0 ms 384 KB Output is correct
62 Correct 0 ms 384 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 0 ms 384 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 0 ms 384 KB Output is correct
67 Correct 63 ms 9960 KB Output is correct
68 Correct 53 ms 9832 KB Output is correct
69 Correct 53 ms 9832 KB Output is correct
70 Correct 49 ms 9960 KB Output is correct
71 Correct 60 ms 10216 KB Output is correct
72 Correct 47 ms 10196 KB Output is correct
73 Correct 51 ms 10088 KB Output is correct
74 Correct 53 ms 12136 KB Output is correct
75 Correct 68 ms 11752 KB Output is correct
76 Correct 57 ms 12136 KB Output is correct
77 Correct 57 ms 11516 KB Output is correct
78 Correct 50 ms 11496 KB Output is correct
79 Correct 52 ms 11752 KB Output is correct
80 Correct 47 ms 11500 KB Output is correct
81 Correct 53 ms 11656 KB Output is correct
82 Correct 49 ms 11624 KB Output is correct
83 Correct 47 ms 11752 KB Output is correct
84 Correct 50 ms 12136 KB Output is correct
85 Correct 61 ms 12136 KB Output is correct
86 Correct 55 ms 12136 KB Output is correct
87 Correct 56 ms 12136 KB Output is correct
88 Correct 63 ms 12040 KB Output is correct
89 Correct 54 ms 12008 KB Output is correct
90 Correct 67 ms 12136 KB Output is correct
91 Correct 53 ms 12136 KB Output is correct
92 Correct 55 ms 12008 KB Output is correct
93 Correct 53 ms 12136 KB Output is correct
94 Correct 55 ms 12136 KB Output is correct
95 Correct 67 ms 12008 KB Output is correct
96 Correct 52 ms 12140 KB Output is correct
97 Correct 56 ms 12364 KB Output is correct
98 Correct 54 ms 12136 KB Output is correct
99 Correct 57 ms 12136 KB Output is correct
100 Correct 58 ms 12008 KB Output is correct
101 Correct 54 ms 12136 KB Output is correct
102 Correct 59 ms 12136 KB Output is correct