oj.uz

Submission #359290

# Submission time Handle Problem Language Result Execution time Memory
359290 2021-01-26T15:58:43 Z Return_0 Mergers (JOI19_mergers) C++17
100 / 100
 1421 ms 129500 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);
#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) {
	if(a.empty())return out<<"[]";out<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());) out<< ", " << a[i];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 = 5e5 + 7, lg = 19;

ll par [N], tin [N], T, h [N], c [N], anc [N][lg], val [N], n, k, ans;
vector <ll> adj [N], col [N];
vector <pll> E;

ll root (cl &v) { return par[v] = (par[v] == v ? v : root(par[v])); }
inline void unite (cl &v, cl &u) { par[root(u)] = root(v); }

void DFS (cl &v = 1, cl &pr = 1) {
	tin[v] = ++T;
	h[v] = h[pr] + 1;
	anc[v][0] = pr;
	for (ll i = 1; i < lg; i++)	anc[v][i] = anc[anc[v][i-1]][i-1];
	for (auto &u : adj[v]) if (u ^ pr)	DFS(u, v);
}

inline ll up (ll v, ll dis) { for (ll i = 0; i < lg; i++) if (dis >> i & 1)	v = anc[v][i]; return v; }
inline ll LCA (ll v, ll u) {
	if (h[v] > h[u])	swap(v, u);
	u = up(u, h[u] - h[v]);
	if (v == u)	return v;
	for (ll i = lg; i--;) if (anc[v][i] ^ anc[u][i]) v = anc[v][i], u = anc[u][i];
	return anc[v][0];
}

ll dfs (cl &v = 1) {
	for (auto &u : adj[v]) if (u ^ anc[v][0])	val[v] += dfs(u);
	return val[v];
}

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

	iota(par, par + N, 0);

	cin>> n >> k;
	for (ll i = 1, v, u; i < n; i++) {
		cin>> v >> u;
		adj[v].push_back(u);
		adj[u].push_back(v);
	}

	for (ll i = 1; i <= n; i++)	cin>> c[i], col[c[i]].push_back(i);

	DFS();

	for (ll i = 1; i <= k; i++)	{
		sort(All(col[i]), [&](ll x, ll y) { return tin[x] < tin[y]; });
		ll cur = col[i][0];
		for (auto &v : col[i]) {
			val[cur]++, val[v]++;
			cur = LCA(cur, v);
			val[cur] -= 2;
		}
	}

	dfs();

	for (ll i = 2; i <= n; i++) {
		if (val[i] > 0)	unite(i, anc[i][0]);
		else E.push_back({i, anc[i][0]});
	}

	memset(val, 0, sizeof val);
	for (auto &e : E)	val[root(e.fr)]++, val[root(e.sc)]++;

	for (ll i = 1; i <= n; i++) if (root(i) == i)	ans += (val[i] == 1);

	cout<< (ans + 1) /2 << endl;

	return 0;
}
/*
5 4
1 2
2 3
3 4
3 5
1
2
1
3
4

5 4
1 2
2 3
3 4
4 5
1
2
3
4
1

5 5
1 2
1 3
1 4
1 5
1
2
3
4
5

*/

Compilation message

mergers.cpp:2: warning: ignoring #pragma comment  [-Wunknown-pragmas]
    2 | #pragma comment(linker, "/stack:200000000")
      | 
mergers.cpp: In function 'std::ostream& operator<<(std::ostream&, const std::vector<_Tp>&)':
mergers.cpp:44:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   44 |  if(a.empty())return out<<"[]";out<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());) out<< ", " << a[i];out<< ']';  }
      |  ^~
mergers.cpp:44:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   44 |  if(a.empty())return out<<"[]";out<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());) out<< ", " << a[i];out<< ']';  }
      |                                ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 27756 KB Output is correct
2 Correct 20 ms 27756 KB Output is correct
3 Correct 20 ms 27756 KB Output is correct
4 Correct 20 ms 27756 KB Output is correct
5 Correct 21 ms 27756 KB Output is correct
6 Correct 20 ms 27756 KB Output is correct
7 Correct 19 ms 27756 KB Output is correct
8 Correct 20 ms 27756 KB Output is correct
9 Correct 20 ms 27900 KB Output is correct
10 Correct 19 ms 27756 KB Output is correct
11 Correct 19 ms 27756 KB Output is correct
12 Correct 20 ms 27756 KB Output is correct
13 Correct 19 ms 27756 KB Output is correct
14 Correct 20 ms 27776 KB Output is correct
15 Correct 20 ms 27756 KB Output is correct
16 Correct 20 ms 27756 KB Output is correct
17 Correct 21 ms 27884 KB Output is correct
18 Correct 19 ms 27756 KB Output is correct
19 Correct 19 ms 27756 KB Output is correct
20 Correct 20 ms 27756 KB Output is correct
21 Correct 19 ms 27756 KB Output is correct
22 Correct 20 ms 27884 KB Output is correct
23 Correct 20 ms 27756 KB Output is correct
24 Correct 23 ms 27756 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 27756 KB Output is correct
2 Correct 20 ms 27756 KB Output is correct
3 Correct 20 ms 27756 KB Output is correct
4 Correct 20 ms 27756 KB Output is correct
5 Correct 21 ms 27756 KB Output is correct
6 Correct 20 ms 27756 KB Output is correct
7 Correct 19 ms 27756 KB Output is correct
8 Correct 20 ms 27756 KB Output is correct
9 Correct 20 ms 27900 KB Output is correct
10 Correct 19 ms 27756 KB Output is correct
11 Correct 19 ms 27756 KB Output is correct
12 Correct 20 ms 27756 KB Output is correct
13 Correct 19 ms 27756 KB Output is correct
14 Correct 20 ms 27776 KB Output is correct
15 Correct 20 ms 27756 KB Output is correct
16 Correct 20 ms 27756 KB Output is correct
17 Correct 21 ms 27884 KB Output is correct
18 Correct 19 ms 27756 KB Output is correct
19 Correct 19 ms 27756 KB Output is correct
20 Correct 20 ms 27756 KB Output is correct
21 Correct 19 ms 27756 KB Output is correct
22 Correct 20 ms 27884 KB Output is correct
23 Correct 20 ms 27756 KB Output is correct
24 Correct 23 ms 27756 KB Output is correct
25 Correct 22 ms 27756 KB Output is correct
26 Correct 23 ms 28268 KB Output is correct
27 Correct 26 ms 28140 KB Output is correct
28 Correct 22 ms 28396 KB Output is correct
29 Correct 27 ms 28268 KB Output is correct
30 Correct 24 ms 28268 KB Output is correct
31 Correct 23 ms 27756 KB Output is correct
32 Correct 22 ms 28396 KB Output is correct
33 Correct 20 ms 27756 KB Output is correct
34 Correct 22 ms 28268 KB Output is correct
35 Correct 22 ms 28268 KB Output is correct
36 Correct 22 ms 28140 KB Output is correct
37 Correct 22 ms 28268 KB Output is correct
38 Correct 23 ms 27756 KB Output is correct
39 Correct 26 ms 28268 KB Output is correct
40 Correct 22 ms 28268 KB Output is correct
41 Correct 22 ms 28140 KB Output is correct
42 Correct 22 ms 28268 KB Output is correct
43 Correct 26 ms 28396 KB Output is correct
44 Correct 20 ms 27756 KB Output is correct
45 Correct 26 ms 28396 KB Output is correct
46 Correct 22 ms 28268 KB Output is correct
47 Correct 20 ms 27756 KB Output is correct
48 Correct 22 ms 28140 KB Output is correct
49 Correct 26 ms 28268 KB Output is correct
50 Correct 22 ms 28524 KB Output is correct
51 Correct 22 ms 28140 KB Output is correct
52 Correct 22 ms 28268 KB Output is correct
53 Correct 22 ms 28268 KB Output is correct
54 Correct 22 ms 28140 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 27756 KB Output is correct
2 Correct 20 ms 27756 KB Output is correct
3 Correct 20 ms 27756 KB Output is correct
4 Correct 20 ms 27756 KB Output is correct
5 Correct 21 ms 27756 KB Output is correct
6 Correct 20 ms 27756 KB Output is correct
7 Correct 19 ms 27756 KB Output is correct
8 Correct 20 ms 27756 KB Output is correct
9 Correct 20 ms 27900 KB Output is correct
10 Correct 19 ms 27756 KB Output is correct
11 Correct 19 ms 27756 KB Output is correct
12 Correct 20 ms 27756 KB Output is correct
13 Correct 19 ms 27756 KB Output is correct
14 Correct 20 ms 27776 KB Output is correct
15 Correct 20 ms 27756 KB Output is correct
16 Correct 20 ms 27756 KB Output is correct
17 Correct 21 ms 27884 KB Output is correct
18 Correct 19 ms 27756 KB Output is correct
19 Correct 19 ms 27756 KB Output is correct
20 Correct 20 ms 27756 KB Output is correct
21 Correct 19 ms 27756 KB Output is correct
22 Correct 20 ms 27884 KB Output is correct
23 Correct 20 ms 27756 KB Output is correct
24 Correct 23 ms 27756 KB Output is correct
25 Correct 20 ms 27756 KB Output is correct
26 Correct 122 ms 44900 KB Output is correct
27 Correct 167 ms 41580 KB Output is correct
28 Correct 23 ms 28140 KB Output is correct
29 Correct 20 ms 27756 KB Output is correct
30 Correct 20 ms 27756 KB Output is correct
31 Correct 153 ms 41580 KB Output is correct
32 Correct 22 ms 28268 KB Output is correct
33 Correct 222 ms 47340 KB Output is correct
34 Correct 155 ms 41580 KB Output is correct
35 Correct 22 ms 28140 KB Output is correct
36 Correct 203 ms 42092 KB Output is correct
37 Correct 22 ms 28140 KB Output is correct
38 Correct 22 ms 28140 KB Output is correct
39 Correct 118 ms 42852 KB Output is correct
40 Correct 22 ms 28396 KB Output is correct
41 Correct 163 ms 41572 KB Output is correct
42 Correct 218 ms 43380 KB Output is correct
43 Correct 20 ms 27756 KB Output is correct
44 Correct 204 ms 47460 KB Output is correct
45 Correct 232 ms 44652 KB Output is correct
46 Correct 21 ms 28268 KB Output is correct
47 Correct 22 ms 28140 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 44900 KB Output is correct
2 Correct 126 ms 45664 KB Output is correct
3 Correct 22 ms 28268 KB Output is correct
4 Correct 22 ms 28140 KB Output is correct
5 Correct 25 ms 27756 KB Output is correct
6 Correct 20 ms 27756 KB Output is correct
7 Correct 26 ms 28288 KB Output is correct
8 Correct 187 ms 43116 KB Output is correct
9 Correct 22 ms 28140 KB Output is correct
10 Correct 166 ms 41836 KB Output is correct
11 Correct 20 ms 27756 KB Output is correct
12 Correct 188 ms 41708 KB Output is correct
13 Correct 184 ms 43248 KB Output is correct
14 Correct 164 ms 45412 KB Output is correct
15 Correct 133 ms 42980 KB Output is correct
16 Correct 22 ms 28416 KB Output is correct
17 Correct 19 ms 27756 KB Output is correct
18 Correct 139 ms 45532 KB Output is correct
19 Correct 216 ms 48572 KB Output is correct
20 Correct 22 ms 28268 KB Output is correct
21 Correct 20 ms 27904 KB Output is correct
22 Correct 149 ms 46052 KB Output is correct
23 Correct 22 ms 28268 KB Output is correct
24 Correct 169 ms 42220 KB Output is correct
25 Correct 210 ms 47456 KB Output is correct
26 Correct 22 ms 28268 KB Output is correct
27 Correct 22 ms 28396 KB Output is correct
28 Correct 22 ms 28140 KB Output is correct
29 Correct 22 ms 28268 KB Output is correct
30 Correct 22 ms 28268 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 27756 KB Output is correct
2 Correct 20 ms 27756 KB Output is correct
3 Correct 20 ms 27756 KB Output is correct
4 Correct 20 ms 27756 KB Output is correct
5 Correct 21 ms 27756 KB Output is correct
6 Correct 20 ms 27756 KB Output is correct
7 Correct 19 ms 27756 KB Output is correct
8 Correct 20 ms 27756 KB Output is correct
9 Correct 20 ms 27900 KB Output is correct
10 Correct 19 ms 27756 KB Output is correct
11 Correct 19 ms 27756 KB Output is correct
12 Correct 20 ms 27756 KB Output is correct
13 Correct 19 ms 27756 KB Output is correct
14 Correct 20 ms 27776 KB Output is correct
15 Correct 20 ms 27756 KB Output is correct
16 Correct 20 ms 27756 KB Output is correct
17 Correct 21 ms 27884 KB Output is correct
18 Correct 19 ms 27756 KB Output is correct
19 Correct 19 ms 27756 KB Output is correct
20 Correct 20 ms 27756 KB Output is correct
21 Correct 19 ms 27756 KB Output is correct
22 Correct 20 ms 27884 KB Output is correct
23 Correct 20 ms 27756 KB Output is correct
24 Correct 23 ms 27756 KB Output is correct
25 Correct 22 ms 27756 KB Output is correct
26 Correct 23 ms 28268 KB Output is correct
27 Correct 26 ms 28140 KB Output is correct
28 Correct 22 ms 28396 KB Output is correct
29 Correct 27 ms 28268 KB Output is correct
30 Correct 24 ms 28268 KB Output is correct
31 Correct 23 ms 27756 KB Output is correct
32 Correct 22 ms 28396 KB Output is correct
33 Correct 20 ms 27756 KB Output is correct
34 Correct 22 ms 28268 KB Output is correct
35 Correct 22 ms 28268 KB Output is correct
36 Correct 22 ms 28140 KB Output is correct
37 Correct 22 ms 28268 KB Output is correct
38 Correct 23 ms 27756 KB Output is correct
39 Correct 26 ms 28268 KB Output is correct
40 Correct 22 ms 28268 KB Output is correct
41 Correct 22 ms 28140 KB Output is correct
42 Correct 22 ms 28268 KB Output is correct
43 Correct 26 ms 28396 KB Output is correct
44 Correct 20 ms 27756 KB Output is correct
45 Correct 26 ms 28396 KB Output is correct
46 Correct 22 ms 28268 KB Output is correct
47 Correct 20 ms 27756 KB Output is correct
48 Correct 22 ms 28140 KB Output is correct
49 Correct 26 ms 28268 KB Output is correct
50 Correct 22 ms 28524 KB Output is correct
51 Correct 22 ms 28140 KB Output is correct
52 Correct 22 ms 28268 KB Output is correct
53 Correct 22 ms 28268 KB Output is correct
54 Correct 22 ms 28140 KB Output is correct
55 Correct 20 ms 27756 KB Output is correct
56 Correct 122 ms 44900 KB Output is correct
57 Correct 167 ms 41580 KB Output is correct
58 Correct 23 ms 28140 KB Output is correct
59 Correct 20 ms 27756 KB Output is correct
60 Correct 20 ms 27756 KB Output is correct
61 Correct 153 ms 41580 KB Output is correct
62 Correct 22 ms 28268 KB Output is correct
63 Correct 222 ms 47340 KB Output is correct
64 Correct 155 ms 41580 KB Output is correct
65 Correct 22 ms 28140 KB Output is correct
66 Correct 203 ms 42092 KB Output is correct
67 Correct 22 ms 28140 KB Output is correct
68 Correct 22 ms 28140 KB Output is correct
69 Correct 118 ms 42852 KB Output is correct
70 Correct 22 ms 28396 KB Output is correct
71 Correct 163 ms 41572 KB Output is correct
72 Correct 218 ms 43380 KB Output is correct
73 Correct 20 ms 27756 KB Output is correct
74 Correct 204 ms 47460 KB Output is correct
75 Correct 232 ms 44652 KB Output is correct
76 Correct 21 ms 28268 KB Output is correct
77 Correct 22 ms 28140 KB Output is correct
78 Correct 120 ms 44900 KB Output is correct
79 Correct 126 ms 45664 KB Output is correct
80 Correct 22 ms 28268 KB Output is correct
81 Correct 22 ms 28140 KB Output is correct
82 Correct 25 ms 27756 KB Output is correct
83 Correct 20 ms 27756 KB Output is correct
84 Correct 26 ms 28288 KB Output is correct
85 Correct 187 ms 43116 KB Output is correct
86 Correct 22 ms 28140 KB Output is correct
87 Correct 166 ms 41836 KB Output is correct
88 Correct 20 ms 27756 KB Output is correct
89 Correct 188 ms 41708 KB Output is correct
90 Correct 184 ms 43248 KB Output is correct
91 Correct 164 ms 45412 KB Output is correct
92 Correct 133 ms 42980 KB Output is correct
93 Correct 22 ms 28416 KB Output is correct
94 Correct 19 ms 27756 KB Output is correct
95 Correct 139 ms 45532 KB Output is correct
96 Correct 216 ms 48572 KB Output is correct
97 Correct 22 ms 28268 KB Output is correct
98 Correct 20 ms 27904 KB Output is correct
99 Correct 149 ms 46052 KB Output is correct
100 Correct 22 ms 28268 KB Output is correct
101 Correct 169 ms 42220 KB Output is correct
102 Correct 210 ms 47456 KB Output is correct
103 Correct 22 ms 28268 KB Output is correct
104 Correct 22 ms 28396 KB Output is correct
105 Correct 22 ms 28140 KB Output is correct
106 Correct 22 ms 28268 KB Output is correct
107 Correct 22 ms 28268 KB Output is correct
108 Correct 756 ms 109020 KB Output is correct
109 Correct 1321 ms 108076 KB Output is correct
110 Correct 1326 ms 117104 KB Output is correct
111 Correct 1421 ms 129500 KB Output is correct
112 Correct 1339 ms 121736 KB Output is correct
113 Correct 787 ms 111416 KB Output is correct
114 Correct 954 ms 93908 KB Output is correct
115 Correct 934 ms 93888 KB Output is correct
116 Correct 1081 ms 96364 KB Output is correct
117 Correct 1054 ms 111332 KB Output is correct
118 Correct 905 ms 93676 KB Output is correct
119 Correct 1025 ms 111200 KB Output is correct
120 Correct 1350 ms 122280 KB Output is correct
121 Correct 1035 ms 111280 KB Output is correct
122 Correct 1171 ms 102244 KB Output is correct
123 Correct 804 ms 112552 KB Output is correct
124 Correct 1212 ms 109792 KB Output is correct