Submission #635326

#	Time	Username	Problem	Language	Result	Execution time	Memory
635326		S2speed	LOSTIKS (INOI20_lostiks)	C++17	59 / 100	2073 ms	232008 KiB

Main

#include<bits/stdc++.h>

using namespace std;

#pragma GCC optimize ("Ofast")

#define sze(x) (int)(x.size())
typedef long long ll;
typedef pair<ll , ll> pll;
typedef pair<int , int> pii;

const ll maxn = (1 << 20) + 17 , inf = 2e8;

int n , s , t;
vector<pii> adj[maxn];
vector<int> dis[maxn];
int bfs[maxn] , sz = 0;
int g[maxn] , k[22] , d[22] , e[22] , dp[maxn][22];

void BFS(int r , bool f = false){
	sz = 0;
	dis[r].assign(n , inf);
	dis[r][r] = 0;
	g[r] = 0;
	bfs[sz++] = r;
	int x = 0;
	while(x < sz){
		int v = bfs[x++];
		for(auto p : adj[v]){
			int i = p.first , t = p.second;
			if(dis[r][i] < dis[r][v] + 1) continue;
			if(f){
				g[i] = g[v];
				if(t != -1){
					g[i] ^= (1 << t);
					d[t] = v;
				}
			}
			dis[r][i] = dis[r][v] + 1;
			bfs[sz++] = i;
		}
	}
	return;
}

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

	memset(dp , 63 , sizeof(dp));
	cin>>n>>s>>t; s--; t--;
	int m = 0;
	for(int i = 1 ; i < n ; i++){
		int v , u , w;
		cin>>v>>u>>w; v--; u--; w--;
		if(w != -1){
			k[m] = w;
			adj[v].push_back({u , m}); adj[u].push_back({v , m});
			m++;
		} else {
			adj[v].push_back({u , w}); adj[u].push_back({v , w});
		}
	}
	BFS(s , true);
	if(g[t] == 0){
		cout<<dis[s][t]<<'\n';
		return 0;
	}
	for(int j = 0 ; j < m ; j++){
		e[j] = g[k[j]] | g[d[j]];
		BFS(d[j]);
		if(e[j] == 0){
			dp[(1 << j)][j] = dis[s][k[j]] + dis[d[j]][k[j]];
		}
	}
	int lm = (1 << m);
	for(int mask = 1 ; mask < lm ; mask++){
		for(int j = 0 ; j < m ; j++){
			if(mask & (1 << j)) continue;
			if((e[j] & mask) != e[j]) continue;
			int h = inf;
			for(int i = 0 ; i < m ; i++){
				if(!(mask & (1 << i))) continue;
				h = min(h , dp[mask][i] + dis[d[i]][k[j]] + dis[d[j]][k[j]]);
			}
			dp[mask ^ (1 << j)][j] = min(dp[mask ^ (1 << j)][j] , h);
		}
	}
//	cout<<dp[2][1]<<' '<<dp[6][2]<<' '<<dp[7][0]<<'\n';
//	cout<<dis[d[0]][t]<<'\n';
	int ans = inf;
	for(int mask = 1 ; mask < lm ; mask++){
		if((g[t] & mask) != g[t]) continue;
		int h = inf;
		for(int i = 0 ; i < m ; i++){
			if(!(mask & (1 << i))) continue;
//			cout<<mask<<' '<<i<<'\n';
			h = min(h , dp[mask][i] + dis[d[i]][t]);
		}
		ans = min(ans , h);
	}
	cout<<(ans == inf ? -1 : ans)<<'\n';
	return 0;
}

• Subtask 1: 23 / 23
• Subtask 2: 36 / 36
• Subtask 3: 0 / 41