oj.uz

답안 #258506

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
258506 2020-08-06T05:04:29 Z b00n0rp 전선 연결 (IOI17_wiring) C++17
100 / 100
 96 ms 20584 KB 
#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int,int>
#define F first
#define S second
#define REP(i,n) for(int i = 0; i < n; i++)
#define FOR(i,a,b) for(int i = a; i < b; i ++)
#define all(v) v.begin(),v.end()

vector<pii> a;
int n;
int comp[200005];
pii range[200005];
ll dp[200005],pref[200005],suff[200005],gg1[200005],gg2[200005];
ll seg[2][400005];

const ll INF = 1e14;

void upd(int type,int ind,ll val){
	ind += n;
	while(ind){
		seg[type][ind] = min(seg[type][ind],val);
		ind /= 2;
	}
}

ll quer(int type,int l,int r){
	l += n;
	r += n;
	ll res = INF;
	while(l < r){
		if(l&1) res = min(res,seg[type][l++]);
		if(r&1) res = min(res,seg[type][--r]);
		l /= 2;
		r /= 2;
	}
	return res;
}

ll min_total_length(vi r, vi b) {
	for(auto x:r) a.pb({x,0});
	for(auto x:b) a.pb({x,1});
	sort(all(a));
	n = a.size();
	int last = 0,cmp = 0;
	FOR(i,1,n){
		if(a[i].S != a[last].S){
			range[cmp] = {last,i-1};
			last = i;
			cmp++;
		}
		comp[i] = cmp;
	}
	REP(i,2*n+5) seg[0][i] = seg[1][i] = INF;

	range[cmp] = {last,n-1};
	pref[0] = 0;
	FOR(i,1,n){
		if(comp[i] == comp[i-1]){
			pref[i] = pref[i-1]+(a[i].F-a[range[comp[i]].F].F);
		}
	}
	suff[n-1] = 0;
	for(int i = n-2; i >= 0; i--){
		if(comp[i] == comp[i+1]){
			suff[i] = suff[i+1]+(a[range[comp[i]].S].F-a[i].F);
		}
	}
	REP(i,n){
		if(comp[i]){
			int st = range[comp[i]].F;
			int l1 = range[comp[st-1]].F,r2 = range[comp[st-1]].S;
			ll diff = a[st].F-a[r2].F;
			dp[i] = INF;
			int r1 = max(2*st-i-1,l1-1);
			int l2 = r1+1;
			/*
			FOR(j,l1,r1+1){
				// pref[i]+suff[j]+diff*(st-j)+(j?min(dp[j-1],dp[j]):0)
				// [  pref[i]+diff*st  ]+[  suff[j]-diff*j+(j?min(dp[j-1],dp[j]):0)  ]
				// [  pref[i]+diff*st  ]+[  gg1[j]  ]
				dp[i] = min(dp[i],pref[i]+diff*st+gg1[j]);
			}
			FOR(j,l2,r2+1){
				// pref[i]+suff[j]+diff*(i-st+1)+(j?min(dp[j-1],dp[j]):0)
				// [  pref[i]+diff*(i-st+1)  ]+[  suff[j]+(j?min(dp[j-1],dp[j]):0)  ]
				// [  pref[i]+diff*(i-st+1)  ]+[  gg2[j]  ]
				dp[i] = min(dp[i],pref[i]+diff*(i-st+1)+gg2[j]);
			}
			*/
			dp[i] = min(pref[i]+diff*st+quer(0,l1,r1+1),pref[i]+diff*(i-st+1)+quer(1,l2,r2+1));
		}
		else dp[i] = INF;

		if(comp[i] == comp[n-1]) continue;
		ll diff2 = a[range[comp[i]+1].F].F-a[range[comp[i]].S].F;
		gg1[i] = suff[i]-diff2*i+(i?min(dp[i],dp[i-1]):0);
		gg2[i] = suff[i]+(i?min(dp[i],dp[i-1]):0);
		upd(0,i,gg1[i]);
		upd(1,i,gg2[i]);
	}
	return dp[n-1];
}

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 55 ms 13288 KB Output is correct
4 Correct 53 ms 14696 KB Output is correct
5 Correct 61 ms 13928 KB Output is correct
6 Correct 75 ms 18792 KB Output is correct
7 Correct 75 ms 18792 KB Output is correct
8 Correct 79 ms 18800 KB Output is correct
9 Correct 81 ms 18792 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 85 ms 18920 KB Output is correct
4 Correct 81 ms 19048 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 376 KB Output is correct
18 Correct 84 ms 19220 KB Output is correct
19 Correct 84 ms 19176 KB Output is correct
20 Correct 85 ms 19048 KB Output is correct
21 Correct 86 ms 19176 KB Output is correct
22 Correct 86 ms 19176 KB Output is correct
23 Correct 84 ms 19092 KB Output is correct
24 Correct 84 ms 19176 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 86 ms 18364 KB Output is correct
3 Correct 80 ms 19816 KB Output is correct
4 Correct 88 ms 19560 KB Output is correct
5 Correct 82 ms 19816 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 89 ms 19564 KB Output is correct
19 Correct 96 ms 19688 KB Output is correct
20 Correct 89 ms 19688 KB Output is correct
21 Correct 87 ms 19688 KB Output is correct
22 Correct 86 ms 19572 KB Output is correct
23 Correct 73 ms 19176 KB Output is correct
24 Correct 83 ms 19304 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 55 ms 13288 KB Output is correct
20 Correct 53 ms 14696 KB Output is correct
21 Correct 61 ms 13928 KB Output is correct
22 Correct 75 ms 18792 KB Output is correct
23 Correct 75 ms 18792 KB Output is correct
24 Correct 79 ms 18800 KB Output is correct
25 Correct 81 ms 18792 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 85 ms 18920 KB Output is correct
29 Correct 81 ms 19048 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 0 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 0 ms 384 KB Output is correct
42 Correct 0 ms 376 KB Output is correct
43 Correct 84 ms 19220 KB Output is correct
44 Correct 84 ms 19176 KB Output is correct
45 Correct 85 ms 19048 KB Output is correct
46 Correct 86 ms 19176 KB Output is correct
47 Correct 86 ms 19176 KB Output is correct
48 Correct 84 ms 19092 KB Output is correct
49 Correct 84 ms 19176 KB Output is correct
50 Correct 0 ms 384 KB Output is correct
51 Correct 86 ms 18364 KB Output is correct
52 Correct 80 ms 19816 KB Output is correct
53 Correct 88 ms 19560 KB Output is correct
54 Correct 82 ms 19816 KB Output is correct
55 Correct 0 ms 384 KB Output is correct
56 Correct 0 ms 384 KB Output is correct
57 Correct 0 ms 384 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 0 ms 384 KB Output is correct
60 Correct 0 ms 384 KB Output is correct
61 Correct 0 ms 384 KB Output is correct
62 Correct 0 ms 384 KB Output is correct
63 Correct 0 ms 384 KB Output is correct
64 Correct 0 ms 384 KB Output is correct
65 Correct 0 ms 384 KB Output is correct
66 Correct 0 ms 384 KB Output is correct
67 Correct 89 ms 19564 KB Output is correct
68 Correct 96 ms 19688 KB Output is correct
69 Correct 89 ms 19688 KB Output is correct
70 Correct 87 ms 19688 KB Output is correct
71 Correct 86 ms 19572 KB Output is correct
72 Correct 73 ms 19176 KB Output is correct
73 Correct 83 ms 19304 KB Output is correct
74 Correct 82 ms 20456 KB Output is correct
75 Correct 86 ms 20072 KB Output is correct
76 Correct 89 ms 20472 KB Output is correct
77 Correct 91 ms 19964 KB Output is correct
78 Correct 85 ms 19816 KB Output is correct
79 Correct 85 ms 19812 KB Output is correct
80 Correct 78 ms 19820 KB Output is correct
81 Correct 85 ms 19944 KB Output is correct
82 Correct 83 ms 19816 KB Output is correct
83 Correct 70 ms 19048 KB Output is correct
84 Correct 73 ms 19560 KB Output is correct
85 Correct 90 ms 20356 KB Output is correct
86 Correct 84 ms 19944 KB Output is correct
87 Correct 85 ms 19816 KB Output is correct
88 Correct 89 ms 20584 KB Output is correct
89 Correct 87 ms 20456 KB Output is correct
90 Correct 96 ms 20328 KB Output is correct
91 Correct 81 ms 20456 KB Output is correct
92 Correct 87 ms 20456 KB Output is correct
93 Correct 87 ms 20456 KB Output is correct
94 Correct 89 ms 20328 KB Output is correct
95 Correct 95 ms 20328 KB Output is correct
96 Correct 81 ms 19816 KB Output is correct
97 Correct 88 ms 20332 KB Output is correct
98 Correct 87 ms 20200 KB Output is correct
99 Correct 87 ms 20200 KB Output is correct
100 Correct 93 ms 20460 KB Output is correct
101 Correct 86 ms 20456 KB Output is correct
102 Correct 89 ms 20448 KB Output is correct