-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB902.cpp
More file actions
87 lines (74 loc) · 1.2 KB
/
Copy pathB902.cpp
File metadata and controls
87 lines (74 loc) · 1.2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pb push_back
using namespace std;
map<int, vector<int>> children;
map<int, int> color;
map<int, int> curColor;
int moves = 0;
void colorTree(int node, int col)
{
curColor[node] = col;
vector<int> frontier = {node};
while(!frontier.empty())
{
vector<int> next = {};
for( int u : frontier)
{
for(int v : children[u])
{
curColor[v] = col;
if(color[v] != col)
{
continue;
}
next.pb(v);
}
}
frontier = next;
}
moves++;
return;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n; cin >> n;
for(int i = 2; i < n+1; i++)
{
int t; cin >>t; //t--;
children[t].pb(i);
}
for(int i = 1; i< n+1; i++)
{
int t; cin >> t;
color[i] = t;
curColor[i] = 0;
}
vector<int> frontier = {1};
if(curColor[1] != color[1])
{
colorTree(1, color[1]);
}
frontier = {1};
while(!frontier.empty())
{
vector<int> next = {};
for( int u : frontier)
{
for(int v : children[u])
{
if(curColor[v] != color[v])
{
colorTree(v, color[v]);
}
next.pb(v);
}
}
frontier = next;
}
cout << moves << '\n';
return 0;
}