oj.uz

답안 #319950

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
319950 2020-11-06T22:23:59 Z Blagojce 자매 도시 (APIO20_swap) C++11
36 / 100
 601 ms 48020 KB 
#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];
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 u = a, v = b;
	
	a = findx(a);
	b = findx(b);
	if(a == b){
		secondbest = min(secondbest, wi);
		return;
	}
	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<int> G[mxn];
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W){
	n = N, m = M;
	vector<pair<int, pii> > S;
	fr(i, 0, m){
		S.pb({W[i], {U[i], V[i]}});
	}
	sort(all(S));
	fr(i, 0, n){
		link[i] = i;
		sz[i] = 1;
	}
	for(auto edge : S){
		int u = edge.nd.st;
		int v = edge.nd.nd;
		unite(u, v, edge.st);
	}
	fr(i, 0, m){
		G[U[i]].pb(W[i]);
		G[V[i]].pb(W[i]);
	}
	
	fr(i, 0, n){
		sort(all(G[i]));
	}
	fr(i, 0, n){
		_c[i] = i_inf;
		if((int)G[i].size() >= 3) _c[i] = G[i][2];
	}
	
	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 = min(secondbest, max(min(dp[k], dpup[k]), cost(Y, k)));
		if(c == i_inf) c = -1;
		return c;
	}
	else if(Y == k){
		int c = min(secondbest, max(min(dp[k], dpup[k]), cost(X, k)));
		if(c == i_inf) c = -1;
		return c;
		
	}
	else{
		int c = min(secondbest, max(min(dp[k], dpup[k]), max(cost(X, k), cost(Y, k))));
		if(c == i_inf) c = -1;
		return c;
	}
}/*
int main(){
	freopen("inp.txt", "r",stdin);
	//freopen("out.txt", "w", stdout);
	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;
	}
	
	


}*/

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 5 ms 5228 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 183 ms 33112 KB Output is correct
10 Correct 232 ms 40920 KB Output is correct
11 Correct 228 ms 39568 KB Output is correct
12 Correct 260 ms 42044 KB Output is correct
13 Correct 245 ms 44132 KB Output is correct
14 Correct 211 ms 32600 KB Output is correct
15 Correct 592 ms 44660 KB Output is correct
16 Correct 598 ms 41704 KB Output is correct
17 Correct 559 ms 48020 KB Output is correct
18 Correct 542 ms 46312 KB Output is correct
19 Correct 139 ms 16228 KB Output is correct
20 Correct 565 ms 44056 KB Output is correct
21 Correct 576 ms 42088 KB Output is correct
22 Correct 591 ms 45904 KB Output is correct
23 Correct 552 ms 46388 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 285 ms 38304 KB Output is correct
4 Correct 287 ms 39508 KB Output is correct
5 Correct 291 ms 38916 KB Output is correct
6 Correct 285 ms 39488 KB Output is correct
7 Correct 291 ms 39384 KB Output is correct
8 Correct 288 ms 38200 KB Output is correct
9 Correct 295 ms 39004 KB Output is correct
10 Correct 284 ms 37840 KB Output is correct

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 5100 KB Output isn't correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 5100 KB Output isn't 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 5 ms 5228 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 183 ms 33112 KB Output is correct
10 Correct 232 ms 40920 KB Output is correct
11 Correct 228 ms 39568 KB Output is correct
12 Correct 260 ms 42044 KB Output is correct
13 Correct 245 ms 44132 KB Output is correct
14 Correct 211 ms 32600 KB Output is correct
15 Correct 592 ms 44660 KB Output is correct
16 Correct 598 ms 41704 KB Output is correct
17 Correct 559 ms 48020 KB Output is correct
18 Correct 542 ms 46312 KB Output is correct
19 Correct 285 ms 38304 KB Output is correct
20 Correct 287 ms 39508 KB Output is correct
21 Correct 291 ms 38916 KB Output is correct
22 Correct 285 ms 39488 KB Output is correct
23 Correct 291 ms 39384 KB Output is correct
24 Correct 288 ms 38200 KB Output is correct
25 Correct 295 ms 39004 KB Output is correct
26 Correct 284 ms 37840 KB Output is correct
27 Correct 5 ms 5356 KB Output is correct
28 Correct 5 ms 5376 KB Output is correct
29 Correct 5 ms 5356 KB Output is correct
30 Correct 4 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 5484 KB Output is correct
35 Correct 5 ms 5356 KB Output is correct
36 Correct 20 ms 9260 KB Output is correct
37 Correct 255 ms 41252 KB Output is correct
38 Correct 240 ms 38104 KB Output is correct
39 Correct 222 ms 35764 KB Output is correct
40 Correct 211 ms 35160 KB Output is correct
41 Correct 202 ms 34440 KB Output is correct
42 Correct 171 ms 32088 KB Output is correct
43 Correct 261 ms 39320 KB Output is correct
44 Correct 254 ms 40360 KB Output is correct
45 Correct 231 ms 41816 KB Output is correct
46 Correct 202 ms 35800 KB Output is correct
47 Correct 37 ms 9240 KB Output is correct
48 Correct 599 ms 42840 KB Output is correct
49 Correct 588 ms 40920 KB Output is correct
50 Correct 530 ms 39640 KB Output is correct
51 Correct 526 ms 39000 KB Output is correct
52 Correct 446 ms 36824 KB Output is correct
53 Correct 356 ms 30416 KB Output is correct
54 Correct 601 ms 42792 KB Output is correct
55 Correct 596 ms 43396 KB Output is correct
56 Correct 554 ms 46552 KB Output is correct
57 Correct 435 ms 39972 KB Output is correct

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 5100 KB Output isn't correct