oj.uz

답안 #319941

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
319941 2020-11-06T21:25:34 Z Blagojce 자매 도시 (APIO20_swap) C++11
30 / 100
 2000 ms 524292 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 mis[mxn][20];
int mxw[mxn][20];

int depth[mxn];
int minc[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];
	
	mis[u][0] = val;
	fr(i, 1, 20) mis[u][i] = min(mis[u][i-1], mis[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 best_spot(int u, int p){
	int ret = dp[u];
	for(int i = 19; i >= 0; i --){
		if(depth[u] - (1<<i) > depth[p]){
			ret = min(ret, mis[u][i]);
			u = sparse[u][i];
		}
	}
	return ret;
}
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;
}

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W){
	n = N, m = M;
	fr(i, 0, m){
		g[U[i]].pb({V[i], W[i]});
		g[V[i]].pb({U[i], W[i]});
	}
	fr(i, 0, n){
		sort(all(g[i]), [](const pii A, const pii B){
			return A.nd < B.nd;
		});
	}
	fr(i, 0, n){
		_c[i] = i_inf;
		if((int)g[i].size() >= 3) _c[i] = g[i][2].nd;
	}
	
	dfs(0, 0, i_inf, i_inf);
	dfs2(0, 0, i_inf);
	fr(i, 0, n){
		minc[i] = i_inf;
		int cnt = 0;
		for(auto u : g[i]){
			if(u.st == sparse[i][0]) continue;
			++cnt;
			if(cnt == 2){
				minc[i] = u.nd;
				break;
			}
		}
	}
	
}
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(){
	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
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2816 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 3 ms 3052 KB Output is correct
5 Correct 4 ms 3084 KB Output is correct
6 Correct 3 ms 3052 KB Output is correct
7 Correct 3 ms 3052 KB Output is correct
8 Correct 3 ms 3180 KB Output is correct
9 Correct 178 ms 33128 KB Output is correct
10 Correct 238 ms 41316 KB Output is correct
11 Correct 240 ms 40036 KB Output is correct
12 Correct 244 ms 42788 KB Output is correct
13 Correct 244 ms 44644 KB Output is correct
14 Correct 219 ms 32612 KB Output is correct
15 Correct 576 ms 43120 KB Output is correct
16 Correct 593 ms 40224 KB Output is correct
17 Correct 549 ms 46680 KB Output is correct
18 Correct 574 ms 44748 KB Output is correct
19 Execution timed out 2073 ms 231420 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2816 KB Output is correct
3 Correct 286 ms 37500 KB Output is correct
4 Correct 300 ms 39236 KB Output is correct
5 Correct 298 ms 37616 KB Output is correct
6 Correct 287 ms 38240 KB Output is correct
7 Correct 296 ms 38236 KB Output is correct
8 Correct 301 ms 36748 KB Output is correct
9 Correct 283 ms 37720 KB Output is correct
10 Correct 286 ms 36500 KB Output is correct

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1555 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1555 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2816 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 3 ms 3052 KB Output is correct
5 Correct 4 ms 3084 KB Output is correct
6 Correct 3 ms 3052 KB Output is correct
7 Correct 3 ms 3052 KB Output is correct
8 Correct 3 ms 3180 KB Output is correct
9 Correct 178 ms 33128 KB Output is correct
10 Correct 238 ms 41316 KB Output is correct
11 Correct 240 ms 40036 KB Output is correct
12 Correct 244 ms 42788 KB Output is correct
13 Correct 244 ms 44644 KB Output is correct
14 Correct 219 ms 32612 KB Output is correct
15 Correct 576 ms 43120 KB Output is correct
16 Correct 593 ms 40224 KB Output is correct
17 Correct 549 ms 46680 KB Output is correct
18 Correct 574 ms 44748 KB Output is correct
19 Correct 286 ms 37500 KB Output is correct
20 Correct 300 ms 39236 KB Output is correct
21 Correct 298 ms 37616 KB Output is correct
22 Correct 287 ms 38240 KB Output is correct
23 Correct 296 ms 38236 KB Output is correct
24 Correct 301 ms 36748 KB Output is correct
25 Correct 283 ms 37720 KB Output is correct
26 Correct 286 ms 36500 KB Output is correct
27 Correct 3 ms 3052 KB Output is correct
28 Correct 3 ms 3052 KB Output is correct
29 Correct 3 ms 3052 KB Output is correct
30 Correct 3 ms 2924 KB Output is correct
31 Correct 3 ms 3052 KB Output is correct
32 Correct 4 ms 3052 KB Output is correct
33 Correct 3 ms 3052 KB Output is correct
34 Correct 4 ms 3052 KB Output is correct
35 Correct 3 ms 3052 KB Output is correct
36 Correct 18 ms 7276 KB Output is correct
37 Correct 253 ms 41956 KB Output is correct
38 Correct 273 ms 38844 KB Output is correct
39 Correct 205 ms 36592 KB Output is correct
40 Correct 194 ms 35556 KB Output is correct
41 Correct 182 ms 35044 KB Output is correct
42 Correct 158 ms 32536 KB Output is correct
43 Correct 240 ms 40036 KB Output is correct
44 Correct 278 ms 41188 KB Output is correct
45 Correct 242 ms 42596 KB Output is correct
46 Correct 206 ms 36196 KB Output is correct
47 Correct 41 ms 7396 KB Output is correct
48 Correct 624 ms 44772 KB Output is correct
49 Correct 608 ms 42824 KB Output is correct
50 Correct 574 ms 41544 KB Output is correct
51 Correct 498 ms 40792 KB Output is correct
52 Correct 472 ms 38548 KB Output is correct
53 Correct 329 ms 30808 KB Output is correct
54 Correct 611 ms 44600 KB Output is correct
55 Correct 629 ms 45512 KB Output is correct
56 Correct 590 ms 48480 KB Output is correct
57 Correct 425 ms 41800 KB Output is correct

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1555 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)