oj.uz

답안 #373700

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
373700 2021-03-05T13:15:39 Z luciocf Love Polygon (BOI18_polygon) C++14
75 / 100
 346 ms 15388 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e5+10;

int f[maxn];

int comp[maxn], head[maxn], nivel[maxn], cc;
int ini[maxn], fim[maxn];
int mark[maxn];

bool done[maxn];

void dfs(int u)
{
	mark[u] = 1;

	if (mark[f[u]] == 1)
	{
		++cc;
		head[cc] = u, mark[u] = 2;
		ini[cc] = f[u], fim[cc] = u;
		return;
	}

	if (!mark[f[u]]) dfs(f[u]);

	nivel[u] = nivel[f[u]]+1, comp[u] = comp[f[u]];
	mark[u] = 2;
}

int main(void)
{
	int n;
	cin >> n;

	map<string, int> mp;

	int ind = 0;

	for (int i = 1; i <= n; i++)
	{
		string s1, s2;
		cin >> s1 >> s2;

		if (mp.find(s1) == mp.end()) mp[s1] = ++ind;
		if (mp.find(s2) == mp.end()) mp[s2] = ++ind;

		f[mp[s1]] = mp[s2];
	}

	if (n&1)
	{
		cout << "-1\n";
		return 0;
	}

	for (int i = 1; i <= n; i++)
		if (!mark[i])
			dfs(i);

	int ans = n;

	vector<int> v;
	for (int i = 1; i <= n; i++)
		if (nivel[i])
			v.push_back(i);

	sort(v.begin(), v.end(), [&] (int a, int b) {return nivel[a] > nivel[b];});

	for (int i = 1; i <= n; i++)
	{
		if (done[i]) continue;
		
		if (f[i] != i && f[f[i]] == i)
		{
			done[i] = done[f[i]] = 1;
			ans -= 2;
		}
	}

	for (auto u: v)
	{
		if (done[u]) continue;

		if (!done[f[u]])
		{
			ans--;
			done[u] = done[f[u]] = 1;
		}
	}

	for (int i = 1; i <= cc; i++)
		if (ini[i] != fim[i] && !done[ini[i]] && !done[fim[i]])
			ans--;

	cout << ans << "\n";
}

Subtask #1
21.0 / 21.0

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

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 322 ms 15080 KB Output is correct
5 Correct 313 ms 12392 KB Output is correct
6 Correct 318 ms 15388 KB Output is correct
7 Correct 346 ms 10348 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 304 ms 10472 KB Output is correct
2 Correct 309 ms 11004 KB Output is correct
3 Correct 260 ms 10220 KB Output is correct
4 Correct 296 ms 8556 KB Output is correct
5 Correct 320 ms 11624 KB Output is correct
6 Correct 285 ms 10356 KB Output is correct
7 Correct 309 ms 10344 KB Output is correct
8 Correct 282 ms 10732 KB Output is correct
9 Correct 280 ms 10344 KB Output is correct
10 Correct 256 ms 10344 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 380 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 322 ms 15080 KB Output is correct
20 Correct 313 ms 12392 KB Output is correct
21 Correct 318 ms 15388 KB Output is correct
22 Correct 346 ms 10348 KB Output is correct
23 Correct 304 ms 10472 KB Output is correct
24 Correct 309 ms 11004 KB Output is correct
25 Correct 260 ms 10220 KB Output is correct
26 Correct 296 ms 8556 KB Output is correct
27 Correct 320 ms 11624 KB Output is correct
28 Correct 285 ms 10356 KB Output is correct
29 Correct 309 ms 10344 KB Output is correct
30 Correct 282 ms 10732 KB Output is correct
31 Correct 280 ms 10344 KB Output is correct
32 Correct 256 ms 10344 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 306 ms 12136 KB Output is correct
38 Incorrect 307 ms 12648 KB Output isn't correct
39 Halted 0 ms 0 KB -