oj.uz

Submission #419875

# Submission time Handle Problem Language Result Execution time Memory
419875 2021-06-07T14:54:09 Z flappybird Simurgh (IOI17_simurgh) C++14
100 / 100
 1104 ms 24284 KB 
#include "simurgh.h"

#include <bits/stdc++.h>
#include <cassert>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef int ll;

#define MAX 1010
#define MAXS 10

ll N, M;
ll sp[MAX][MAXS];
ll depth[MAX];
vector<ll> adj[MAX], tree[MAX], back[MAX], ans[MAX];
vector<ll> query;
vector<ll> U, V;
ll vis[MAX];
bool ck[MAX];
ll isroyal[MAX];
ll treeres;
ll leaf[MAX];
ll adj2[MAX][MAX];
vector<ll> leafv;

map<pair<ll, ll>, ll> sav;

void dfs(ll x = 0, ll p = -1, ll d = 0) {
	sp[x][0] = p;
	depth[x] = d;
	ll i;
	vis[x] = 1;
	for (i = 1; i < MAXS; i++) sp[x][i] = sp[sp[x][i - 1]][i - 1];
	for (auto v : adj[x]) if (!vis[v]) dfs(v, x, d + 1);
}
//{a, b}={c, d}인지 체크
bool chk(ll a, ll b, ll c, ll d) {
	if (a > b) swap(a, b);
	if (c > d) swap(c, d);
	return a == c && b == d;
}

ll getline(ll u, ll v) {
	return sav[{u, v}];
}

ll getline(ll i) {
	return getline(U[i], V[i]);
}

ll lca(ll u, ll v) {
	if (depth[u] != depth[v]) {
		if (depth[u] < depth[v]) swap(u, v);
		ll i;
		for (i = MAXS - 1; i >= 0; i--) if (depth[sp[u][i]] >= depth[v]) u = sp[u][i];
	}
	if (u == v) return u;
	ll i;
	for (i = MAXS - 1; i >= 0; i--) if (sp[u][i] != sp[v][i]) u = sp[u][i], v = sp[v][i];
	return sp[v][0];
}

ll dis(ll u, ll v) {
	return depth[u] + depth[v] - 2 * depth[lca(u, v)];
}

void erase(vector<ll>& v, ll a) {
	ll i;
	for (i = 0; i < v.size(); i++) if (v[i] == a) break;
	v.erase((v.begin() + i));
}

ll p(ll r, ll x) {
	if (lca(r, x) == x) {
		for (auto v : adj[x]) {
			if (lca(v, r) == v && lca(x, v) == x) return v;
		}
	}
	else return sp[x][0];
}

ll a(ll i) {
	if (sp[U[i]][0] == V[i]) return U[i];
	else return V[i];
}

//v is parent
std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
	ll cnt = 0;
	N = n, M = u.size();
	if (M == N - 1) {
		ll i;
		vector<ll> v;
		for (i = 0; i < M; i++) v.push_back(i);
		return v;
	}
	ll i;
	for (i = 0; i < M; i++) adj[u[i]].push_back(v[i]), adj[v[i]].push_back(u[i]);
	for (i = 0; i < M; i++) sav[{u[i], v[i]}] = i, sav[{v[i], u[i]}] = i;
	dfs();
	for (i = 0; i < M; i++) {
		if (lca(u[i], v[i]) == u[i]) swap(u[i], v[i]);
		if (sp[u[i]][0] == v[i]) tree[u[i]].push_back(v[i]), tree[v[i]].push_back(u[i]);
		else back[u[i]].push_back(v[i]), back[v[i]].push_back(u[i]);
	}
	U = u, V = v;
	for (i = 0; i < N; i++) {
		for (auto v : tree[i]) {
			if (i < v) query.push_back(getline(i, v));
		}
	}
	cnt++;
	assert(cnt <= 29998);
	treeres = count_common_roads(query);
	ll k, m;
	vector<ll> ans;
	for (k = 0; k < N; k++) isroyal[k] = -1;
	for (k = 0; k < N; k++) {
		for (m = 0; m < back[k].size(); m++) {
			ll v1 = k, v2 = back[k][m];
			ll l = lca(v1, v2);
			ll x = -1;
			ll c = 1;
			for (i = v1; i != l; i = sp[i][0]) {
				if (isroyal[i] != -1) x = i;
				else c = 0;
			}
			for (i = v2; i != l; i = sp[i][0]) {
				if (isroyal[i] != -1) x = i;
				else c = 0;
			}
			if (c) continue;
			if (x != -1) {
				query.push_back(getline(v1, v2));
				erase(query, getline(x, sp[x][0]));
				cnt++;
				assert(cnt <= 29998);
				ll q = count_common_roads(query);
				ll chk = 0;
				if (q + isroyal[x] - treeres) ans.push_back(getline(v1, v2)), chk = 1;
				adj2[v1][v2] = adj2[v2][v1] = 1;
				query.push_back(getline(x, sp[x][0]));
				for (i = v1; i != l; i = sp[i][0]) {
					if (isroyal[i] != -1) continue;
					erase(query, getline(i, sp[i][0]));
					cnt++;
					assert(cnt <= 29998);
					ll res = count_common_roads(query);
					if (treeres - (res - chk)) isroyal[i] = 1;
					else isroyal[i] = 0;
					query.push_back(getline(i, sp[i][0]));
				}
				for (i = v2; i != l; i = sp[i][0]) {
					if (isroyal[i] != -1) continue;
					erase(query, getline(i, sp[i][0]));
					cnt++;
					assert(cnt <= 29998);
					ll res = count_common_roads(query);
					if (treeres - (res - chk)) isroyal[i] = 1;
					else isroyal[i] = 0;
					query.push_back(getline(i, sp[i][0]));
				}
				erase(query, getline(v1, v2));
			}
			else {
				query.push_back(getline(v1, v2));
				map<ll, ll> mp;
				for (ll j = v1; (j != l); j = sp[j][0]) {
					ll e = getline(j, sp[j][0]);
					erase(query, e);
					cnt++;
					assert(cnt <= 29998);
					ll res = count_common_roads(query) - treeres;
					mp[j] = res;
					query.push_back(e);
				}
				for (ll j = v2; (j != l); j = sp[j][0]) {
					ll e = getline(j, sp[j][0]);
					erase(query, e);
					cnt++;
					assert(cnt <= 29998);
					ll res = count_common_roads(query) - treeres;
					mp[j] = res;
					query.push_back(e);
				}
				erase(query, getline(v1, v2));
				set<ll> st;
				for (ll j = v1; (j != l); j = sp[j][0]) st.insert(mp[j]);
				for (ll j = v2; (j != l); j = sp[j][0]) st.insert(mp[j]);
				if (st.size() == 1) {
					if (*st.begin() >= 0) {
						for (ll j = v1; (j != l); j = sp[j][0]) isroyal[j] = 0;
						for (ll j = v2; (j != l); j = sp[j][0]) isroyal[j] = 0;
					}
					else {
						for (ll j = v1; (j != l); j = sp[j][0]) isroyal[j] = 1;
						for (ll j = v2; (j != l); j = sp[j][0]) isroyal[j] = 1;
					}
				}
				else {
					if (*st.begin() == -1) {
						for (ll j = v1; (j != l); j = sp[j][0]) isroyal[j] = -mp[j];
						for (ll j = v2; (j != l); j = sp[j][0]) isroyal[j] = -mp[j];
					}
					else {
						for (ll j = v1; (j != l); j = sp[j][0]) isroyal[j] = 1 - mp[j];
						for (ll j = v2; (j != l); j = sp[j][0]) isroyal[j] = 1 - mp[j];
					}
				}
			}
		}
	};
	for (i = 1; i < N; i++) if (isroyal[i]) isroyal[i] = 1;
	//assert(cnt <= 3 * N);
	for (i = 1; i < N; i++) if (isroyal[i] == 1) ans.push_back(getline(i, sp[i][0]));
	vector<ll> mem;
	for (i = 0; i < N; i++) {
		// idk means I don't know
		vector<ll> idk;
		for (auto x : adj[i]) {
			if (p(i, x) == i) continue;
			if (adj2[x][i]) continue;
			idk.push_back(x);
			/*
			erase(query, getline(x, p(i, x)));
			ll e = getline(i, x);
			query.push_back(e);
			cnt++;
			assert(cnt <= 29998);
			ll res = count_common_roads(query) + isroyal[a(getline(x, p(i, x)))] - treeres;
			query.push_back(getline(x, p(i, x)));
			erase(query, e);
			adj2[i][x] = adj2[x][i] = 1;
			if (res == 1) ans.push_back(e);
			*/
		}
		ll q;
		ll sum = 0;
		mem = query;
		for (q = 0; q < idk.size(); q++) {
			erase(query, getline(idk[q], p(i, idk[q])));
			query.push_back(getline(i, idk[q]));
			sum += isroyal[a(getline(idk[q], p(i, idk[q])))];
		}
		ll total = count_common_roads(query) + sum - treeres;
		query = mem;
		while (total) {
			ll l, r;
			l = 0, r = idk.size() - 1;
			ll mid;
			while (l < r) {
				mid = (l + r) / 2;
				ll q;
				ll sum = 0;
				mem = query;
				for (q = l; q <= mid; q++) {
					erase(query, getline(idk[q], p(i, idk[q])));
					query.push_back(getline(i, idk[q]));
					sum += isroyal[a(getline(idk[q], p(i, idk[q])))];
				}
				ll res = count_common_roads(query) + sum - treeres;
				query = mem;
				if (res > 0) r = mid;
				else l = mid + 1;
			}
			ll x = idk[l];
			adj2[i][x] = adj2[x][i] = 1;
			ans.push_back(getline(i, x));
			erase(idk, x);
			total--;
		}
		for (auto qq : idk) adj2[i][qq] = adj2[qq][i] = 1;
	}
	sort(ans.begin(), ans.end());
	ans.erase(unique(ans.begin(), ans.end()), ans.end());
	assert(ans.size() == N - 1);
	return ans;
}

Compilation message

simurgh.cpp: In function 'void erase(std::vector<int>&, ll)':
simurgh.cpp:72:16: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |  for (i = 0; i < v.size(); i++) if (v[i] == a) break;
      |              ~~^~~~~~~~~~
simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:122:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |   for (m = 0; m < back[k].size(); m++) {
      |               ~~^~~~~~~~~~~~~~~~
simurgh.cpp:243:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  243 |   for (q = 0; q < idk.size(); q++) {
      |               ~~^~~~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from simurgh.cpp:4:
simurgh.cpp:279:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'int'} [-Wsign-compare]
  279 |  assert(ans.size() == N - 1);
      |         ~~~~~~~~~~~^~~~~~~~
simurgh.cpp: In function 'll p(ll, ll)':
simurgh.cpp:83:1: warning: control reaches end of non-void function [-Wreturn-type]
   83 | }
      | ^

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB correct
2 Correct 1 ms 332 KB correct
3 Correct 1 ms 332 KB correct
4 Correct 1 ms 332 KB correct
5 Correct 1 ms 332 KB correct
6 Correct 1 ms 332 KB correct
7 Correct 1 ms 332 KB correct
8 Correct 1 ms 332 KB correct
9 Correct 1 ms 332 KB correct
10 Correct 1 ms 332 KB correct
11 Correct 1 ms 332 KB correct
12 Correct 1 ms 332 KB correct
13 Correct 1 ms 332 KB correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB correct
2 Correct 1 ms 332 KB correct
3 Correct 1 ms 332 KB correct
4 Correct 1 ms 332 KB correct
5 Correct 1 ms 332 KB correct
6 Correct 1 ms 332 KB correct
7 Correct 1 ms 332 KB correct
8 Correct 1 ms 332 KB correct
9 Correct 1 ms 332 KB correct
10 Correct 1 ms 332 KB correct
11 Correct 1 ms 332 KB correct
12 Correct 1 ms 332 KB correct
13 Correct 1 ms 332 KB correct
14 Correct 4 ms 716 KB correct
15 Correct 5 ms 716 KB correct
16 Correct 4 ms 716 KB correct
17 Correct 5 ms 716 KB correct
18 Correct 3 ms 588 KB correct
19 Correct 4 ms 716 KB correct
20 Correct 4 ms 716 KB correct
21 Correct 4 ms 716 KB correct
22 Correct 3 ms 716 KB correct
23 Correct 2 ms 716 KB correct
24 Correct 2 ms 720 KB correct
25 Correct 1 ms 588 KB correct
26 Correct 2 ms 716 KB correct
27 Correct 2 ms 716 KB correct
28 Correct 2 ms 588 KB correct
29 Correct 1 ms 588 KB correct
30 Correct 2 ms 716 KB correct
31 Correct 2 ms 716 KB correct
32 Correct 2 ms 716 KB correct
33 Correct 2 ms 716 KB correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB correct
2 Correct 1 ms 332 KB correct
3 Correct 1 ms 332 KB correct
4 Correct 1 ms 332 KB correct
5 Correct 1 ms 332 KB correct
6 Correct 1 ms 332 KB correct
7 Correct 1 ms 332 KB correct
8 Correct 1 ms 332 KB correct
9 Correct 1 ms 332 KB correct
10 Correct 1 ms 332 KB correct
11 Correct 1 ms 332 KB correct
12 Correct 1 ms 332 KB correct
13 Correct 1 ms 332 KB correct
14 Correct 4 ms 716 KB correct
15 Correct 5 ms 716 KB correct
16 Correct 4 ms 716 KB correct
17 Correct 5 ms 716 KB correct
18 Correct 3 ms 588 KB correct
19 Correct 4 ms 716 KB correct
20 Correct 4 ms 716 KB correct
21 Correct 4 ms 716 KB correct
22 Correct 3 ms 716 KB correct
23 Correct 2 ms 716 KB correct
24 Correct 2 ms 720 KB correct
25 Correct 1 ms 588 KB correct
26 Correct 2 ms 716 KB correct
27 Correct 2 ms 716 KB correct
28 Correct 2 ms 588 KB correct
29 Correct 1 ms 588 KB correct
30 Correct 2 ms 716 KB correct
31 Correct 2 ms 716 KB correct
32 Correct 2 ms 716 KB correct
33 Correct 2 ms 716 KB correct
34 Correct 140 ms 6180 KB correct
35 Correct 131 ms 5996 KB correct
36 Correct 86 ms 4732 KB correct
37 Correct 10 ms 1584 KB correct
38 Correct 130 ms 6156 KB correct
39 Correct 109 ms 5444 KB correct
40 Correct 93 ms 4716 KB correct
41 Correct 122 ms 6152 KB correct
42 Correct 126 ms 6176 KB correct
43 Correct 58 ms 4044 KB correct
44 Correct 43 ms 3396 KB correct
45 Correct 63 ms 3660 KB correct
46 Correct 40 ms 3140 KB correct
47 Correct 18 ms 2224 KB correct
48 Correct 5 ms 1332 KB correct
49 Correct 8 ms 1544 KB correct
50 Correct 20 ms 2124 KB correct
51 Correct 57 ms 3652 KB correct
52 Correct 43 ms 3404 KB correct
53 Correct 43 ms 3116 KB correct
54 Correct 55 ms 4072 KB correct
55 Correct 51 ms 3780 KB correct
56 Correct 52 ms 3796 KB correct
57 Correct 51 ms 3800 KB correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB correct
2 Correct 1 ms 332 KB correct
3 Correct 531 ms 15964 KB correct
4 Correct 974 ms 24132 KB correct
5 Correct 946 ms 24240 KB correct
6 Correct 910 ms 24284 KB correct
7 Correct 892 ms 24212 KB correct
8 Correct 904 ms 24124 KB correct
9 Correct 1026 ms 24128 KB correct
10 Correct 1034 ms 24128 KB correct
11 Correct 1033 ms 24232 KB correct
12 Correct 1029 ms 24128 KB correct
13 Correct 1 ms 332 KB correct
14 Correct 1104 ms 24112 KB correct
15 Correct 1049 ms 24116 KB correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB correct
2 Correct 1 ms 332 KB correct
3 Correct 1 ms 332 KB correct
4 Correct 1 ms 332 KB correct
5 Correct 1 ms 332 KB correct
6 Correct 1 ms 332 KB correct
7 Correct 1 ms 332 KB correct
8 Correct 1 ms 332 KB correct
9 Correct 1 ms 332 KB correct
10 Correct 1 ms 332 KB correct
11 Correct 1 ms 332 KB correct
12 Correct 1 ms 332 KB correct
13 Correct 1 ms 332 KB correct
14 Correct 4 ms 716 KB correct
15 Correct 5 ms 716 KB correct
16 Correct 4 ms 716 KB correct
17 Correct 5 ms 716 KB correct
18 Correct 3 ms 588 KB correct
19 Correct 4 ms 716 KB correct
20 Correct 4 ms 716 KB correct
21 Correct 4 ms 716 KB correct
22 Correct 3 ms 716 KB correct
23 Correct 2 ms 716 KB correct
24 Correct 2 ms 720 KB correct
25 Correct 1 ms 588 KB correct
26 Correct 2 ms 716 KB correct
27 Correct 2 ms 716 KB correct
28 Correct 2 ms 588 KB correct
29 Correct 1 ms 588 KB correct
30 Correct 2 ms 716 KB correct
31 Correct 2 ms 716 KB correct
32 Correct 2 ms 716 KB correct
33 Correct 2 ms 716 KB correct
34 Correct 140 ms 6180 KB correct
35 Correct 131 ms 5996 KB correct
36 Correct 86 ms 4732 KB correct
37 Correct 10 ms 1584 KB correct
38 Correct 130 ms 6156 KB correct
39 Correct 109 ms 5444 KB correct
40 Correct 93 ms 4716 KB correct
41 Correct 122 ms 6152 KB correct
42 Correct 126 ms 6176 KB correct
43 Correct 58 ms 4044 KB correct
44 Correct 43 ms 3396 KB correct
45 Correct 63 ms 3660 KB correct
46 Correct 40 ms 3140 KB correct
47 Correct 18 ms 2224 KB correct
48 Correct 5 ms 1332 KB correct
49 Correct 8 ms 1544 KB correct
50 Correct 20 ms 2124 KB correct
51 Correct 57 ms 3652 KB correct
52 Correct 43 ms 3404 KB correct
53 Correct 43 ms 3116 KB correct
54 Correct 55 ms 4072 KB correct
55 Correct 51 ms 3780 KB correct
56 Correct 52 ms 3796 KB correct
57 Correct 51 ms 3800 KB correct
58 Correct 1 ms 332 KB correct
59 Correct 1 ms 332 KB correct
60 Correct 531 ms 15964 KB correct
61 Correct 974 ms 24132 KB correct
62 Correct 946 ms 24240 KB correct
63 Correct 910 ms 24284 KB correct
64 Correct 892 ms 24212 KB correct
65 Correct 904 ms 24124 KB correct
66 Correct 1026 ms 24128 KB correct
67 Correct 1034 ms 24128 KB correct
68 Correct 1033 ms 24232 KB correct
69 Correct 1029 ms 24128 KB correct
70 Correct 1 ms 332 KB correct
71 Correct 1104 ms 24112 KB correct
72 Correct 1049 ms 24116 KB correct
73 Correct 1 ms 332 KB correct
74 Correct 1042 ms 24128 KB correct
75 Correct 981 ms 23440 KB correct
76 Correct 257 ms 9760 KB correct
77 Correct 951 ms 24132 KB correct
78 Correct 970 ms 24116 KB correct
79 Correct 934 ms 24068 KB correct
80 Correct 923 ms 23464 KB correct
81 Correct 769 ms 20592 KB correct
82 Correct 899 ms 23384 KB correct
83 Correct 418 ms 13464 KB correct
84 Correct 386 ms 15540 KB correct
85 Correct 347 ms 14276 KB correct
86 Correct 241 ms 10436 KB correct
87 Correct 142 ms 8004 KB correct
88 Correct 111 ms 6792 KB correct
89 Correct 127 ms 6596 KB correct
90 Correct 88 ms 5948 KB correct
91 Correct 24 ms 2868 KB correct
92 Correct 15 ms 2420 KB correct
93 Correct 344 ms 14332 KB correct
94 Correct 231 ms 10448 KB correct
95 Correct 228 ms 10112 KB correct
96 Correct 99 ms 6324 KB correct
97 Correct 111 ms 6868 KB correct
98 Correct 145 ms 8256 KB correct
99 Correct 135 ms 6972 KB correct
100 Correct 40 ms 3632 KB correct
101 Correct 15 ms 2508 KB correct
102 Correct 343 ms 13268 KB correct
103 Correct 339 ms 13336 KB correct
104 Correct 331 ms 13156 KB correct
105 Correct 368 ms 13128 KB correct