oj.uz

Submission #1032870

# Submission time Handle Problem Language Result Execution time Memory
1032870 2024-07-24T10:11:28 Z touristhacker Love Polygon (BOI18_polygon) C++14
100 / 100
 229 ms 16912 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
int main(){
	cin.tie(0); ios::sync_with_stdio(0);
	int n, c = 0, sol = 0;
	cin >> n;
	if(n&1){
		cout << "-1\n";
		exit(0);
	}
	vector<int> love(n), deg(n), s, active(n, 1);
	map<string,int> dns;
	set<int> single;
	for(int i = 0; i < n; i++){
		single.insert(i);
		string a, b;
		cin >> a >> b;
		if(!dns.count(a)) dns[a] = c++;
		if(!dns.count(b)) dns[b] = c++;
		love[dns[a]] = dns[b];
		deg[dns[b]]++;
	}
	for(int i = 0; i < n; i++) if(deg[i] == 0) s.push_back(i);
	int i = 0;
	for(int j = 0; j < n; j++){
		if(active[j] && love[love[j]] == j && love[j] != j){
			active[j] = 0, active[love[j]] = 0;
			single.erase(j), single.erase(love[j]);
			i += 2;
		}
	}
	for(; i < n; i++){
		if(s.empty()) s.push_back(*single.begin());
		int u = s.back();
		s.pop_back();
		active[u] = 0;
		single.erase(u);
		sol++;
		if(active[love[u]]){
			i++;
			active[love[u]] = 0;
			single.erase(love[u]);
			if(active[love[love[u]]] && !--deg[love[love[u]]]) s.push_back(love[love[u]]);
			if(love[love[u]] == u) sol--, cout << "WHAT\n";
		}
	}
	cout << sol << "\n";
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 428 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 191 ms 16176 KB Output is correct
5 Correct 180 ms 16212 KB Output is correct
6 Correct 200 ms 16208 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 16364 KB Output is correct
2 Correct 197 ms 16224 KB Output is correct
3 Correct 172 ms 16208 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 193 ms 16140 KB Output is correct
6 Correct 194 ms 16592 KB Output is correct
7 Correct 212 ms 16612 KB Output is correct
8 Correct 169 ms 16468 KB Output is correct
9 Correct 168 ms 16912 KB Output is correct
10 Correct 140 ms 16788 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 428 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 191 ms 16176 KB Output is correct
20 Correct 180 ms 16212 KB Output is correct
21 Correct 200 ms 16208 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 190 ms 16364 KB Output is correct
24 Correct 197 ms 16224 KB Output is correct
25 Correct 172 ms 16208 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 193 ms 16140 KB Output is correct
28 Correct 194 ms 16592 KB Output is correct
29 Correct 212 ms 16612 KB Output is correct
30 Correct 169 ms 16468 KB Output is correct
31 Correct 168 ms 16912 KB Output is correct
32 Correct 140 ms 16788 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 203 ms 16276 KB Output is correct
38 Correct 204 ms 16760 KB Output is correct
39 Correct 180 ms 16588 KB Output is correct
40 Correct 183 ms 16676 KB Output is correct
41 Correct 187 ms 16568 KB Output is correct
42 Correct 197 ms 16528 KB Output is correct
43 Correct 190 ms 16464 KB Output is correct
44 Correct 192 ms 16540 KB Output is correct
45 Correct 179 ms 16468 KB Output is correct
46 Correct 182 ms 16468 KB Output is correct
47 Correct 173 ms 16848 KB Output is correct
48 Correct 201 ms 16328 KB Output is correct
49 Correct 189 ms 16348 KB Output is correct
50 Correct 166 ms 16468 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 197 ms 16128 KB Output is correct
53 Correct 207 ms 16588 KB Output is correct
54 Correct 201 ms 16588 KB Output is correct
55 Correct 180 ms 16604 KB Output is correct
56 Correct 170 ms 16856 KB Output is correct
57 Correct 149 ms 16700 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 456 KB Output is correct
62 Correct 0 ms 456 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 209 ms 16288 KB Output is correct
66 Correct 203 ms 16212 KB Output is correct
67 Correct 229 ms 16200 KB Output is correct
68 Correct 1 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 0 ms 348 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 456 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 1 ms 344 KB Output is correct
80 Correct 0 ms 348 KB Output is correct
81 Correct 0 ms 348 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct