oj.uz

Submission #72948

# Submission time Handle Problem Language Result Execution time Memory
72948 2018-08-27T09:34:53 Z SmsS Wiring (IOI17_wiring) C++17
30 / 100
 1000 ms 9104 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
#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];
	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);
	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);
	}
	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++;
		}
		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++;
		}	
		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:63:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(ind != v[!t].size()) tmp = min(tmp,(ll)v[!t][ind]-x);
      ~~~~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 3 ms 528 KB Output is correct
5 Correct 3 ms 528 KB Output is correct
6 Correct 2 ms 528 KB Output is correct
7 Correct 3 ms 528 KB Output is correct
8 Correct 3 ms 528 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 3 ms 600 KB Output is correct
12 Correct 3 ms 600 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 3 ms 600 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 31 ms 2332 KB Output is correct
4 Correct 34 ms 2388 KB Output is correct
5 Correct 31 ms 2388 KB Output is correct
6 Correct 40 ms 2916 KB Output is correct
7 Correct 41 ms 2916 KB Output is correct
8 Correct 44 ms 2916 KB Output is correct
9 Correct 38 ms 2916 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2916 KB Output is correct
2 Correct 2 ms 2916 KB Output is correct
3 Correct 109 ms 8908 KB Output is correct
4 Correct 94 ms 8976 KB Output is correct
5 Correct 2 ms 8976 KB Output is correct
6 Correct 2 ms 8976 KB Output is correct
7 Correct 2 ms 8976 KB Output is correct
8 Correct 2 ms 8976 KB Output is correct
9 Correct 3 ms 8976 KB Output is correct
10 Correct 2 ms 8976 KB Output is correct
11 Correct 3 ms 8976 KB Output is correct
12 Correct 3 ms 8976 KB Output is correct
13 Correct 2 ms 8976 KB Output is correct
14 Correct 2 ms 8976 KB Output is correct
15 Correct 3 ms 8976 KB Output is correct
16 Correct 3 ms 8976 KB Output is correct
17 Correct 3 ms 8976 KB Output is correct
18 Correct 111 ms 8976 KB Output is correct
19 Correct 88 ms 8980 KB Output is correct
20 Correct 111 ms 8980 KB Output is correct
21 Correct 94 ms 9104 KB Output is correct
22 Correct 108 ms 9104 KB Output is correct
23 Correct 103 ms 9104 KB Output is correct
24 Correct 98 ms 9104 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9104 KB Output is correct
2 Execution timed out 1027 ms 9104 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 3 ms 528 KB Output is correct
5 Correct 3 ms 528 KB Output is correct
6 Correct 2 ms 528 KB Output is correct
7 Correct 3 ms 528 KB Output is correct
8 Correct 3 ms 528 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 3 ms 600 KB Output is correct
12 Correct 3 ms 600 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 2 ms 600 KB Output is correct
19 Correct 31 ms 2332 KB Output is correct
20 Correct 34 ms 2388 KB Output is correct
21 Correct 31 ms 2388 KB Output is correct
22 Correct 40 ms 2916 KB Output is correct
23 Correct 41 ms 2916 KB Output is correct
24 Correct 44 ms 2916 KB Output is correct
25 Correct 38 ms 2916 KB Output is correct
26 Correct 2 ms 2916 KB Output is correct
27 Correct 2 ms 2916 KB Output is correct
28 Correct 109 ms 8908 KB Output is correct
29 Correct 94 ms 8976 KB Output is correct
30 Correct 2 ms 8976 KB Output is correct
31 Correct 2 ms 8976 KB Output is correct
32 Correct 2 ms 8976 KB Output is correct
33 Correct 2 ms 8976 KB Output is correct
34 Correct 3 ms 8976 KB Output is correct
35 Correct 2 ms 8976 KB Output is correct
36 Correct 3 ms 8976 KB Output is correct
37 Correct 3 ms 8976 KB Output is correct
38 Correct 2 ms 8976 KB Output is correct
39 Correct 2 ms 8976 KB Output is correct
40 Correct 3 ms 8976 KB Output is correct
41 Correct 3 ms 8976 KB Output is correct
42 Correct 3 ms 8976 KB Output is correct
43 Correct 111 ms 8976 KB Output is correct
44 Correct 88 ms 8980 KB Output is correct
45 Correct 111 ms 8980 KB Output is correct
46 Correct 94 ms 9104 KB Output is correct
47 Correct 108 ms 9104 KB Output is correct
48 Correct 103 ms 9104 KB Output is correct
49 Correct 98 ms 9104 KB Output is correct
50 Correct 3 ms 9104 KB Output is correct
51 Execution timed out 1027 ms 9104 KB Time limit exceeded
52 Halted 0 ms 0 KB -