oj.uz

Submission #739864

# Submission time Handle Problem Language Result Execution time Memory
739864 2023-05-11T12:55:48 Z sentheta Wiring (IOI17_wiring) C++17
100 / 100
 39 ms 11804 KB 
#include "wiring.h"
#include<vector>
#include<iostream>
#include<algorithm>
#include<utility>
using namespace std;
#define Int long long
#define rep(i,a,b) for(Int i=a; i<(Int)b; i++)
#define V vector
#define nl '\n'
#define _ << " " << 
#define dbg(x) cout << "?" << #x << " : " << x << endl;

const Int INF = 1e18;
const Int N = 2e5+5;

Int n, m;
V<Int> a, t;

Int prf[N];
Int rgsum(Int l,Int r){
	return prf[r] - prf[l-1];
}

Int dp[N];

// 
Int b[N], c[N];

Int min_total_length(V<int> red,V<int> blue){
	n = red.size(); m = blue.size();

	a = t = {-1};
	{
		Int i=0, j=0;
		while(i<n && j<m){
			if(red[i] < blue[j]){
				a.push_back(red[i++]); t.push_back(0);
			}
			else{
				a.push_back(blue[j++]); t.push_back(1);
			}
		}
		while(i<n){
			a.push_back(red[i++]); t.push_back(0);
		}
		while(j<m){
			a.push_back(blue[j++]); t.push_back(1);
		}
	}
	// cout << "a[] ";
	rep(i,1,n+m+1){
		prf[i] = prf[i-1] + a[i];
		// cout << a[i] << " ";
	}
	// cout << nl;

	dp[0] = 0;
	rep(i,1,n+m+1) dp[i] = INF;

	for(Int l=1,r=1; l<=n+m; l=r+1){
		r = l;
		while(r+1<=n+m && t[r+1]==t[l]) r++;
		if(l==1) continue;
		// cout << "lr" _ l _ r << nl;

		Int mxlef = 0;
		for(Int j=l-1; t[j]==t[l-1]; j--){
			Int lef = l-1 - j + 1;
			mxlef = lef;

			Int cost = min(dp[j-1],dp[j])
						+ lef*a[l-1] - rgsum(j,l-1);
			b[lef] = cost + lef*(a[l]-a[l-1]);
			c[lef] = cost;
		}
		for(Int lef=mxlef-1; lef>=1; lef--){
			b[lef] = min(b[lef], b[lef+1]);
		}
		for(Int lef=2; lef<=mxlef; lef++){
			c[lef] = min(c[lef], c[lef-1]);
		}

		for(Int i=l; i<=r; i++){
			Int rig = i - l + 1;

			dp[i] = min({
				mxlef>=rig ? b[rig] + rgsum(l,i) - rig*a[l] : INF,
				c[min(mxlef,rig)] + rig*(a[l]-a[l-1]) + rgsum(l,i) - rig*a[l]
			});

			// cout << i _ dp[i] << nl;
		}

		// cout << nl;
	}

	// dp[i] = min({
	// 	dp[i],
	// 	min(dp[j-1],dp[j])
	// 	+ lef*a[l-1] - rgsum(j,l-1)
	// 	+ max(lef,rig)*(a[l]-a[l-1])
	// 	+ rgsum(l,i) - rig*a[l]
	// });
	
	Int ans = dp[n+m];
	return ans;
}

Subtask #1
7.0 / 7.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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 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 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 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 20 ms 7896 KB Output is correct
4 Correct 21 ms 9304 KB Output is correct
5 Correct 22 ms 8528 KB Output is correct
6 Correct 27 ms 11804 KB Output is correct
7 Correct 30 ms 11796 KB Output is correct
8 Correct 28 ms 11804 KB Output is correct
9 Correct 29 ms 11804 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 27 ms 8376 KB Output is correct
4 Correct 25 ms 8380 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 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 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 28 ms 8248 KB Output is correct
19 Correct 28 ms 8248 KB Output is correct
20 Correct 29 ms 8372 KB Output is correct
21 Correct 30 ms 8376 KB Output is correct
22 Correct 28 ms 8376 KB Output is correct
23 Correct 28 ms 8240 KB Output is correct
24 Correct 28 ms 8376 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 24 ms 8500 KB Output is correct
3 Correct 27 ms 9596 KB Output is correct
4 Correct 25 ms 9620 KB Output is correct
5 Correct 28 ms 9500 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 26 ms 10136 KB Output is correct
19 Correct 25 ms 9504 KB Output is correct
20 Correct 25 ms 9636 KB Output is correct
21 Correct 24 ms 9888 KB Output is correct
22 Correct 28 ms 10928 KB Output is correct
23 Correct 24 ms 10928 KB Output is correct
24 Correct 24 ms 10672 KB Output is correct

Subtask #5
45.0 / 45.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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 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 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 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 20 ms 7896 KB Output is correct
20 Correct 21 ms 9304 KB Output is correct
21 Correct 22 ms 8528 KB Output is correct
22 Correct 27 ms 11804 KB Output is correct
23 Correct 30 ms 11796 KB Output is correct
24 Correct 28 ms 11804 KB Output is correct
25 Correct 29 ms 11804 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 27 ms 8376 KB Output is correct
29 Correct 25 ms 8380 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 28 ms 8248 KB Output is correct
44 Correct 28 ms 8248 KB Output is correct
45 Correct 29 ms 8372 KB Output is correct
46 Correct 30 ms 8376 KB Output is correct
47 Correct 28 ms 8376 KB Output is correct
48 Correct 28 ms 8240 KB Output is correct
49 Correct 28 ms 8376 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 24 ms 8500 KB Output is correct
52 Correct 27 ms 9596 KB Output is correct
53 Correct 25 ms 9620 KB Output is correct
54 Correct 28 ms 9500 KB Output is correct
55 Correct 1 ms 308 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 308 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 0 ms 340 KB Output is correct
64 Correct 0 ms 340 KB Output is correct
65 Correct 1 ms 308 KB Output is correct
66 Correct 1 ms 316 KB Output is correct
67 Correct 26 ms 10136 KB Output is correct
68 Correct 25 ms 9504 KB Output is correct
69 Correct 25 ms 9636 KB Output is correct
70 Correct 24 ms 9888 KB Output is correct
71 Correct 28 ms 10928 KB Output is correct
72 Correct 24 ms 10928 KB Output is correct
73 Correct 24 ms 10672 KB Output is correct
74 Correct 32 ms 11552 KB Output is correct
75 Correct 26 ms 10708 KB Output is correct
76 Correct 31 ms 11312 KB Output is correct
77 Correct 26 ms 10740 KB Output is correct
78 Correct 28 ms 10788 KB Output is correct
79 Correct 25 ms 10664 KB Output is correct
80 Correct 25 ms 10784 KB Output is correct
81 Correct 24 ms 11184 KB Output is correct
82 Correct 25 ms 11184 KB Output is correct
83 Correct 25 ms 11180 KB Output is correct
84 Correct 28 ms 11680 KB Output is correct
85 Correct 29 ms 11048 KB Output is correct
86 Correct 32 ms 11292 KB Output is correct
87 Correct 39 ms 11540 KB Output is correct
88 Correct 28 ms 11160 KB Output is correct
89 Correct 26 ms 11176 KB Output is correct
90 Correct 27 ms 11164 KB Output is correct
91 Correct 27 ms 11544 KB Output is correct
92 Correct 27 ms 11312 KB Output is correct
93 Correct 27 ms 11304 KB Output is correct
94 Correct 35 ms 11440 KB Output is correct
95 Correct 27 ms 11052 KB Output is correct
96 Correct 26 ms 11420 KB Output is correct
97 Correct 27 ms 11696 KB Output is correct
98 Correct 28 ms 11688 KB Output is correct
99 Correct 27 ms 11564 KB Output is correct
100 Correct 27 ms 11312 KB Output is correct
101 Correct 26 ms 11556 KB Output is correct
102 Correct 27 ms 11424 KB Output is correct