oj.uz

답안 #535561

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535561 2022-03-10T13:45:21 Z inksamurai Logičari (COCI21_logicari) C++17
110 / 110
 148 ms 19124 KB 
#include <bits/stdc++.h>
#define int ll
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,x,n) for(int i=x;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3HspL4A ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vec(int);
void print(){cout<<"\n";}
template<class T,class...E>
void print(const T&v,const E&...u){cout<<v<<' ',print(u...);}
// e 

const int inf=1e9+11;
const int nax=100000;
int n,root,ru,usd[nax+11];
vi adj[nax+11];

void get_root(int v,int par){
	if(root!=-1) return;
	usd[v]=1;
	for(auto u:adj[v]){
		if(u==par) continue;
		if(usd[u]){
			root=v;
			ru=u;
			return;
		}
		get_root(u,v);
	}
}

int xru,yru,dp[nax+11][2][2];

void quq(int v,int par){
	dp[v][0][0]=0;
	dp[v][1][0]=1;
	bool pok=0;
	for(auto u:adj[v]){
		if(u==par) continue;
		pok=pok or (u==ru);
		quq(u,v);
		dp[v][0][0]+=dp[u][0][1];
		dp[v][1][0]+=dp[u][0][0];
	}
	dp[v][0][1]=dp[v][1][1]=inf;
	for(auto u:adj[v]){
		if(u==par) continue;
		dp[v][0][1]=min(dp[v][0][1],dp[v][0][0]-dp[u][0][1]+dp[u][1][1]);
		dp[v][1][1]=min(dp[v][1][1],dp[v][1][0]-dp[u][0][0]+dp[u][1][0]);
	}
	if(pok){
		rep(t,2)rep(t1,2) dp[v][t][t1]=inf;
		if(xru){
			if(yru){
				dp[v][1][1]=1;
				dp[v][0][1]=0;
				for(auto u:adj[v]){
					if(u==par) continue;
					if(u!=ru){
						dp[v][1][1]+=dp[u][0][0];
						dp[v][0][1]+=dp[u][0][1];
					}else{
						dp[v][1][1]+=dp[u][1][0];
						dp[v][0][1]+=dp[u][1][1];
					}
				}
			}else{
				dp[v][0][1]=0;
				for(auto u:adj[v]){
					if(u==par) continue;
					if(u!=ru){
						dp[v][0][1]+=dp[u][0][1];
					}else{
						dp[v][0][1]+=dp[u][1][0];
					}
				}
			}
		}else{
			if(yru){
				dp[v][0][0]=0;
				dp[v][1][0]=1;
				for(auto u:adj[v]){
					if(u==par) continue;
					if(u!=ru){
						dp[v][0][0]+=dp[u][0][1];
						dp[v][1][0]+=dp[u][0][0];
					}else{
						dp[v][0][0]+=dp[u][0][1];
						dp[v][1][0]+=dp[u][0][0];
					}
				}
				for(auto u:adj[v]){
					if(u==par or u==ru) continue;
					dp[v][0][1]=min(dp[v][0][1],dp[v][0][0]-dp[u][0][1]+dp[u][1][1]);
					dp[v][1][1]=min(dp[v][1][1],dp[v][1][0]-dp[u][0][0]+dp[u][1][0]);
				}
			}else{
				dp[v][0][0]=0;
				for(auto u:adj[v]){
					if(u==par) continue;
					if(u!=ru){
						dp[v][0][0]+=dp[u][0][1];
					}else{
						dp[v][0][0]+=dp[u][0][0];
					}
				}
				for(auto u:adj[v]){
					if(u==par or u==ru) continue;
					dp[v][0][1]=min(dp[v][0][1],dp[v][0][0]-dp[u][0][1]+dp[u][1][1]);
				}
			}
		}
	}
}

signed main(){
_3HspL4A;
	cin>>n;
	rep(i,n){
		int u,v;
		cin>>u>>v;
		u-=1,v-=1;
		adj[u].pb(v);
		adj[v].pb(u);
	}
	root=-1;
	get_root(0,-1);
	{
		rep(i,sz(adj[root])){
			if(adj[root][i]==ru){
				adj[root].erase(adj[root].begin()+i);
				break;
			}
		}
		rep(i,sz(adj[ru])){
			if(adj[ru][i]==root){
				adj[ru].erase(adj[ru].begin()+i);
				break;
			}
		}
	}
	int ans=inf;
	rep(t,2){
		rep(t1,2){
			yru=!t,xru=!t1;
			rep(i,n){
				dp[i][0][0]=dp[i][0][1]=dp[i][1][0]=dp[i][1][1]=inf;
			}
			quq(root,-1);
			ans=min(ans,dp[root][t][t1]);
		}
	}
	print(ans>=inf?-1:ans);
//	
	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 148 ms 18972 KB Output is correct
6 Correct 119 ms 19124 KB Output is correct
7 Correct 136 ms 19080 KB Output is correct
8 Correct 115 ms 19080 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2696 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 3 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 2 ms 2772 KB Output is correct
24 Correct 2 ms 2772 KB Output is correct

Subtask #4
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 148 ms 18972 KB Output is correct
6 Correct 119 ms 19124 KB Output is correct
7 Correct 136 ms 19080 KB Output is correct
8 Correct 115 ms 19080 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 1 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 2 ms 2696 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 3 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 2 ms 2644 KB Output is correct
31 Correct 2 ms 2772 KB Output is correct
32 Correct 2 ms 2772 KB Output is correct
33 Correct 65 ms 9320 KB Output is correct
34 Correct 79 ms 9440 KB Output is correct
35 Correct 80 ms 9292 KB Output is correct
36 Correct 80 ms 9388 KB Output is correct
37 Correct 12 ms 4308 KB Output is correct
38 Correct 67 ms 9380 KB Output is correct
39 Correct 6 ms 3156 KB Output is correct
40 Correct 70 ms 9284 KB Output is correct
41 Correct 46 ms 10424 KB Output is correct
42 Correct 61 ms 10428 KB Output is correct
43 Correct 120 ms 19012 KB Output is correct
44 Correct 102 ms 14736 KB Output is correct