답안 #319953

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
319953	2020-11-06T22:45:24 Z	Blagojce	자매 도시 (APIO20_swap)	C++11	100 / 100	718 ms	50900 KB

swap

#include <bits/stdc++.h> 
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define rfr(i, n, m) for(int i = (n); i >= (m); i --)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
#include <time.h>
#include <cmath>
#include <deque>

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const int i_inf = 1e9+1;
const ll inf = 2e18;
const ll mod = 998244353;
const ld eps = 1e-13;
const ld pi  = 3.14159265359;
const int mxn = 1e5+5;
mt19937 _rand(time(NULL));

#include "swap.h"

vector<pii> g[mxn];
int n, m;
int sparse[mxn][20];
int mxw[mxn][20];

int depth[mxn];

int _c[mxn];
int dp[mxn];
void dfs(int u, int p, int val, int val2){
	sparse[u][0] = p;
	fr(i, 1, 20) sparse[u][i] = sparse[sparse[u][i-1]][i-1];
	
	mxw[u][0] = val2;
	fr(i, 1, 20) mxw[u][i] = max(mxw[u][i-1], mxw[sparse[u][i-1]][i-1]);
	
	int mi1 = i_inf, c1 = -1;
	int mi2 = i_inf;
	
	for(auto e : g[u]){
		if(e.st == p) continue;
		if(e.nd < mi1){
			mi2 = mi1;
			mi1 = e.nd;
			c1 = e.st;
		}
		else if(e.nd < mi2){
			mi2 = e.nd;
		}
	}
	dp[u] = _c[u];
	for(auto e : g[u]){
		if(e.st == p) continue;
		depth[e.st] = depth[u] + 1;
		if(e.st != c1){
			dfs(e.st, u, mi1, e.nd);
		}
		else{
			dfs(e.st, u, mi2, e.nd);
		}
		dp[u] = min(dp[u], max(dp[e.st], e.nd));
	}
}
int dpup[mxn];
void dfs2(int u, int p, int carry){
	carry = min(carry, _c[u]);
	dpup[u] = carry;
	int id = p;
	int min1 = carry;
	int min2 = i_inf;
	for(auto e : g[u]){
		if(e.st == p) continue;
		int cand1 = max(dp[e.st], e.nd);
		if(cand1 < min1){
			min2 = min1;
			id = e.st;
			min1 = cand1;
		}else if(cand1 < min2){
			min2 = cand1;
		}
	}
	for(auto e : g[u]){
		if(e.st == p) continue;
		if(e.st == id){
			dfs2(e.st, u, max(e.nd, min2));
		}
		else{
			dfs2(e.st, u, max(e.nd, min1));
		}
	}
	

}

int lca(int a, int b){
	int mind = min(depth[a], depth[b]);
	for(int i = 19; i >= 0; i --){
		if(depth[a] - (1<<i) >= mind) a = sparse[a][i];
		if(depth[b] - (1<<i) >= mind) b = sparse[b][i];
	}
	if(a == b) return a;
	
	for(int i = 19; i >= 0; i --){
		if(sparse[a][i] != sparse[b][i]){
			a = sparse[a][i];
			b = sparse[b][i];
		}
	}
	return sparse[a][0];
}
int cost(int u, int p){
	int ret = 0;
	for(int i = 19; i >= 0; i --){
		if(depth[u] - (1<<i) >= depth[p]){
			ret = max(ret, mxw[u][i]);
			u = sparse[u][i];
		}
	}
	return ret;
}

int link[mxn];
int sz[mxn];
bool used[200005];
int findx(int x){
	if(x == link[x]) return x;
	link[x] = findx(link[x]);
	return link[x];
}
int secondbest = i_inf;
void unite(int a, int b, int wi, int i){
	int u = a, v = b;
	
	a = findx(a);
	b = findx(b);
	if(a == b){
		secondbest = min(secondbest, wi);
		return;
	}
	used[i] = true;
	if(sz[a] < sz[b]) swap(a, b);
	link[b] = a;
	sz[a] += sz[b];
	g[u].pb({v, wi});
	g[v].pb({u, wi});
	
}
vector<pii> G[mxn];
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W){
	n = N, m = M;
	vector<pii> S;
	fr(i, 0, m){
		S.pb({W[i], i});
	}
	sort(all(S));
	fr(i, 0, n){
		link[i] = i;
		sz[i] = 1;
	}
	for(auto edge : S){
		int u = U[edge.nd];
		int v = V[edge.nd];
		unite(u, v, edge.st, edge.nd);
	}
	fr(i, 0, m){
		G[U[i]].pb({W[i], i});
		G[V[i]].pb({W[i], i});
	}
	
	fr(i, 0, n){
		sort(all(g[i]), [](const pii A, const pii B){
			return A.nd < B.nd;
		});
		
		sort(all(G[i]));
	}
	fr(i, 0, n){
		_c[i] = i_inf;
		if((int)g[i].size() >= 3) _c[i] = g[i][2].nd;
		for(auto u : G[i]){
			if(used[u.nd]) continue;
			_c[i] = min(_c[i], u.st);
			break;
		}
		
	}
	
	dfs(0, 0, i_inf, i_inf);
	dfs2(0, 0, i_inf);
	
	
}

	
int line = 0;
int getMinimumFuelCapacity(int X, int Y){
	int k = lca(X, Y);
	
	if(X == k){
		int c = max(min(dp[k], dpup[k]), cost(Y, k));
		if(c == i_inf) c = -1;
		return c;
	}
	else if(Y == k){
		int c = max(min(dp[k], dpup[k]), cost(X, k));
		if(c == i_inf) c = -1;
		return c;
		
	}
	else{
		int c = max(min(dp[k], dpup[k]), max(cost(X, k), cost(Y, k)));
		if(c == i_inf) c = -1;
		return c;
	}
}/*
int main(){
	cin >> n >> m;
	vector<int> U(m);
	vector<int> V(m);
	vector<int> W(m);

	fr(i, 0, m){
		cin >> U[i] >> V[i] >> W[i];
	}
	
	init(n, m, U, V, W);
	int cc;
	cin >> cc;
	while(cc--){
		int i, j;
		cin >> i >> j;
		++line;
		int ans = getMinimumFuelCapacity(i, j);
		if(line == 1200) cout<<ans<<endl;
	}
	
	
init(5, 6, {0, 0, 1, 1, 1, 2}, {1, 2, 2, 3, 4, 3}, {4, 4, 1, 2, 10, 3});
cout<<getMinimumFuelCapacity(1, 2)<<endl;
cout<<getMinimumFuelCapacity(2, 4)<<endl;
cout<<getMinimumFuelCapacity(0, 1)<<endl;
}
*/

Subtask #1

6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	5100 KB	Output is correct
2	Correct	4 ms	5100 KB	Output is correct
3	Correct	4 ms	5100 KB	Output is correct
4	Correct	4 ms	5356 KB	Output is correct
5	Correct	5 ms	5356 KB	Output is correct
6	Correct	5 ms	5356 KB	Output is correct
7	Correct	5 ms	5356 KB	Output is correct
8	Correct	5 ms	5484 KB	Output is correct
9	Correct	190 ms	32088 KB	Output is correct
10	Correct	253 ms	39256 KB	Output is correct
11	Correct	244 ms	38108 KB	Output is correct
12	Correct	263 ms	40284 KB	Output is correct
13	Correct	229 ms	42456 KB	Output is correct
14	Correct	230 ms	31064 KB	Output is correct
15	Correct	572 ms	41452 KB	Output is correct
16	Correct	561 ms	38620 KB	Output is correct
17	Correct	559 ms	44628 KB	Output is correct
18	Correct	544 ms	42968 KB	Output is correct
19	Correct	138 ms	14952 KB	Output is correct
20	Correct	585 ms	41684 KB	Output is correct
21	Correct	575 ms	39708 KB	Output is correct
22	Correct	595 ms	43328 KB	Output is correct
23	Correct	588 ms	43820 KB	Output is correct

Subtask #2

7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	5100 KB	Output is correct
2	Correct	4 ms	5100 KB	Output is correct
3	Correct	293 ms	36248 KB	Output is correct
4	Correct	294 ms	37424 KB	Output is correct
5	Correct	299 ms	36736 KB	Output is correct
6	Correct	314 ms	37296 KB	Output is correct
7	Correct	298 ms	37084 KB	Output is correct
8	Correct	296 ms	35888 KB	Output is correct
9	Correct	294 ms	36824 KB	Output is correct
10	Correct	308 ms	35772 KB	Output is correct

Subtask #3

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	5100 KB	Output is correct
2	Correct	4 ms	5100 KB	Output is correct
3	Correct	4 ms	5100 KB	Output is correct
4	Correct	4 ms	5100 KB	Output is correct
5	Correct	4 ms	5356 KB	Output is correct
6	Correct	5 ms	5356 KB	Output is correct
7	Correct	5 ms	5356 KB	Output is correct
8	Correct	5 ms	5356 KB	Output is correct
9	Correct	5 ms	5484 KB	Output is correct
10	Correct	5 ms	5356 KB	Output is correct
11	Correct	5 ms	5356 KB	Output is correct
12	Correct	5 ms	5356 KB	Output is correct
13	Correct	5 ms	5356 KB	Output is correct
14	Correct	5 ms	5356 KB	Output is correct
15	Correct	5 ms	5356 KB	Output is correct
16	Correct	5 ms	5356 KB	Output is correct
17	Correct	6 ms	5484 KB	Output is correct
18	Correct	5 ms	5356 KB	Output is correct
19	Correct	5 ms	5356 KB	Output is correct
20	Correct	5 ms	5356 KB	Output is correct
21	Correct	5 ms	5356 KB	Output is correct
22	Correct	5 ms	5228 KB	Output is correct
23	Correct	5 ms	5356 KB	Output is correct
24	Correct	5 ms	5484 KB	Output is correct
25	Correct	6 ms	5484 KB	Output is correct
26	Correct	6 ms	5484 KB	Output is correct
27	Correct	5 ms	5484 KB	Output is correct
28	Correct	5 ms	5484 KB	Output is correct

Subtask #4

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	5100 KB	Output is correct
2	Correct	4 ms	5100 KB	Output is correct
3	Correct	4 ms	5100 KB	Output is correct
4	Correct	4 ms	5100 KB	Output is correct
5	Correct	4 ms	5356 KB	Output is correct
6	Correct	5 ms	5356 KB	Output is correct
7	Correct	5 ms	5356 KB	Output is correct
8	Correct	5 ms	5356 KB	Output is correct
9	Correct	5 ms	5484 KB	Output is correct
10	Correct	190 ms	32088 KB	Output is correct
11	Correct	253 ms	39256 KB	Output is correct
12	Correct	244 ms	38108 KB	Output is correct
13	Correct	263 ms	40284 KB	Output is correct
14	Correct	229 ms	42456 KB	Output is correct
15	Correct	5 ms	5356 KB	Output is correct
16	Correct	5 ms	5356 KB	Output is correct
17	Correct	5 ms	5356 KB	Output is correct
18	Correct	5 ms	5356 KB	Output is correct
19	Correct	5 ms	5356 KB	Output is correct
20	Correct	5 ms	5356 KB	Output is correct
21	Correct	5 ms	5356 KB	Output is correct
22	Correct	6 ms	5484 KB	Output is correct
23	Correct	5 ms	5356 KB	Output is correct
24	Correct	20 ms	8940 KB	Output is correct
25	Correct	280 ms	39056 KB	Output is correct
26	Correct	242 ms	35928 KB	Output is correct
27	Correct	230 ms	33752 KB	Output is correct
28	Correct	240 ms	32856 KB	Output is correct
29	Correct	213 ms	32368 KB	Output is correct
30	Correct	179 ms	30556 KB	Output is correct
31	Correct	273 ms	36828 KB	Output is correct
32	Correct	258 ms	38232 KB	Output is correct
33	Correct	218 ms	39836 KB	Output is correct
34	Correct	201 ms	33624 KB	Output is correct
35	Correct	5 ms	5356 KB	Output is correct
36	Correct	5 ms	5356 KB	Output is correct
37	Correct	5 ms	5356 KB	Output is correct
38	Correct	5 ms	5228 KB	Output is correct
39	Correct	5 ms	5356 KB	Output is correct
40	Correct	5 ms	5484 KB	Output is correct
41	Correct	6 ms	5484 KB	Output is correct
42	Correct	6 ms	5484 KB	Output is correct
43	Correct	5 ms	5484 KB	Output is correct
44	Correct	5 ms	5484 KB	Output is correct
45	Correct	210 ms	34708 KB	Output is correct
46	Correct	244 ms	36492 KB	Output is correct
47	Correct	207 ms	34544 KB	Output is correct
48	Correct	235 ms	35016 KB	Output is correct
49	Correct	100 ms	18128 KB	Output is correct
50	Correct	81 ms	16344 KB	Output is correct
51	Correct	164 ms	29784 KB	Output is correct
52	Correct	288 ms	42196 KB	Output is correct
53	Correct	314 ms	42068 KB	Output is correct
54	Correct	342 ms	47188 KB	Output is correct
55	Correct	222 ms	43352 KB	Output is correct
56	Correct	282 ms	41588 KB	Output is correct

Subtask #5

23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	5100 KB	Output is correct
2	Correct	4 ms	5100 KB	Output is correct
3	Correct	4 ms	5100 KB	Output is correct
4	Correct	4 ms	5356 KB	Output is correct
5	Correct	5 ms	5356 KB	Output is correct
6	Correct	5 ms	5356 KB	Output is correct
7	Correct	5 ms	5356 KB	Output is correct
8	Correct	5 ms	5484 KB	Output is correct
9	Correct	190 ms	32088 KB	Output is correct
10	Correct	253 ms	39256 KB	Output is correct
11	Correct	244 ms	38108 KB	Output is correct
12	Correct	263 ms	40284 KB	Output is correct
13	Correct	229 ms	42456 KB	Output is correct
14	Correct	230 ms	31064 KB	Output is correct
15	Correct	572 ms	41452 KB	Output is correct
16	Correct	561 ms	38620 KB	Output is correct
17	Correct	559 ms	44628 KB	Output is correct
18	Correct	544 ms	42968 KB	Output is correct
19	Correct	293 ms	36248 KB	Output is correct
20	Correct	294 ms	37424 KB	Output is correct
21	Correct	299 ms	36736 KB	Output is correct
22	Correct	314 ms	37296 KB	Output is correct
23	Correct	298 ms	37084 KB	Output is correct
24	Correct	296 ms	35888 KB	Output is correct
25	Correct	294 ms	36824 KB	Output is correct
26	Correct	308 ms	35772 KB	Output is correct
27	Correct	5 ms	5356 KB	Output is correct
28	Correct	5 ms	5356 KB	Output is correct
29	Correct	5 ms	5356 KB	Output is correct
30	Correct	5 ms	5356 KB	Output is correct
31	Correct	5 ms	5356 KB	Output is correct
32	Correct	5 ms	5356 KB	Output is correct
33	Correct	5 ms	5356 KB	Output is correct
34	Correct	6 ms	5484 KB	Output is correct
35	Correct	5 ms	5356 KB	Output is correct
36	Correct	20 ms	8940 KB	Output is correct
37	Correct	280 ms	39056 KB	Output is correct
38	Correct	242 ms	35928 KB	Output is correct
39	Correct	230 ms	33752 KB	Output is correct
40	Correct	240 ms	32856 KB	Output is correct
41	Correct	213 ms	32368 KB	Output is correct
42	Correct	179 ms	30556 KB	Output is correct
43	Correct	273 ms	36828 KB	Output is correct
44	Correct	258 ms	38232 KB	Output is correct
45	Correct	218 ms	39836 KB	Output is correct
46	Correct	201 ms	33624 KB	Output is correct
47	Correct	33 ms	8840 KB	Output is correct
48	Correct	603 ms	38588 KB	Output is correct
49	Correct	597 ms	36908 KB	Output is correct
50	Correct	560 ms	35664 KB	Output is correct
51	Correct	520 ms	35008 KB	Output is correct
52	Correct	467 ms	32932 KB	Output is correct
53	Correct	333 ms	27072 KB	Output is correct
54	Correct	595 ms	38408 KB	Output is correct
55	Correct	600 ms	39344 KB	Output is correct
56	Correct	551 ms	42536 KB	Output is correct
57	Correct	451 ms	35948 KB	Output is correct

Subtask #6

27.0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	5100 KB	Output is correct
2	Correct	4 ms	5100 KB	Output is correct
3	Correct	4 ms	5100 KB	Output is correct
4	Correct	4 ms	5100 KB	Output is correct
5	Correct	4 ms	5356 KB	Output is correct
6	Correct	5 ms	5356 KB	Output is correct
7	Correct	5 ms	5356 KB	Output is correct
8	Correct	5 ms	5356 KB	Output is correct
9	Correct	5 ms	5484 KB	Output is correct
10	Correct	190 ms	32088 KB	Output is correct
11	Correct	253 ms	39256 KB	Output is correct
12	Correct	244 ms	38108 KB	Output is correct
13	Correct	263 ms	40284 KB	Output is correct
14	Correct	229 ms	42456 KB	Output is correct
15	Correct	230 ms	31064 KB	Output is correct
16	Correct	572 ms	41452 KB	Output is correct
17	Correct	561 ms	38620 KB	Output is correct
18	Correct	559 ms	44628 KB	Output is correct
19	Correct	544 ms	42968 KB	Output is correct
20	Correct	293 ms	36248 KB	Output is correct
21	Correct	294 ms	37424 KB	Output is correct
22	Correct	299 ms	36736 KB	Output is correct
23	Correct	314 ms	37296 KB	Output is correct
24	Correct	298 ms	37084 KB	Output is correct
25	Correct	296 ms	35888 KB	Output is correct
26	Correct	294 ms	36824 KB	Output is correct
27	Correct	308 ms	35772 KB	Output is correct
28	Correct	5 ms	5356 KB	Output is correct
29	Correct	5 ms	5356 KB	Output is correct
30	Correct	5 ms	5356 KB	Output is correct
31	Correct	5 ms	5356 KB	Output is correct
32	Correct	5 ms	5356 KB	Output is correct
33	Correct	5 ms	5356 KB	Output is correct
34	Correct	5 ms	5356 KB	Output is correct
35	Correct	6 ms	5484 KB	Output is correct
36	Correct	5 ms	5356 KB	Output is correct
37	Correct	20 ms	8940 KB	Output is correct
38	Correct	280 ms	39056 KB	Output is correct
39	Correct	242 ms	35928 KB	Output is correct
40	Correct	230 ms	33752 KB	Output is correct
41	Correct	240 ms	32856 KB	Output is correct
42	Correct	213 ms	32368 KB	Output is correct
43	Correct	179 ms	30556 KB	Output is correct
44	Correct	273 ms	36828 KB	Output is correct
45	Correct	258 ms	38232 KB	Output is correct
46	Correct	218 ms	39836 KB	Output is correct
47	Correct	201 ms	33624 KB	Output is correct
48	Correct	33 ms	8840 KB	Output is correct
49	Correct	603 ms	38588 KB	Output is correct
50	Correct	597 ms	36908 KB	Output is correct
51	Correct	560 ms	35664 KB	Output is correct
52	Correct	520 ms	35008 KB	Output is correct
53	Correct	467 ms	32932 KB	Output is correct
54	Correct	333 ms	27072 KB	Output is correct
55	Correct	595 ms	38408 KB	Output is correct
56	Correct	600 ms	39344 KB	Output is correct
57	Correct	551 ms	42536 KB	Output is correct
58	Correct	451 ms	35948 KB	Output is correct
59	Correct	138 ms	14952 KB	Output is correct
60	Correct	585 ms	41684 KB	Output is correct
61	Correct	575 ms	39708 KB	Output is correct
62	Correct	595 ms	43328 KB	Output is correct
63	Correct	588 ms	43820 KB	Output is correct
64	Correct	5 ms	5356 KB	Output is correct
65	Correct	5 ms	5356 KB	Output is correct
66	Correct	5 ms	5356 KB	Output is correct
67	Correct	5 ms	5228 KB	Output is correct
68	Correct	5 ms	5356 KB	Output is correct
69	Correct	5 ms	5484 KB	Output is correct
70	Correct	6 ms	5484 KB	Output is correct
71	Correct	6 ms	5484 KB	Output is correct
72	Correct	5 ms	5484 KB	Output is correct
73	Correct	5 ms	5484 KB	Output is correct
74	Correct	210 ms	34708 KB	Output is correct
75	Correct	244 ms	36492 KB	Output is correct
76	Correct	207 ms	34544 KB	Output is correct
77	Correct	235 ms	35016 KB	Output is correct
78	Correct	100 ms	18128 KB	Output is correct
79	Correct	81 ms	16344 KB	Output is correct
80	Correct	164 ms	29784 KB	Output is correct
81	Correct	288 ms	42196 KB	Output is correct
82	Correct	314 ms	42068 KB	Output is correct
83	Correct	342 ms	47188 KB	Output is correct
84	Correct	222 ms	43352 KB	Output is correct
85	Correct	282 ms	41588 KB	Output is correct
86	Correct	109 ms	17116 KB	Output is correct
87	Correct	596 ms	40556 KB	Output is correct
88	Correct	584 ms	40752 KB	Output is correct
89	Correct	400 ms	37300 KB	Output is correct
90	Correct	226 ms	21204 KB	Output is correct
91	Correct	241 ms	22608 KB	Output is correct
92	Correct	366 ms	33708 KB	Output is correct
93	Correct	620 ms	46420 KB	Output is correct
94	Correct	495 ms	45912 KB	Output is correct
95	Correct	718 ms	50900 KB	Output is correct
96	Correct	567 ms	44080 KB	Output is correct
97	Correct	469 ms	42600 KB	Output is correct