oj.uz

Submission #373695

# Submission time Handle Problem Language Result Execution time Memory
373695 2021-03-05T12:54:03 Z luciocf Love Polygon (BOI18_polygon) C++14
75 / 100
 324 ms 13948 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 mark[maxn];

bool done[maxn];

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

	if (mark[f[u]] == 1)
	{
		++cc;
		head[cc] = u, mark[u] = 2;
		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)
	{
		printf("-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;
		}
	}

	printf("%d\n", ans);
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 380 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 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 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
15 Correct 1 ms 364 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory 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 320 ms 13620 KB Output is correct
5 Correct 316 ms 10856 KB Output is correct
6 Correct 316 ms 13948 KB Output is correct
7 Correct 297 ms 8940 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 305 ms 10728 KB Output is correct
2 Correct 323 ms 11240 KB Output is correct
3 Correct 259 ms 9708 KB Output is correct
4 Correct 304 ms 8976 KB Output is correct
5 Correct 324 ms 12392 KB Output is correct
6 Correct 319 ms 10728 KB Output is correct
7 Correct 303 ms 10816 KB Output is correct
8 Correct 278 ms 10732 KB Output is correct
9 Correct 289 ms 10984 KB Output is correct
10 Correct 255 ms 10728 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 380 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 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 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
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 320 ms 13620 KB Output is correct
20 Correct 316 ms 10856 KB Output is correct
21 Correct 316 ms 13948 KB Output is correct
22 Correct 297 ms 8940 KB Output is correct
23 Correct 305 ms 10728 KB Output is correct
24 Correct 323 ms 11240 KB Output is correct
25 Correct 259 ms 9708 KB Output is correct
26 Correct 304 ms 8976 KB Output is correct
27 Correct 324 ms 12392 KB Output is correct
28 Correct 319 ms 10728 KB Output is correct
29 Correct 303 ms 10816 KB Output is correct
30 Correct 278 ms 10732 KB Output is correct
31 Correct 289 ms 10984 KB Output is correct
32 Correct 255 ms 10728 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 321 ms 10780 KB Output is correct
38 Incorrect 307 ms 11304 KB Output isn't correct
39 Halted 0 ms 0 KB -