oj.uz

Submission #72954

# Submission time Handle Problem Language Result Execution time Memory
72954 2018-08-27T09:43:00 Z SmsS Wiring (IOI17_wiring) C++17
100 / 100
 139 ms 12320 KB 
#include<bits/stdc++.h>
using namespace std;
#define for2(a,b,c) for(int a=b;a<c;a++)
#define ll long long
#include "wiring.h"

ll sub2(vector<int> r,vector<int> b){
	ll res = 0;
	int L = 0;
	int R = b.size()-1;
	while(L != r.size() && R != -1){
		res += b[R]-r[L];
		L++;
		R--;
	}
	while(R != -1){
		res += b[R]-r[L-1];
		R--;
	}
	while(L != r.size()){
		res += b[R+1]-r[L];
		L++;
	}
	return res;
}

#define PII pair<int,int>
#define F first
#define S second
#define pb push_back
const int EN = 1e9;
#define all(x) (x).begin(),(x).end()
const int maxn = 200100;
ll dp[maxn];
ll sub3(vector<int> v1,vector<int> v2){
	vector<int> v[2];
	vector<PII> V;
	vector<int> par[2];
	vector<ll> jam[2];
	
	for(auto x : v1) {
		v[0].pb(x);
		V.pb({x,0});
	}
	for(auto x : v2){
		v[1].pb(x);
		V.pb({x,1});
	}
	sort(all(V));
	int n = V.size();

	par[0].resize(n+1);
	par[1].resize(n+1);
	jam[0].resize(n+1);
	jam[1].resize(n+1);
	for2(i,0,n){
		par[0][i+1] = par[0][i] + (V[i].S==0);
		par[1][i+1] = par[1][i] + (V[i].S==1);
		jam[0][i+1] = jam[0][i] + V[i].F;
	}
	for2(i,0,n){
		int x = V[i].F;
		bool t = V[i].S;

		dp[i] = 1e18;
		
		ll tmp = 1e18;
		int ind =  lower_bound(all(v[!t]),x)-v[!t].begin();
		if(ind != v[!t].size()) tmp = min(tmp,(ll)v[!t][ind]-x);
		ind --;
		if(ind >= 0)            tmp = min(tmp,(ll)x-v[!t][ind]);
		if(i) tmp += dp[i-1];
		dp[i] = tmp;	
		

		int st = -1;
		int en = i;
		while(st != en-1){
			int mid = (st+en)/2;
			if(par[!t][i+1]-par[!t][mid] == 0) en = mid;
			else st = mid;
		}
		int cnt = i-en+1;
		if(en-cnt < 0 || par[t][en]-par[t][en-cnt]) continue;
		tmp = 0;
		ll k = 0;
/*		for(int j = i; j >= i-cnt; j--){
			if(j != i) tmp += k*(V[j+1].F-V[j].F);
			k++;
		}*/
		tmp = jam[0][i+1]-jam[0][i+1-cnt];
		tmp -= (ll)V[i-cnt].F*cnt;

/*		k = 0;
		for(int j = i-cnt*2+1; j <= i-cnt; j++){
			if(j != i-2*cnt+1) tmp += k*(V[j].F-V[j-1].F);
			k++;
		}	*/
		ll z = jam[0][i-cnt+1]-jam[0][i-cnt*2+1];
		z = (ll)cnt*EN-z;
		z -= (ll)cnt*(EN-V[i-cnt].F);
		tmp += z;
		dp[i] = min(dp[i],dp[i-2*cnt]+tmp);
	}
	return dp[V.size()-1];
}

long long min_total_length(std::vector<int> r, std::vector<int> b) {
	if(r.back() < b[0]) return sub2(r,b);
	return sub3(r,b);
}

Compilation message

wiring.cpp: In function 'long long int sub2(std::vector<int>, std::vector<int>)':
wiring.cpp:11:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(L != r.size() && R != -1){
        ~~^~~~~~~~~~~
wiring.cpp:20:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(L != r.size()){
        ~~^~~~~~~~~~~
wiring.cpp: In function 'long long int sub3(std::vector<int>, std::vector<int>)':
wiring.cpp:69:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(ind != v[!t].size()) tmp = min(tmp,(ll)v[!t][ind]-x);
      ~~~~^~~~~~~~~~~~~~~
wiring.cpp:86:6: warning: unused variable 'k' [-Wunused-variable]
   ll k = 0;
      ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 3 ms 588 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 3 ms 588 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 2 ms 624 KB Output is correct
14 Correct 3 ms 624 KB Output is correct
15 Correct 2 ms 624 KB Output is correct
16 Correct 2 ms 624 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 624 KB Output is correct
2 Correct 2 ms 624 KB Output is correct
3 Correct 38 ms 2284 KB Output is correct
4 Correct 49 ms 2284 KB Output is correct
5 Correct 31 ms 2284 KB Output is correct
6 Correct 39 ms 2924 KB Output is correct
7 Correct 70 ms 2924 KB Output is correct
8 Correct 48 ms 2924 KB Output is correct
9 Correct 57 ms 2940 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2940 KB Output is correct
2 Correct 3 ms 2940 KB Output is correct
3 Correct 103 ms 11980 KB Output is correct
4 Correct 94 ms 12036 KB Output is correct
5 Correct 2 ms 12036 KB Output is correct
6 Correct 3 ms 12036 KB Output is correct
7 Correct 2 ms 12036 KB Output is correct
8 Correct 3 ms 12036 KB Output is correct
9 Correct 2 ms 12036 KB Output is correct
10 Correct 2 ms 12036 KB Output is correct
11 Correct 2 ms 12036 KB Output is correct
12 Correct 2 ms 12036 KB Output is correct
13 Correct 2 ms 12036 KB Output is correct
14 Correct 3 ms 12036 KB Output is correct
15 Correct 2 ms 12036 KB Output is correct
16 Correct 2 ms 12036 KB Output is correct
17 Correct 2 ms 12036 KB Output is correct
18 Correct 108 ms 12212 KB Output is correct
19 Correct 102 ms 12212 KB Output is correct
20 Correct 139 ms 12212 KB Output is correct
21 Correct 115 ms 12212 KB Output is correct
22 Correct 103 ms 12212 KB Output is correct
23 Correct 98 ms 12212 KB Output is correct
24 Correct 101 ms 12212 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12212 KB Output is correct
2 Correct 82 ms 12212 KB Output is correct
3 Correct 95 ms 12212 KB Output is correct
4 Correct 93 ms 12212 KB Output is correct
5 Correct 97 ms 12212 KB Output is correct
6 Correct 2 ms 12212 KB Output is correct
7 Correct 2 ms 12212 KB Output is correct
8 Correct 3 ms 12212 KB Output is correct
9 Correct 2 ms 12212 KB Output is correct
10 Correct 2 ms 12212 KB Output is correct
11 Correct 3 ms 12212 KB Output is correct
12 Correct 2 ms 12212 KB Output is correct
13 Correct 2 ms 12212 KB Output is correct
14 Correct 2 ms 12212 KB Output is correct
15 Correct 2 ms 12212 KB Output is correct
16 Correct 2 ms 12212 KB Output is correct
17 Correct 2 ms 12212 KB Output is correct
18 Correct 90 ms 12212 KB Output is correct
19 Correct 85 ms 12212 KB Output is correct
20 Correct 81 ms 12212 KB Output is correct
21 Correct 83 ms 12212 KB Output is correct
22 Correct 75 ms 12212 KB Output is correct
23 Correct 78 ms 12212 KB Output is correct
24 Correct 83 ms 12212 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 3 ms 588 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 3 ms 588 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 2 ms 624 KB Output is correct
14 Correct 3 ms 624 KB Output is correct
15 Correct 2 ms 624 KB Output is correct
16 Correct 2 ms 624 KB Output is correct
17 Correct 2 ms 624 KB Output is correct
18 Correct 2 ms 624 KB Output is correct
19 Correct 38 ms 2284 KB Output is correct
20 Correct 49 ms 2284 KB Output is correct
21 Correct 31 ms 2284 KB Output is correct
22 Correct 39 ms 2924 KB Output is correct
23 Correct 70 ms 2924 KB Output is correct
24 Correct 48 ms 2924 KB Output is correct
25 Correct 57 ms 2940 KB Output is correct
26 Correct 2 ms 2940 KB Output is correct
27 Correct 3 ms 2940 KB Output is correct
28 Correct 103 ms 11980 KB Output is correct
29 Correct 94 ms 12036 KB Output is correct
30 Correct 2 ms 12036 KB Output is correct
31 Correct 3 ms 12036 KB Output is correct
32 Correct 2 ms 12036 KB Output is correct
33 Correct 3 ms 12036 KB Output is correct
34 Correct 2 ms 12036 KB Output is correct
35 Correct 2 ms 12036 KB Output is correct
36 Correct 2 ms 12036 KB Output is correct
37 Correct 2 ms 12036 KB Output is correct
38 Correct 2 ms 12036 KB Output is correct
39 Correct 3 ms 12036 KB Output is correct
40 Correct 2 ms 12036 KB Output is correct
41 Correct 2 ms 12036 KB Output is correct
42 Correct 2 ms 12036 KB Output is correct
43 Correct 108 ms 12212 KB Output is correct
44 Correct 102 ms 12212 KB Output is correct
45 Correct 139 ms 12212 KB Output is correct
46 Correct 115 ms 12212 KB Output is correct
47 Correct 103 ms 12212 KB Output is correct
48 Correct 98 ms 12212 KB Output is correct
49 Correct 101 ms 12212 KB Output is correct
50 Correct 2 ms 12212 KB Output is correct
51 Correct 82 ms 12212 KB Output is correct
52 Correct 95 ms 12212 KB Output is correct
53 Correct 93 ms 12212 KB Output is correct
54 Correct 97 ms 12212 KB Output is correct
55 Correct 2 ms 12212 KB Output is correct
56 Correct 2 ms 12212 KB Output is correct
57 Correct 3 ms 12212 KB Output is correct
58 Correct 2 ms 12212 KB Output is correct
59 Correct 2 ms 12212 KB Output is correct
60 Correct 3 ms 12212 KB Output is correct
61 Correct 2 ms 12212 KB Output is correct
62 Correct 2 ms 12212 KB Output is correct
63 Correct 2 ms 12212 KB Output is correct
64 Correct 2 ms 12212 KB Output is correct
65 Correct 2 ms 12212 KB Output is correct
66 Correct 2 ms 12212 KB Output is correct
67 Correct 90 ms 12212 KB Output is correct
68 Correct 85 ms 12212 KB Output is correct
69 Correct 81 ms 12212 KB Output is correct
70 Correct 83 ms 12212 KB Output is correct
71 Correct 75 ms 12212 KB Output is correct
72 Correct 78 ms 12212 KB Output is correct
73 Correct 83 ms 12212 KB Output is correct
74 Correct 74 ms 12212 KB Output is correct
75 Correct 88 ms 12212 KB Output is correct
76 Correct 109 ms 12212 KB Output is correct
77 Correct 79 ms 12212 KB Output is correct
78 Correct 77 ms 12212 KB Output is correct
79 Correct 109 ms 12212 KB Output is correct
80 Correct 72 ms 12212 KB Output is correct
81 Correct 73 ms 12212 KB Output is correct
82 Correct 72 ms 12212 KB Output is correct
83 Correct 78 ms 12212 KB Output is correct
84 Correct 77 ms 12212 KB Output is correct
85 Correct 99 ms 12212 KB Output is correct
86 Correct 99 ms 12212 KB Output is correct
87 Correct 98 ms 12212 KB Output is correct
88 Correct 92 ms 12212 KB Output is correct
89 Correct 79 ms 12212 KB Output is correct
90 Correct 96 ms 12212 KB Output is correct
91 Correct 81 ms 12212 KB Output is correct
92 Correct 91 ms 12212 KB Output is correct
93 Correct 80 ms 12320 KB Output is correct
94 Correct 80 ms 12320 KB Output is correct
95 Correct 89 ms 12320 KB Output is correct
96 Correct 83 ms 12320 KB Output is correct
97 Correct 75 ms 12320 KB Output is correct
98 Correct 86 ms 12320 KB Output is correct
99 Correct 81 ms 12320 KB Output is correct
100 Correct 108 ms 12320 KB Output is correct
101 Correct 108 ms 12320 KB Output is correct
102 Correct 112 ms 12320 KB Output is correct