oj.uz

Submission #633759

# Submission time Handle Problem Language Result Execution time Memory
633759 2022-08-23T08:12:55 Z NothingXD LOSTIKS (INOI20_lostiks) C++14
59 / 100
 2000 ms 196340 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
//typedef __uint128_t L;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
	cerr << " " << H;
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "):", debug_out(__VA_ARGS__)
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)
#define F first
#define S second

const int maxn = 1e6 + 10;
const int maxm = 20;
const int mask = (1 << 20);
const int inf = 1e9;

int n, m, S, T, edge[maxm][3], comp[maxn], cnt, sz, par[mask][maxm+1], h[maxm+1][maxn], dp[mask][maxm+1];
vector<int> g[maxn], G[maxm+1];
bool vis[maxn];

int first[maxn], to[maxn << 1], nxt[maxn << 1], ecnt;

void add(int u, int v){
	nxt[++ecnt] = first[u];
	to[ecnt] = v;
	first[u] = ecnt;
}

void dfs(int v, int *h, int p = -1){
	for (int i = first[v]; i; i = nxt[i]){
		int u = to[i];
		if (u != p){
			h[u] = h[v] + 1;
			dfs(u, h, v);
		}
	}
}

void getcomp(int v, int p = -1){
	vis[v] = true;
	comp[v] = cnt;
	for (auto u: g[v]) if (u != p) getcomp(u, v);
}

void getpar(int v, int *par, int p = -1){
	vis[v] = true;
	par[v] = sz;
	for (auto u : G[v]) if (u != p) getpar(u, par, v);
}

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);

	cin >> n >> S >> T;
	for (int i = 1; i < n; i++){
		int u, v, w; cin >> u >> v >> w;
		add(u, v);
		add(v, u);
		if (w == 0){
			g[u].push_back(v);
			g[v].push_back(u);
		}
		else{
			edge[m][0] = u;
			edge[m][1] = v;
			edge[m][2] = w;
			m++;
		}
	}

	dfs(S, h[m]);

	for (int i = 0; i < m; i++){
		if (h[m][edge[i][0]] > h[m][edge[i][1]]) swap(edge[i][0], edge[i][1]);
		dfs(edge[i][0], h[i]);
	}

	assert(m <= 20);

	for (int i = 1; i <= n; i++){
		if (!vis[i]){
			getcomp(i);
			cnt++;
		}
	}

	for (int i = 0; i < (1 << m); i++){
		for (int j = 0; j < m+1; j++){
			G[j].clear();
			vis[j] = false;
		}
		for (int j = 0; j < m; j++){
			if (!((i >> j) & 1)){
				G[comp[edge[j][0]]].push_back(comp[edge[j][1]]);
				G[comp[edge[j][1]]].push_back(comp[edge[j][0]]);
			}
		}
		sz = 0;
		for (int j = 0; j < m+1; j++){
			if (!vis[j]){
				sz++;
				getpar(j, par[i]);
			}
		}
	}

	for (int i = 0; i <= m; i++){
		dp[0][i] = h[i][T];
	}

	for (int msk = 1; msk < (1 << m); msk++){
		for (int i = 0; i <= m; i++){
			int v = (i == m? S: edge[i][0]);
			dp[msk][i] = inf;
			if (par[msk][comp[T]] == par[msk][comp[v]]){
				dp[msk][i] = h[i][T];
				continue;
			}
			for (int tmp = msk; tmp; tmp ^= tmp & -tmp){
				int j = __builtin_ctz(tmp);
				if (par[msk][comp[edge[j][2]]] == par[msk][comp[v]] && par[msk][comp[edge[j][0]]] == par[msk][comp[v]]){
					dp[msk][i] = min(dp[msk][i], dp[msk^(1 << j)][j] + h[i][edge[j][2]] + h[j][edge[j][2]]);
				}
			}
		}
	}

	cout << (dp[(1 << m) - 1][m] == inf? -1: dp[(1 << m) - 1][m]) << '\n';



	return 0;
}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23796 KB Output is correct
3 Correct 82 ms 32840 KB Output is correct
4 Correct 78 ms 32800 KB Output is correct
5 Correct 74 ms 32972 KB Output is correct
6 Correct 72 ms 32844 KB Output is correct
7 Correct 76 ms 32952 KB Output is correct
8 Correct 73 ms 32984 KB Output is correct
9 Correct 82 ms 33184 KB Output is correct
10 Correct 81 ms 32996 KB Output is correct
11 Correct 72 ms 32976 KB Output is correct
12 Correct 66 ms 34960 KB Output is correct
13 Correct 67 ms 35124 KB Output is correct
14 Correct 68 ms 34848 KB Output is correct
15 Correct 66 ms 34976 KB Output is correct
16 Correct 68 ms 35824 KB Output is correct
17 Correct 65 ms 35740 KB Output is correct
18 Correct 64 ms 36236 KB Output is correct
19 Correct 69 ms 40268 KB Output is correct
20 Correct 71 ms 40140 KB Output is correct
21 Correct 69 ms 39868 KB Output is correct
22 Correct 12 ms 23892 KB Output is correct
23 Correct 13 ms 23892 KB Output is correct
24 Correct 13 ms 23900 KB Output is correct
25 Correct 14 ms 23888 KB Output is correct
26 Correct 14 ms 23948 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 12 ms 23828 KB Output is correct
3 Correct 12 ms 24020 KB Output is correct
4 Correct 13 ms 24056 KB Output is correct
5 Correct 706 ms 111184 KB Output is correct
6 Correct 665 ms 111180 KB Output is correct
7 Correct 681 ms 111176 KB Output is correct
8 Correct 667 ms 111052 KB Output is correct
9 Correct 720 ms 111228 KB Output is correct
10 Correct 525 ms 111144 KB Output is correct
11 Correct 550 ms 111140 KB Output is correct
12 Correct 526 ms 111252 KB Output is correct
13 Correct 521 ms 111140 KB Output is correct
14 Correct 520 ms 111180 KB Output is correct
15 Correct 720 ms 111184 KB Output is correct
16 Correct 650 ms 111100 KB Output is correct
17 Correct 707 ms 111140 KB Output is correct
18 Correct 551 ms 111372 KB Output is correct
19 Correct 516 ms 111344 KB Output is correct
20 Correct 555 ms 111288 KB Output is correct
21 Correct 524 ms 111460 KB Output is correct
22 Correct 528 ms 111692 KB Output is correct
23 Correct 525 ms 111800 KB Output is correct
24 Correct 516 ms 111564 KB Output is correct
25 Correct 993 ms 196340 KB Output is correct

Subtask #3
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23796 KB Output is correct
3 Correct 82 ms 32840 KB Output is correct
4 Correct 78 ms 32800 KB Output is correct
5 Correct 74 ms 32972 KB Output is correct
6 Correct 72 ms 32844 KB Output is correct
7 Correct 76 ms 32952 KB Output is correct
8 Correct 73 ms 32984 KB Output is correct
9 Correct 82 ms 33184 KB Output is correct
10 Correct 81 ms 32996 KB Output is correct
11 Correct 72 ms 32976 KB Output is correct
12 Correct 66 ms 34960 KB Output is correct
13 Correct 67 ms 35124 KB Output is correct
14 Correct 68 ms 34848 KB Output is correct
15 Correct 66 ms 34976 KB Output is correct
16 Correct 68 ms 35824 KB Output is correct
17 Correct 65 ms 35740 KB Output is correct
18 Correct 64 ms 36236 KB Output is correct
19 Correct 69 ms 40268 KB Output is correct
20 Correct 71 ms 40140 KB Output is correct
21 Correct 69 ms 39868 KB Output is correct
22 Correct 12 ms 23892 KB Output is correct
23 Correct 13 ms 23892 KB Output is correct
24 Correct 13 ms 23900 KB Output is correct
25 Correct 14 ms 23888 KB Output is correct
26 Correct 14 ms 23948 KB Output is correct
27 Correct 13 ms 23764 KB Output is correct
28 Correct 12 ms 23828 KB Output is correct
29 Correct 12 ms 24020 KB Output is correct
30 Correct 13 ms 24056 KB Output is correct
31 Correct 706 ms 111184 KB Output is correct
32 Correct 665 ms 111180 KB Output is correct
33 Correct 681 ms 111176 KB Output is correct
34 Correct 667 ms 111052 KB Output is correct
35 Correct 720 ms 111228 KB Output is correct
36 Correct 525 ms 111144 KB Output is correct
37 Correct 550 ms 111140 KB Output is correct
38 Correct 526 ms 111252 KB Output is correct
39 Correct 521 ms 111140 KB Output is correct
40 Correct 520 ms 111180 KB Output is correct
41 Correct 720 ms 111184 KB Output is correct
42 Correct 650 ms 111100 KB Output is correct
43 Correct 707 ms 111140 KB Output is correct
44 Correct 551 ms 111372 KB Output is correct
45 Correct 516 ms 111344 KB Output is correct
46 Correct 555 ms 111288 KB Output is correct
47 Correct 524 ms 111460 KB Output is correct
48 Correct 528 ms 111692 KB Output is correct
49 Correct 525 ms 111800 KB Output is correct
50 Correct 516 ms 111564 KB Output is correct
51 Correct 993 ms 196340 KB Output is correct
52 Execution timed out 2097 ms 121780 KB Time limit exceeded
53 Halted 0 ms 0 KB -