oj.uz

답안 #72939

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
72939 2018-08-27T09:14:30 Z mr_banana 전선 연결 (IOI17_wiring) C++17
100 / 100
 320 ms 18484 KB 
#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;
const int MN=2e5+100;
const long long inf=1e15;
long long dp[MN];
long long seg[4*MN],lazy[4*MN];
int bck[MN],fr[MN];
long cbck[MN],cfr[MN];
int n,len,m;
void shift(int v){
	seg[2*v]+=lazy[v];
	lazy[2*v]+=lazy[v];
	seg[2*v+1]+=lazy[v];
	lazy[2*v+1]+=lazy[v];
	lazy[v]=0;
}
void add(int l,int r,long long val,int v=1,int s=0,int e=len+1){
	if(l<=s && e<=r){
		seg[v]+=val;
		lazy[v]+=val;
		return;
	}
	if(l>=e || s>=r){
		return;
	}
	shift(v);
	int mid=(s+e)/2;
	add(l,r,val,2*v,s,mid);
	add(l,r,val,2*v+1,mid,e);
	seg[v]=min(seg[2*v],seg[2*v+1]);
}
void st(int p,long long val,int v=1,int s=0,int e=len+1){
	if(e-s<2){
		seg[v]=min(seg[v],val);
		return;
	}
	shift(v);
	int mid=(s+e)/2;
	if(p<mid){
		st(p,val,2*v,s,mid);
	}
	else{
		st(p,val,2*v+1,mid,e);
	}
}
long long get(int l,int r,int v=1,int s=0,int e=len+1){
	if(l<=s && e<=r){
		return seg[v];
	}
	if(l>=e || s>=r){
		return inf;
	}
	shift(v);
	int mid=(s+e)/2;
	return min(get(l,r,2*v,s,mid),get(l,r,2*v+1,mid,e));
}
long long min_total_length(vector<int> r, vector<int> b) {
	n=r.size(),m=b.size();
	vector<pair<int,int>> po;
	for(int i:r){
		po.push_back({i,0});
	}
	for(int i:b){
		po.push_back({i,1});
	}
	sort(po.begin(),po.end());
	len=n+m;
	for(int i=0;i<len;i++){
		if(i>0 && po[i-1].second==po[i].second){
			bck[i]=bck[i-1];
			cbck[i]=cbck[i-1]+po[i].first-po[bck[i]].first;
		}
		else{
			bck[i]=i;
			cbck[i]=0;
		}
	}
	for(int i=len-1;i>=0;i--){
		if(i+1<len && po[i+1].second==po[i].second){
			fr[i]=fr[i+1];
			cfr[i]=cfr[i+1]+po[fr[i]].first-po[i].first;
		}
		else{
			fr[i]=i;
			cfr[i]=0;
		}
	}
	dp[0]=0;
	add(0,1,dp[0]+cfr[0]+1ll*(po[fr[0]+1].first-po[fr[0]].first)*(fr[0]+1));
	for(int i=0;i<len;i++){
		int x=bck[i];
		if(x==0){
			dp[i+1]=inf;
		}
		else{
			int y=bck[x-1];
			add(max(2*x-i,y),x,po[x].first-po[x-1].first);
			dp[i+1]=get(y,x)+cbck[i];
		}
		if(fr[i+1]+1<len){
			add(i+1,i+2,dp[i+1]+cfr[i+1]+1ll*(fr[i+1]-i)*(po[fr[i+1]+1].first-po[fr[i+1]].first));
		}
		if(fr[i]==bck[i] && fr[i]+1<len){
			st(i,dp[i+1]+po[fr[i]+1].first-po[fr[i]].first);
		}
	}
	return dp[len];
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 432 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 2 ms 608 KB Output is correct
12 Correct 2 ms 608 KB Output is correct
13 Correct 2 ms 608 KB Output is correct
14 Correct 2 ms 616 KB Output is correct
15 Correct 3 ms 664 KB Output is correct
16 Correct 3 ms 664 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 664 KB Output is correct
2 Correct 3 ms 664 KB Output is correct
3 Correct 92 ms 13276 KB Output is correct
4 Correct 90 ms 13404 KB Output is correct
5 Correct 121 ms 13404 KB Output is correct
6 Correct 137 ms 14300 KB Output is correct
7 Correct 165 ms 14300 KB Output is correct
8 Correct 112 ms 14300 KB Output is correct
9 Correct 121 ms 14300 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14300 KB Output is correct
2 Correct 2 ms 14300 KB Output is correct
3 Correct 235 ms 18336 KB Output is correct
4 Correct 224 ms 18396 KB Output is correct
5 Correct 2 ms 18396 KB Output is correct
6 Correct 2 ms 18396 KB Output is correct
7 Correct 3 ms 18396 KB Output is correct
8 Correct 3 ms 18396 KB Output is correct
9 Correct 3 ms 18396 KB Output is correct
10 Correct 2 ms 18396 KB Output is correct
11 Correct 3 ms 18396 KB Output is correct
12 Correct 2 ms 18396 KB Output is correct
13 Correct 3 ms 18396 KB Output is correct
14 Correct 2 ms 18396 KB Output is correct
15 Correct 2 ms 18396 KB Output is correct
16 Correct 2 ms 18396 KB Output is correct
17 Correct 3 ms 18396 KB Output is correct
18 Correct 230 ms 18412 KB Output is correct
19 Correct 231 ms 18412 KB Output is correct
20 Correct 241 ms 18412 KB Output is correct
21 Correct 317 ms 18412 KB Output is correct
22 Correct 231 ms 18412 KB Output is correct
23 Correct 216 ms 18412 KB Output is correct
24 Correct 238 ms 18412 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 18412 KB Output is correct
2 Correct 306 ms 18412 KB Output is correct
3 Correct 208 ms 18412 KB Output is correct
4 Correct 238 ms 18412 KB Output is correct
5 Correct 237 ms 18484 KB Output is correct
6 Correct 2 ms 18484 KB Output is correct
7 Correct 3 ms 18484 KB Output is correct
8 Correct 2 ms 18484 KB Output is correct
9 Correct 3 ms 18484 KB Output is correct
10 Correct 2 ms 18484 KB Output is correct
11 Correct 3 ms 18484 KB Output is correct
12 Correct 2 ms 18484 KB Output is correct
13 Correct 2 ms 18484 KB Output is correct
14 Correct 2 ms 18484 KB Output is correct
15 Correct 2 ms 18484 KB Output is correct
16 Correct 2 ms 18484 KB Output is correct
17 Correct 3 ms 18484 KB Output is correct
18 Correct 215 ms 18484 KB Output is correct
19 Correct 254 ms 18484 KB Output is correct
20 Correct 219 ms 18484 KB Output is correct
21 Correct 259 ms 18484 KB Output is correct
22 Correct 189 ms 18484 KB Output is correct
23 Correct 174 ms 18484 KB Output is correct
24 Correct 189 ms 18484 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 432 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 2 ms 608 KB Output is correct
12 Correct 2 ms 608 KB Output is correct
13 Correct 2 ms 608 KB Output is correct
14 Correct 2 ms 616 KB Output is correct
15 Correct 3 ms 664 KB Output is correct
16 Correct 3 ms 664 KB Output is correct
17 Correct 2 ms 664 KB Output is correct
18 Correct 3 ms 664 KB Output is correct
19 Correct 92 ms 13276 KB Output is correct
20 Correct 90 ms 13404 KB Output is correct
21 Correct 121 ms 13404 KB Output is correct
22 Correct 137 ms 14300 KB Output is correct
23 Correct 165 ms 14300 KB Output is correct
24 Correct 112 ms 14300 KB Output is correct
25 Correct 121 ms 14300 KB Output is correct
26 Correct 2 ms 14300 KB Output is correct
27 Correct 2 ms 14300 KB Output is correct
28 Correct 235 ms 18336 KB Output is correct
29 Correct 224 ms 18396 KB Output is correct
30 Correct 2 ms 18396 KB Output is correct
31 Correct 2 ms 18396 KB Output is correct
32 Correct 3 ms 18396 KB Output is correct
33 Correct 3 ms 18396 KB Output is correct
34 Correct 3 ms 18396 KB Output is correct
35 Correct 2 ms 18396 KB Output is correct
36 Correct 3 ms 18396 KB Output is correct
37 Correct 2 ms 18396 KB Output is correct
38 Correct 3 ms 18396 KB Output is correct
39 Correct 2 ms 18396 KB Output is correct
40 Correct 2 ms 18396 KB Output is correct
41 Correct 2 ms 18396 KB Output is correct
42 Correct 3 ms 18396 KB Output is correct
43 Correct 230 ms 18412 KB Output is correct
44 Correct 231 ms 18412 KB Output is correct
45 Correct 241 ms 18412 KB Output is correct
46 Correct 317 ms 18412 KB Output is correct
47 Correct 231 ms 18412 KB Output is correct
48 Correct 216 ms 18412 KB Output is correct
49 Correct 238 ms 18412 KB Output is correct
50 Correct 2 ms 18412 KB Output is correct
51 Correct 306 ms 18412 KB Output is correct
52 Correct 208 ms 18412 KB Output is correct
53 Correct 238 ms 18412 KB Output is correct
54 Correct 237 ms 18484 KB Output is correct
55 Correct 2 ms 18484 KB Output is correct
56 Correct 3 ms 18484 KB Output is correct
57 Correct 2 ms 18484 KB Output is correct
58 Correct 3 ms 18484 KB Output is correct
59 Correct 2 ms 18484 KB Output is correct
60 Correct 3 ms 18484 KB Output is correct
61 Correct 2 ms 18484 KB Output is correct
62 Correct 2 ms 18484 KB Output is correct
63 Correct 2 ms 18484 KB Output is correct
64 Correct 2 ms 18484 KB Output is correct
65 Correct 2 ms 18484 KB Output is correct
66 Correct 3 ms 18484 KB Output is correct
67 Correct 215 ms 18484 KB Output is correct
68 Correct 254 ms 18484 KB Output is correct
69 Correct 219 ms 18484 KB Output is correct
70 Correct 259 ms 18484 KB Output is correct
71 Correct 189 ms 18484 KB Output is correct
72 Correct 174 ms 18484 KB Output is correct
73 Correct 189 ms 18484 KB Output is correct
74 Correct 185 ms 18484 KB Output is correct
75 Correct 265 ms 18484 KB Output is correct
76 Correct 199 ms 18484 KB Output is correct
77 Correct 295 ms 18484 KB Output is correct
78 Correct 245 ms 18484 KB Output is correct
79 Correct 320 ms 18484 KB Output is correct
80 Correct 221 ms 18484 KB Output is correct
81 Correct 269 ms 18484 KB Output is correct
82 Correct 205 ms 18484 KB Output is correct
83 Correct 254 ms 18484 KB Output is correct
84 Correct 196 ms 18484 KB Output is correct
85 Correct 257 ms 18484 KB Output is correct
86 Correct 237 ms 18484 KB Output is correct
87 Correct 215 ms 18484 KB Output is correct
88 Correct 208 ms 18484 KB Output is correct
89 Correct 224 ms 18484 KB Output is correct
90 Correct 261 ms 18484 KB Output is correct
91 Correct 202 ms 18484 KB Output is correct
92 Correct 226 ms 18484 KB Output is correct
93 Correct 190 ms 18484 KB Output is correct
94 Correct 256 ms 18484 KB Output is correct
95 Correct 238 ms 18484 KB Output is correct
96 Correct 229 ms 18484 KB Output is correct
97 Correct 218 ms 18484 KB Output is correct
98 Correct 216 ms 18484 KB Output is correct
99 Correct 192 ms 18484 KB Output is correct
100 Correct 263 ms 18484 KB Output is correct
101 Correct 219 ms 18484 KB Output is correct
102 Correct 206 ms 18484 KB Output is correct