oj.uz

Submission #328259

# Submission time Handle Problem Language Result Execution time Memory
328259 2020-11-16T02:52:07 Z arnold518 Wiring (IOI17_wiring) C++14
100 / 100
 61 ms 19936 KB 
#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2e5;
const ll INF = 1e18;

int N;
pll A[MAXN+10];
ll L[MAXN+10], R[MAXN+10];
ll L2[MAXN+10], R2[MAXN+10];
ll L3[MAXN+10], R3[MAXN+10];
ll dp[MAXN+10];

ll min_total_length(vector<int> _R, vector<int> _B)
{
	N=_R.size()+_B.size();
	for(int i=0; i<_R.size(); i++) A[i+1]={_R[i], 0};
	for(int i=0; i<_B.size(); i++) A[i+_R.size()+1]={_B[i], 1};

	sort(A+1, A+N+1);

	A[0]=A[1];
	A[N+1]=A[N];
	
	pll bef={-1, -1};
	for(int i=1; i<=N; i++)
	{
		if(bef.second!=A[i].second)
		{
			bef=A[i];
			L2[i]=A[i].first-A[i-1].first;
			L3[i]=1;
		}
		else
		{
			L[i]+=L[i-1];
			L2[i]=L2[i-1];
			L3[i]=L3[i-1]+1;
		}
		L[i]+=A[i].first-bef.first;
	}

	bef={-1, -1};
	for(int i=N; i>=1; i--)
	{
		if(bef.second!=A[i].second)
		{
			bef=A[i];
			R2[i]=A[i+1].first-A[i].first;
			R3[i]=1;
		}
		else
		{
			R[i]+=R[i+1];
			R2[i]=R2[i+1];
			R3[i]=R3[i+1]+1;
		}
		R[i]+=bef.first-A[i].first;
	}

	for(int i=1; i<=N; i++) dp[i]=INF;
	dp[0]=0;

	vector<ll> V1, V2;
	for(int i=1; i<=N;)
	{
		int col=A[i].second;
		int l=i, r=i;
		for(; i<=N && A[i].second==col; i++) r=i;

		if(!V1.empty())
		{
			for(int j=l; j<=r; j++)
			{
				int t=j-l;

				dp[j]=min(dp[j], L[j]+L3[j]*L2[j]+V2[min((int)V2.size()-1, t)]);
				if(t<V1.size()) dp[j]=min(dp[j], L[j]+V1[t]);
			}
		}

		V1.clear(); V2.clear();
		for(int j=l; j<=r; j++)
		{
			V1.push_back(min(dp[j], dp[j-1])+R3[j]*R2[j]+R[j]);
			V2.push_back(min(dp[j], dp[j-1])+R[j]);
		}
		for(int j=1; j<V1.size(); j++) V1[j]=min(V1[j-1], V1[j]);
		for(int j=V1.size()-2; j>=0; j--) V2[j]=min(V2[j+1], V2[j]);
		reverse(V1.begin(), V1.end());
		reverse(V2.begin(), V2.end());
	}
	return dp[N];
}

Compilation message

wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:22:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |  for(int i=0; i<_R.size(); i++) A[i+1]={_R[i], 0};
      |               ~^~~~~~~~~~
wiring.cpp:23:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |  for(int i=0; i<_B.size(); i++) A[i+_R.size()+1]={_B[i], 1};
      |               ~^~~~~~~~~~
wiring.cpp:83:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     if(t<V1.size()) dp[j]=min(dp[j], L[j]+V1[t]);
      |        ~^~~~~~~~~~
wiring.cpp:93:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |   for(int j=1; j<V1.size(); j++) V1[j]=min(V1[j-1], V1[j]);
      |                ~^~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 36 ms 13880 KB Output is correct
4 Correct 34 ms 13912 KB Output is correct
5 Correct 36 ms 13912 KB Output is correct
6 Correct 46 ms 17760 KB Output is correct
7 Correct 46 ms 17780 KB Output is correct
8 Correct 52 ms 17760 KB Output is correct
9 Correct 46 ms 17760 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 60 ms 15980 KB Output is correct
4 Correct 59 ms 17516 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 57 ms 17900 KB Output is correct
19 Correct 58 ms 18028 KB Output is correct
20 Correct 61 ms 17900 KB Output is correct
21 Correct 57 ms 17900 KB Output is correct
22 Correct 58 ms 17900 KB Output is correct
23 Correct 59 ms 17900 KB Output is correct
24 Correct 58 ms 17900 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 49 ms 16236 KB Output is correct
3 Correct 53 ms 15980 KB Output is correct
4 Correct 58 ms 16236 KB Output is correct
5 Correct 52 ms 15980 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 53 ms 18280 KB Output is correct
19 Correct 52 ms 17260 KB Output is correct
20 Correct 50 ms 17388 KB Output is correct
21 Correct 49 ms 17772 KB Output is correct
22 Correct 52 ms 19040 KB Output is correct
23 Correct 47 ms 19040 KB Output is correct
24 Correct 55 ms 19068 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 36 ms 13880 KB Output is correct
20 Correct 34 ms 13912 KB Output is correct
21 Correct 36 ms 13912 KB Output is correct
22 Correct 46 ms 17760 KB Output is correct
23 Correct 46 ms 17780 KB Output is correct
24 Correct 52 ms 17760 KB Output is correct
25 Correct 46 ms 17760 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 60 ms 15980 KB Output is correct
29 Correct 59 ms 17516 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 57 ms 17900 KB Output is correct
44 Correct 58 ms 18028 KB Output is correct
45 Correct 61 ms 17900 KB Output is correct
46 Correct 57 ms 17900 KB Output is correct
47 Correct 58 ms 17900 KB Output is correct
48 Correct 59 ms 17900 KB Output is correct
49 Correct 58 ms 17900 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 49 ms 16236 KB Output is correct
52 Correct 53 ms 15980 KB Output is correct
53 Correct 58 ms 16236 KB Output is correct
54 Correct 52 ms 15980 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 1 ms 364 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 1 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 53 ms 18280 KB Output is correct
68 Correct 52 ms 17260 KB Output is correct
69 Correct 50 ms 17388 KB Output is correct
70 Correct 49 ms 17772 KB Output is correct
71 Correct 52 ms 19040 KB Output is correct
72 Correct 47 ms 19040 KB Output is correct
73 Correct 55 ms 19068 KB Output is correct
74 Correct 54 ms 19680 KB Output is correct
75 Correct 54 ms 18536 KB Output is correct
76 Correct 56 ms 19680 KB Output is correct
77 Correct 51 ms 18556 KB Output is correct
78 Correct 53 ms 19168 KB Output is correct
79 Correct 53 ms 18528 KB Output is correct
80 Correct 46 ms 19040 KB Output is correct
81 Correct 50 ms 19168 KB Output is correct
82 Correct 45 ms 19180 KB Output is correct
83 Correct 46 ms 19296 KB Output is correct
84 Correct 47 ms 19680 KB Output is correct
85 Correct 54 ms 18920 KB Output is correct
86 Correct 48 ms 19680 KB Output is correct
87 Correct 50 ms 19680 KB Output is correct
88 Correct 51 ms 19040 KB Output is correct
89 Correct 50 ms 19168 KB Output is correct
90 Correct 57 ms 19040 KB Output is correct
91 Correct 50 ms 19680 KB Output is correct
92 Correct 51 ms 19680 KB Output is correct
93 Correct 50 ms 19680 KB Output is correct
94 Correct 56 ms 19808 KB Output is correct
95 Correct 55 ms 19040 KB Output is correct
96 Correct 49 ms 19680 KB Output is correct
97 Correct 49 ms 19680 KB Output is correct
98 Correct 51 ms 19680 KB Output is correct
99 Correct 51 ms 19740 KB Output is correct
100 Correct 59 ms 19680 KB Output is correct
101 Correct 52 ms 19936 KB Output is correct
102 Correct 55 ms 19680 KB Output is correct