oj.uz

답안 #679182

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
679182 2023-01-07T16:25:50 Z Dan4Life 자매 도시 (APIO20_swap) C++17
0 / 100
 2000 ms 66776 KB 
#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back

const int maxn = (int)5e5+10;
const int lgn = 20;

int n, m, num;
int jmp[lgn][maxn];
vector<int> adj[maxn];
int p[maxn], lev[maxn], wei[maxn], line[maxn], good[maxn];

struct Edge{ int u, v, w, i; };
Edge edge[maxn];

int getPath(int x, int steps){
	for(int i = lgn-1; i >= 0; i--)
		if(steps&(1<<i) and x!=-1) x = jmp[i][x];
	return x; 
}

int lca(int a, int b){
	if(a==b) return a;
	if(jmp[0][a]==jmp[0][b]) return jmp[0][a];
	if(lev[a] < lev[b]) swap(a,b);
	a = getPath(a, lev[a]-lev[b]);
	for(int i = lgn-1; i >= 0; i--)
		if(jmp[i][a]!=-1 and jmp[i][a]!=jmp[i][b])
			a = jmp[i][a], b = jmp[i][b];
	return jmp[0][a];
}

int findSet(int i){ return p[i]==i?i:p[i]=findSet(p[i]); }
bool isSameSet(int i, int j) { return findSet(i)==findSet(j); }

void unionSet(Edge &e){
	int i = e.u, j = e.v; wei[e.i] = e.w;
	int x = findSet(i), y = findSet(j);
	p[x]=p[y]=p[num]=num;
	if(x!=y) adj[num].pb(y);
	adj[num].pb(x); line[num]-=(x==y) | !line[x] | !line[y];
	good[num] |= good[i] | good[j] | !line[num] | !(line[x] and line[y]);
	num++;
}

void dfs(int s, int p){
	if(p!=-1) lev[s] = lev[p]+1, jmp[0][s] = p;
	for(auto u : adj[s]) if(u!=p) dfs(u,s);
}

void init(int N, int M, vector<int> u, vector<int> v, vector<int> w) {
	n = N, m = M; num = n; memset(jmp,-1,sizeof(jmp));
	for(int i = 0; i < n+m; i++) p[i] = i, line[i] = 1;
	for(int i = 0; i < m; i++) edge[i] = {u[i],v[i],w[i],i};
	sort(edge,edge+M,[&](Edge x, Edge y){ return x.w<y.w; });
	for(int i = 0; i < m; i++) edge[i].i=i, unionSet(edge[i]);
	dfs(num-1,-1);
	for(int i = 1; i < lgn; i++)
		for(int j = 0; j+(1<<i)-1 < n; j++)
			if(jmp[i-1][j]!=-1) jmp[i][j] = jmp[i-1][jmp[i-1][j]];
}

int getMinimumFuelCapacity(int x, int y) {
	int z = lca(x,y);
	while(jmp[0][z]!=-1 and !good[z])
		for(int i = lgn-1; i >= 0; i--) 
			if(jmp[i][z]!=-1 and !good[z]) z = jmp[i][z];
	return good[z]?wei[z-n]:-1;
}

/*
5 6
0 1 4
0 2 4
1 2 1
1 3 2
1 4 10
2 3 3
3
1 2
2 4
0 1
*/

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 51136 KB Output is correct
2 Correct 21 ms 51168 KB Output is correct
3 Correct 21 ms 51156 KB Output is correct
4 Correct 20 ms 51244 KB Output is correct
5 Correct 20 ms 51316 KB Output is correct
6 Correct 20 ms 51252 KB Output is correct
7 Correct 21 ms 51284 KB Output is correct
8 Correct 20 ms 51284 KB Output is correct
9 Correct 65 ms 59184 KB Output is correct
10 Correct 78 ms 60984 KB Output is correct
11 Correct 80 ms 60912 KB Output is correct
12 Correct 86 ms 61348 KB Output is correct
13 Correct 81 ms 63672 KB Output is correct
14 Correct 85 ms 59236 KB Output is correct
15 Correct 372 ms 62864 KB Output is correct
16 Correct 374 ms 62604 KB Output is correct
17 Correct 345 ms 63152 KB Output is correct
18 Execution timed out 2088 ms 65256 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 51136 KB Output is correct
2 Correct 21 ms 51168 KB Output is correct
3 Execution timed out 2084 ms 66776 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 51136 KB Output is correct
2 Correct 21 ms 51168 KB Output is correct
3 Correct 21 ms 51156 KB Output is correct
4 Correct 20 ms 51244 KB Output is correct
5 Correct 20 ms 51316 KB Output is correct
6 Correct 20 ms 51252 KB Output is correct
7 Correct 21 ms 51284 KB Output is correct
8 Correct 20 ms 51284 KB Output is correct
9 Incorrect 21 ms 51144 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 21 ms 51144 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 51136 KB Output is correct
2 Correct 21 ms 51168 KB Output is correct
3 Correct 21 ms 51156 KB Output is correct
4 Correct 20 ms 51244 KB Output is correct
5 Correct 20 ms 51316 KB Output is correct
6 Correct 20 ms 51252 KB Output is correct
7 Correct 21 ms 51284 KB Output is correct
8 Correct 20 ms 51284 KB Output is correct
9 Correct 65 ms 59184 KB Output is correct
10 Correct 78 ms 60984 KB Output is correct
11 Correct 80 ms 60912 KB Output is correct
12 Correct 86 ms 61348 KB Output is correct
13 Correct 81 ms 63672 KB Output is correct
14 Correct 85 ms 59236 KB Output is correct
15 Correct 372 ms 62864 KB Output is correct
16 Correct 374 ms 62604 KB Output is correct
17 Correct 345 ms 63152 KB Output is correct
18 Execution timed out 2088 ms 65256 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 21 ms 51144 KB Output isn't correct
2 Halted 0 ms 0 KB -