oj.uz

Submission #95112

# Submission time Handle Problem Language Result Execution time Memory
95112 2019-01-27T11:45:50 Z psmao Wiring (IOI17_wiring) C++14
100 / 100
 42 ms 12720 KB 
#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
 
#define fo(i,s,t) for(int i = s; i <= t; ++ i)
#define fd(i,s,t) for(int i = s; i >= t; -- i)
#define bf(i,s) for(int i = head[s]; i; i = e[i].next)
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define pb push_back
#define VI vector<int>
#define sf scanf
#define pf printf
#define fp freopen
#define SZ(x) ((int)(x).size())
#ifdef MPS
#define D(x...) printf(x)
#else
#define D(x...)
#endif
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
const int inf = 1<<30;
const ll INF = 1ll<<50;
const db Inf = 1e20;
const db eps = 1e-9;
 
void gmax(int &a,int b){a = (a > b ? a : b);}
void gmin(int &a,int b){a = (a < b ? a : b);}

const int maxn = 200050;

int n, m, s[maxn], belong[maxn], sz[maxn], col[maxn];
ll pre[maxn], dp[maxn], suf[maxn], pref[maxn];

int jud(int cur, int x)
{
	x = max(x, sz[cur-2] + 1);
	return x;
}
long long min_total_length(std::vector<int> r, std::vector<int> b) 
{
	n = SZ(r); m = SZ(b);
	int i = 0, j = 0, tot = 0;
	while(i < n && j < m) //merge them together
	{
		if(r[i] < b[j]) {s[++tot] = r[i++]; col[tot] = 0;}
		else {s[++tot] = b[j++]; col[tot] = 1;}
	}
	while(i < n) {s[++tot] = r[i++]; col[tot] = 0;}
	while(j < m) {s[++tot] = b[j++]; col[tot] = 1;}
	fo(i,1,tot) pre[i] = pre[i-1] + s[i];
	int num = 0;
	fo(i,1,tot) 
	{
		++ num; sz[num] = sz[num - 1];
		int j = i;
		while(j <= tot && col[j] == col[i]) 
		{
			belong[j] = num;
			sz[num] ++;
			++ j;
		}
		i = j - 1;
	}
	fo(i,1,sz[1]) dp[i] = INF;
	fo(i,sz[1]+1,tot)
	{
		int cur = belong[i], d = sz[cur-1];
		//2d-i <= j <= d
		if(cur == 2) 
		{
			if(i - d >= d) dp[i] = pre[i] - 2 * pre[d] - s[d]*1ll*i + 2ll*s[d]*d;
			else dp[i] = pre[i] - 2 * pre[d] + 2ll*d*s[d+1] - 1ll*i*s[d+1];
			goto gg;
		}
		dp[i] = INF;
		dp[i] = min(dp[i], suf[jud(cur, 2*d-i)] + pre[i] - 2*pre[d] - s[d]*1ll*i + 2ll*s[d]*d);
		// j < 2d-i
		if(2*d-i >= sz[cur-2] + 1) 
			dp[i] = min(dp[i], pre[i] - 2*pre[d] + 2ll*d*s[d+1] - 1ll*i*s[d+1] + pref[jud(cur,2*d-i)]);
		if(i-d>=sz[cur-1]-sz[cur-2]) 
			dp[i] = min(dp[i], min(dp[sz[cur-2]], dp[sz[cur-2]+1]) + pre[i] - 2*pre[d] + pre[sz[cur-2]] - 1ll*s[d]*(i-d-sz[cur-1]+sz[cur-2]));
		else
			dp[i] = min(dp[i], min(dp[sz[cur-2]], dp[sz[cur-2]+1]) + pre[i] - 2*pre[d] + pre[sz[cur-2]] + 1ll*s[d+1]*(sz[cur-1]-sz[cur-2]-i+d));
		gg:; 
		if(belong[i+1] != belong[i])
		{
			suf[i] = INF;
			fd(j,i-1,d+1) suf[j] = min(suf[j+1], dp[j] + pre[j] - 1ll * s[i] * j);
			pref[d] = INF;
			fo(j,d+1,i-1) pref[j] = min(pref[j-1], dp[j] + pre[j] - 1ll * s[i+1] * j);
			// if(i == 4) cout << pref[1] << endl;
		}
		D("%d %lld\n",i,dp[i]);
	}
	return dp[tot];
}

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 28 ms 6396 KB Output is correct
4 Correct 27 ms 6392 KB Output is correct
5 Correct 28 ms 7208 KB Output is correct
6 Correct 36 ms 8952 KB Output is correct
7 Correct 35 ms 8952 KB Output is correct
8 Correct 35 ms 8952 KB Output is correct
9 Correct 34 ms 8956 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 39 ms 10744 KB Output is correct
4 Correct 35 ms 12280 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 380 KB Output is correct
18 Correct 42 ms 12712 KB Output is correct
19 Correct 40 ms 12664 KB Output is correct
20 Correct 38 ms 12588 KB Output is correct
21 Correct 42 ms 12720 KB Output is correct
22 Correct 42 ms 12664 KB Output is correct
23 Correct 41 ms 12664 KB Output is correct
24 Correct 39 ms 12664 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 31 ms 10488 KB Output is correct
3 Correct 32 ms 10496 KB Output is correct
4 Correct 32 ms 10620 KB Output is correct
5 Correct 32 ms 10588 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 31 ms 11256 KB Output is correct
19 Correct 32 ms 11768 KB Output is correct
20 Correct 33 ms 11768 KB Output is correct
21 Correct 31 ms 11640 KB Output is correct
22 Correct 29 ms 10872 KB Output is correct
23 Correct 30 ms 10360 KB Output is correct
24 Correct 29 ms 10744 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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 28 ms 6396 KB Output is correct
20 Correct 27 ms 6392 KB Output is correct
21 Correct 28 ms 7208 KB Output is correct
22 Correct 36 ms 8952 KB Output is correct
23 Correct 35 ms 8952 KB Output is correct
24 Correct 35 ms 8952 KB Output is correct
25 Correct 34 ms 8956 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 39 ms 10744 KB Output is correct
29 Correct 35 ms 12280 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 380 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 380 KB Output is correct
43 Correct 42 ms 12712 KB Output is correct
44 Correct 40 ms 12664 KB Output is correct
45 Correct 38 ms 12588 KB Output is correct
46 Correct 42 ms 12720 KB Output is correct
47 Correct 42 ms 12664 KB Output is correct
48 Correct 41 ms 12664 KB Output is correct
49 Correct 39 ms 12664 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 31 ms 10488 KB Output is correct
52 Correct 32 ms 10496 KB Output is correct
53 Correct 32 ms 10620 KB Output is correct
54 Correct 32 ms 10588 KB Output is correct
55 Correct 2 ms 380 KB Output is correct
56 Correct 2 ms 376 KB Output is correct
57 Correct 2 ms 376 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 2 ms 376 KB Output is correct
60 Correct 2 ms 376 KB Output is correct
61 Correct 2 ms 376 KB Output is correct
62 Correct 2 ms 376 KB Output is correct
63 Correct 2 ms 376 KB Output is correct
64 Correct 2 ms 376 KB Output is correct
65 Correct 2 ms 376 KB Output is correct
66 Correct 2 ms 376 KB Output is correct
67 Correct 31 ms 11256 KB Output is correct
68 Correct 32 ms 11768 KB Output is correct
69 Correct 33 ms 11768 KB Output is correct
70 Correct 31 ms 11640 KB Output is correct
71 Correct 29 ms 10872 KB Output is correct
72 Correct 30 ms 10360 KB Output is correct
73 Correct 29 ms 10744 KB Output is correct
74 Correct 35 ms 11128 KB Output is correct
75 Correct 34 ms 11384 KB Output is correct
76 Correct 37 ms 11396 KB Output is correct
77 Correct 32 ms 11640 KB Output is correct
78 Correct 31 ms 11144 KB Output is correct
79 Correct 33 ms 11640 KB Output is correct
80 Correct 31 ms 10872 KB Output is correct
81 Correct 31 ms 10488 KB Output is correct
82 Correct 30 ms 10488 KB Output is correct
83 Correct 31 ms 10744 KB Output is correct
84 Correct 36 ms 11020 KB Output is correct
85 Correct 38 ms 11896 KB Output is correct
86 Correct 36 ms 11384 KB Output is correct
87 Correct 38 ms 11272 KB Output is correct
88 Correct 39 ms 11512 KB Output is correct
89 Correct 39 ms 11640 KB Output is correct
90 Correct 39 ms 11896 KB Output is correct
91 Correct 38 ms 11128 KB Output is correct
92 Correct 39 ms 11944 KB Output is correct
93 Correct 38 ms 11384 KB Output is correct
94 Correct 40 ms 12280 KB Output is correct
95 Correct 41 ms 12152 KB Output is correct
96 Correct 38 ms 11256 KB Output is correct
97 Correct 38 ms 11128 KB Output is correct
98 Correct 38 ms 11384 KB Output is correct
99 Correct 39 ms 11512 KB Output is correct
100 Correct 41 ms 12408 KB Output is correct
101 Correct 38 ms 11132 KB Output is correct
102 Correct 38 ms 11400 KB Output is correct