제출 #716523

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
716523		ajab_01	Love Polygon (BOI18_polygon)	C++17	25 / 100	384 ms	22376 KiB

polygon

#include<bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;
vector<int> g[N] , adj[N] , cy;
map<string , int> mp;
int ans , n , num , len , cnt;
bool deg[N] , vis[N] , make_rel[N] , ch = 1;

void dfs(int ver){
	vis[ver] = 1;
	len++;
	for(int i : g[ver]){
		if(vis[i]) continue;
		dfs(i);
	}
}

void dfs2(int ver){
	vis[ver] = 1;
	for(int i : adj[ver]){
		if(vis[i]) continue;
		dfs2(i);
		if(!make_rel[i] && !make_rel[ver]) make_rel[i] = make_rel[ver] = 1;
	}
}

int main(){
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n;
	for(int i = 0 ; i < n ; i++){
		string a , b;
		cin >> a >> b;
		if(mp.find(a) == mp.end()) mp[a] = num++;
		if(mp.find(b) == mp.end()) mp[b] = num++;
		g[mp[a]].push_back(mp[b]);
		adj[mp[b]].push_back(mp[a]);
		deg[mp[b]] = 1;
	}
	if(n & 1){
		cout << -1 << '\n';
		return 0;
	}

	for(int i = 0 ; i < n ; i++)
		ch &= deg[i];

	if(ch){
		for(int i = 0 ; i < n ; i++){
			if(vis[i]) continue;
			len = 0;
			dfs(i);
			if(len == 2) continue;
			ans += len / 2;
			if(len & 1) ans++;
		}
		cout << ans << '\n';
		return 0;
	}

	for(int i = 0 ; i < n ; i++)
		if(g[i][0] == i)
			dfs2(i);
	for(int i = 0 ; i < n ; i++)
		cnt++;
	ans = n - cnt;
	ans += cnt / 2;
	cout << ans << '\n';
	return 0;
}

• Subtask 1: 0 / 21
• Subtask 2: 25 / 25
• Subtask 3: 0 / 29
• Subtask 4: 0 / 25