oj.uz

Submission #381524

# Submission time Handle Problem Language Result Execution time Memory
381524 2021-03-25T09:08:05 Z Return_0 Love Polygon (BOI18_polygon) C++17
100 / 100
 106 ms 10932 KB 
#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 1e5 + 7;

ll P [N], in [N], q [N], n, lst, ans;
unordered_map <string, ll> mp;
bool mark [N];
string s, t;

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	cin>> n; if (n & 1) kill(-1);
	for (ll i = 1; i <= n; i++) {
		cin>> s >> t;
		if (!mp.count(s)) mp[s] = ++lst;
		if (!mp.count(t)) mp[t] = ++lst;
		P[mp[s]] = mp[t];
		in[mp[t]]++;
	}

	lst = 0;
	for (ll i = 1; i <= n; i++) if (!in[i]) q[lst++] = i;
	for (ll i = 1; i <= n; i++) if (i == P[P[i]] && i != P[i]) mark[i] = mark[P[i]] = 1;

	for (ll l = 0, v, p, pp; l < lst; l++) {
		v = q[l], p = P[v], pp = P[p];
		if (mark[v]) continue;
		mark[v] = 1;
		ans++;
		if (mark[p]) continue;
		mark[p] = 1;
		in[pp]--;
		if (!in[pp]) q[lst++] = pp;
	}

	for (ll i = 1, cnt; i <= n; i++) if (!mark[i]) {
		cnt = 0;
		for (ll v = i; !mark[v]; v = P[v]) mark[v] = 1, cnt++;
		ans += (cnt + 1) / 2;
	}

	cout<< ans << endl;

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*

*/

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 364 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 384 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 92 ms 10640 KB Output is correct
5 Correct 97 ms 10768 KB Output is correct
6 Correct 96 ms 10656 KB Output is correct
7 Correct 1 ms 384 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 8848 KB Output is correct
2 Correct 96 ms 8720 KB Output is correct
3 Correct 66 ms 8464 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 96 ms 8720 KB Output is correct
6 Correct 95 ms 8720 KB Output is correct
7 Correct 90 ms 8732 KB Output is correct
8 Correct 87 ms 8720 KB Output is correct
9 Correct 91 ms 8720 KB Output is correct
10 Correct 70 ms 8608 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
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 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 384 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 92 ms 10640 KB Output is correct
20 Correct 97 ms 10768 KB Output is correct
21 Correct 96 ms 10656 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 102 ms 8848 KB Output is correct
24 Correct 96 ms 8720 KB Output is correct
25 Correct 66 ms 8464 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 96 ms 8720 KB Output is correct
28 Correct 95 ms 8720 KB Output is correct
29 Correct 90 ms 8732 KB Output is correct
30 Correct 87 ms 8720 KB Output is correct
31 Correct 91 ms 8720 KB Output is correct
32 Correct 70 ms 8608 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 102 ms 10896 KB Output is correct
38 Correct 96 ms 10896 KB Output is correct
39 Correct 100 ms 10896 KB Output is correct
40 Correct 101 ms 10916 KB Output is correct
41 Correct 93 ms 10896 KB Output is correct
42 Correct 96 ms 10896 KB Output is correct
43 Correct 97 ms 10896 KB Output is correct
44 Correct 95 ms 10896 KB Output is correct
45 Correct 106 ms 10932 KB Output is correct
46 Correct 97 ms 10896 KB Output is correct
47 Correct 90 ms 10896 KB Output is correct
48 Correct 93 ms 10896 KB Output is correct
49 Correct 95 ms 10896 KB Output is correct
50 Correct 68 ms 10640 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 95 ms 10896 KB Output is correct
53 Correct 99 ms 10896 KB Output is correct
54 Correct 94 ms 10896 KB Output is correct
55 Correct 86 ms 10896 KB Output is correct
56 Correct 87 ms 10896 KB Output is correct
57 Correct 73 ms 10640 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 1 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 102 ms 10640 KB Output is correct
66 Correct 99 ms 10640 KB Output is correct
67 Correct 93 ms 10640 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 2 ms 364 KB Output is correct
71 Correct 2 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 1 ms 364 KB Output is correct
74 Correct 1 ms 364 KB Output is correct
75 Correct 1 ms 364 KB Output is correct
76 Correct 1 ms 364 KB Output is correct
77 Correct 1 ms 364 KB Output is correct
78 Correct 1 ms 364 KB Output is correct
79 Correct 1 ms 364 KB Output is correct
80 Correct 1 ms 364 KB Output is correct
81 Correct 1 ms 364 KB Output is correct
82 Correct 1 ms 364 KB Output is correct
83 Correct 1 ms 364 KB Output is correct