oj.uz

답안 #783233

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
783233 2023-07-14T18:34:51 Z amirhoseinfar1385 LOSTIKS (INOI20_lostiks) C++14
100 / 100
 1591 ms 503780 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+10,lg=21;
struct yal{
	int u,v,w;
	int getad(int fu){
		int ret=(u^v^fu);
		return ret;
	}
};
yal alled[maxn];
vector<int>adj[maxn];
int n,m,visa[maxn],lca[lg][maxn*2],wtf[2*maxn],ghabl[maxn],vis[maxn],high[maxn],timea,para[maxn],s,t;
pair<int,int>stf[maxn];
int dp[(1<<20)][20];
vector<int>allind[(1<<20)];
vector<int>allv;
vector<int>z;
 
void aval(){
	for(int i=1;i<(1<<20);i++)
	{
		int j=0;
		for(;;j++){
			if((i>>j)&1){
				break;
			}
		}
		allind[i]=allind[i^(1<<j)];
		allind[i].push_back(j);
	}
	int ha=-1;
	for(int i=1;i<2*maxn;i++){
		if(__builtin_popcount(i)==1){
			ha++;
		}
		wtf[i]=ha;
	}
}
 
void dfs(int u,int par=0){
	high[u]=high[par]+1;
	z.push_back(u);
	stf[u].first=(int)z.size()-1;
	for(auto x:adj[u]){
		int v=alled[x].getad(u);
		if(v!=par){
			if(v!=alled[x].v){
				swap(alled[x].u,alled[x].v);
			}
			para[v]=x;
			dfs(v,u);
			z.push_back(u);
		}
	}
	stf[u].second=(int)z.size()-1;
}
 
inline void callca(){
	for(int i=0;i<lg;i++){
		for(int j=0;j<(int)z.size();j++){
			if(i==0){
				lca[i][j]=z[j];
				continue;
			}
			if(high[lca[i-1][j]]<high[lca[i-1][j+(1<<(i-1))]]){
				lca[i][j]=lca[i-1][j];
			}
			else{
				lca[i][j]=lca[i-1][j+(1<<(i-1))];
			}
		}
	}
}
 
inline int getlca(int u,int v){
	int fu=min(stf[u].first,stf[v].first);
	int fv=max(stf[u].first,stf[v].first);
	u=fu;
	v=fv;
	int len=v-u+1;
	int te=wtf[len];
	if(high[lca[te][u]]<high[lca[te][v-(1<<te)+1]]){
		return lca[te][u];
	}
	return lca[te][v-(1<<te)+1];
}
 
inline int dis(int u,int v){
	int uv=getlca(u,v);
	int ret=high[u]+high[v]-2*high[uv];
	return ret;
}
 
void solve(int u){
	//cout<<u<<endl;
	if(vis[u]==1){
		return ;
	}
	if(visa[u]==1){
		cout<<-1<<"\n";
		exit(0);
	}
	visa[u]=1;
	solve(alled[para[u]].getad(u));
	if(alled[para[u]].w!=0){
		allv.push_back(para[u]);
		solve(alled[para[u]].w);
	}
	vis[u]=1;
	return ;
}
 
void calghabl(int u,int par=0){
	ghabl[u]+=ghabl[par];
	for(auto x:adj[u]){
		int v=alled[x].getad(u);
		if(v!=par){
			calghabl(v,u);
		}
	}
}
 
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	aval();
	cin>>n;
	cin>>s>>t;
	for(int i=0;i<n-1;i++){
		cin>>alled[i].u>>alled[i].v>>alled[i].w;
		adj[alled[i].u].push_back(i);
		adj[alled[i].v].push_back(i);
	}
	dfs(s);
	callca();
	vis[s]=1;
	solve(t);
	m=allv.size();
	for(int i=0;i<m;i++){
		ghabl[alled[allv[i]].v]+=(1<<i);
	}
	calghabl(s);
	for(int i=1;i<(int)(1<<m);i++){
		for(auto x:allind[i]){
			int fake=1e9;
			if((ghabl[alled[allv[x]].u]&i)!=ghabl[alled[allv[x]].u]||(ghabl[alled[allv[x]].w]&i)!=ghabl[alled[allv[x]].w]){
				dp[i][x]=fake;
				continue;
			}
			if(__builtin_popcount(i)==1){
				dp[i][x]=dis(alled[allv[x]].u,alled[allv[x]].w)+dis(alled[allv[x]].w,s);
				continue;
			}
			for(auto y:allind[i^(1<<x)]){
				fake=min(fake,dis(alled[allv[y]].u,alled[allv[x]].w)+dis(alled[allv[x]].u,alled[allv[x]].w)+dp[(1<<x)^i][y]);
			}
			dp[i][x]=fake;
		}
	}
	if(m==0){
		int res=dis(s,t);
		cout<<res<<"\n";
		return 0;
	}
	else{
		int res=1e9;
		for(auto x:allind[(1<<m)-1]){
			res=min(res,dp[(1<<m)-1][x]+dis(alled[allv[x]].u,t));
		}
		cout<<res<<"\n";
	}
}

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 126 ms 142660 KB Output is correct
2 Correct 134 ms 142672 KB Output is correct
3 Correct 187 ms 167308 KB Output is correct
4 Correct 209 ms 167332 KB Output is correct
5 Correct 183 ms 167356 KB Output is correct
6 Correct 188 ms 167248 KB Output is correct
7 Correct 177 ms 167372 KB Output is correct
8 Correct 208 ms 167424 KB Output is correct
9 Correct 179 ms 167540 KB Output is correct
10 Correct 176 ms 167436 KB Output is correct
11 Correct 188 ms 167332 KB Output is correct
12 Correct 183 ms 169276 KB Output is correct
13 Correct 175 ms 169008 KB Output is correct
14 Correct 175 ms 168504 KB Output is correct
15 Correct 177 ms 169172 KB Output is correct
16 Correct 178 ms 171476 KB Output is correct
17 Correct 189 ms 171536 KB Output is correct
18 Correct 197 ms 171956 KB Output is correct
19 Correct 187 ms 176012 KB Output is correct
20 Correct 177 ms 175880 KB Output is correct
21 Correct 177 ms 175696 KB Output is correct
22 Correct 125 ms 142620 KB Output is correct
23 Correct 125 ms 142708 KB Output is correct
24 Correct 120 ms 142712 KB Output is correct
25 Correct 125 ms 142712 KB Output is correct
26 Correct 128 ms 142728 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 126 ms 142568 KB Output is correct
2 Correct 125 ms 142628 KB Output is correct
3 Correct 125 ms 142684 KB Output is correct
4 Correct 120 ms 142748 KB Output is correct
5 Correct 142 ms 145040 KB Output is correct
6 Correct 129 ms 144668 KB Output is correct
7 Correct 128 ms 144448 KB Output is correct
8 Correct 127 ms 144332 KB Output is correct
9 Correct 132 ms 144460 KB Output is correct
10 Correct 194 ms 185384 KB Output is correct
11 Correct 197 ms 185396 KB Output is correct
12 Correct 218 ms 185440 KB Output is correct
13 Correct 195 ms 185392 KB Output is correct
14 Correct 209 ms 185448 KB Output is correct
15 Correct 142 ms 145048 KB Output is correct
16 Correct 131 ms 144432 KB Output is correct
17 Correct 130 ms 144460 KB Output is correct
18 Correct 197 ms 185628 KB Output is correct
19 Correct 196 ms 185712 KB Output is correct
20 Correct 213 ms 185672 KB Output is correct
21 Correct 200 ms 185676 KB Output is correct
22 Correct 194 ms 185920 KB Output is correct
23 Correct 193 ms 186004 KB Output is correct
24 Correct 193 ms 186008 KB Output is correct
25 Correct 126 ms 142620 KB Output is correct

Subtask #3
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 126 ms 142660 KB Output is correct
2 Correct 134 ms 142672 KB Output is correct
3 Correct 187 ms 167308 KB Output is correct
4 Correct 209 ms 167332 KB Output is correct
5 Correct 183 ms 167356 KB Output is correct
6 Correct 188 ms 167248 KB Output is correct
7 Correct 177 ms 167372 KB Output is correct
8 Correct 208 ms 167424 KB Output is correct
9 Correct 179 ms 167540 KB Output is correct
10 Correct 176 ms 167436 KB Output is correct
11 Correct 188 ms 167332 KB Output is correct
12 Correct 183 ms 169276 KB Output is correct
13 Correct 175 ms 169008 KB Output is correct
14 Correct 175 ms 168504 KB Output is correct
15 Correct 177 ms 169172 KB Output is correct
16 Correct 178 ms 171476 KB Output is correct
17 Correct 189 ms 171536 KB Output is correct
18 Correct 197 ms 171956 KB Output is correct
19 Correct 187 ms 176012 KB Output is correct
20 Correct 177 ms 175880 KB Output is correct
21 Correct 177 ms 175696 KB Output is correct
22 Correct 125 ms 142620 KB Output is correct
23 Correct 125 ms 142708 KB Output is correct
24 Correct 120 ms 142712 KB Output is correct
25 Correct 125 ms 142712 KB Output is correct
26 Correct 128 ms 142728 KB Output is correct
27 Correct 126 ms 142568 KB Output is correct
28 Correct 125 ms 142628 KB Output is correct
29 Correct 125 ms 142684 KB Output is correct
30 Correct 120 ms 142748 KB Output is correct
31 Correct 142 ms 145040 KB Output is correct
32 Correct 129 ms 144668 KB Output is correct
33 Correct 128 ms 144448 KB Output is correct
34 Correct 127 ms 144332 KB Output is correct
35 Correct 132 ms 144460 KB Output is correct
36 Correct 194 ms 185384 KB Output is correct
37 Correct 197 ms 185396 KB Output is correct
38 Correct 218 ms 185440 KB Output is correct
39 Correct 195 ms 185392 KB Output is correct
40 Correct 209 ms 185448 KB Output is correct
41 Correct 142 ms 145048 KB Output is correct
42 Correct 131 ms 144432 KB Output is correct
43 Correct 130 ms 144460 KB Output is correct
44 Correct 197 ms 185628 KB Output is correct
45 Correct 196 ms 185712 KB Output is correct
46 Correct 213 ms 185672 KB Output is correct
47 Correct 200 ms 185676 KB Output is correct
48 Correct 194 ms 185920 KB Output is correct
49 Correct 193 ms 186004 KB Output is correct
50 Correct 193 ms 186008 KB Output is correct
51 Correct 126 ms 142620 KB Output is correct
52 Correct 1424 ms 398372 KB Output is correct
53 Correct 1386 ms 398508 KB Output is correct
54 Correct 1381 ms 395756 KB Output is correct
55 Correct 1406 ms 395548 KB Output is correct
56 Correct 1396 ms 396520 KB Output is correct
57 Correct 1591 ms 398132 KB Output is correct
58 Correct 123 ms 142668 KB Output is correct
59 Correct 126 ms 142672 KB Output is correct
60 Correct 127 ms 142708 KB Output is correct
61 Correct 1351 ms 398468 KB Output is correct
62 Correct 1372 ms 395416 KB Output is correct
63 Correct 1374 ms 400544 KB Output is correct
64 Correct 185 ms 169764 KB Output is correct
65 Correct 220 ms 171280 KB Output is correct
66 Correct 1370 ms 398536 KB Output is correct
67 Correct 1328 ms 398108 KB Output is correct
68 Correct 1022 ms 394276 KB Output is correct
69 Correct 1066 ms 394408 KB Output is correct
70 Correct 1050 ms 393372 KB Output is correct
71 Correct 1073 ms 393512 KB Output is correct
72 Correct 1035 ms 393364 KB Output is correct
73 Correct 895 ms 388960 KB Output is correct
74 Correct 1111 ms 436744 KB Output is correct
75 Correct 1149 ms 436536 KB Output is correct
76 Correct 1153 ms 437404 KB Output is correct
77 Correct 1192 ms 436020 KB Output is correct
78 Correct 1006 ms 402836 KB Output is correct
79 Correct 1050 ms 402576 KB Output is correct
80 Correct 998 ms 401060 KB Output is correct
81 Correct 860 ms 413252 KB Output is correct
82 Correct 1116 ms 458216 KB Output is correct
83 Correct 1160 ms 457748 KB Output is correct
84 Correct 1166 ms 467660 KB Output is correct
85 Correct 1184 ms 503780 KB Output is correct
86 Correct 1257 ms 502192 KB Output is correct
87 Correct 1218 ms 501780 KB Output is correct