JavaSolution-HackerRank/Advanced/Java Visitor Pattern/Solution.java at master · snehalmastud/JavaSolution-HackerRank · GitHub

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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136

classSumInLeavesVisitorextendsTreeVis {
privateintresult = 0;

publicintgetResult() {
returnresult;
 }

publicvoidvisitNode(TreeNodenode) {
// do nothing
 }

publicvoidvisitLeaf(TreeLeafleaf) {
result += leaf.getValue();
 }
}

classProductOfRedNodesVisitorextendsTreeVis {
privatelongresult = 1;
privatefinalintM = 1000000007;

publicintgetResult() {
return (int) result;
 }

publicvoidvisitNode(TreeNodenode) {
if (node.getColor() == Color.RED) {
result = (result * node.getValue()) % M;
 }
 }

publicvoidvisitLeaf(TreeLeafleaf) {
if (leaf.getColor() == Color.RED) {
result = (result * leaf.getValue()) % M;
 }
 }
}

classFancyVisitorextendsTreeVis {
privateintnonLeafEvenDepthSum = 0;
privateintgreenLeavesSum = 0;

publicintgetResult() {
returnMath.abs(nonLeafEvenDepthSum - greenLeavesSum);
 }

publicvoidvisitNode(TreeNodenode) {
if (node.getDepth() % 2 == 0) {
nonLeafEvenDepthSum += node.getValue();
 }
 }

publicvoidvisitLeaf(TreeLeafleaf) {
if (leaf.getColor() == Color.GREEN) {
greenLeavesSum += leaf.getValue();
 }
 }
}

publicclassSolution {
privatestaticint [] values;
privatestaticColor [] colors;
privatestaticHashMap<Integer, HashSet<Integer>> map;

publicstaticTreesolve() {
Scannerscan = newScanner(System.in);
intnumNodes = scan.nextInt();

/* Save nodes and colors */
values = newint[numNodes];
colors = newColor[numNodes];
map = newHashMap(numNodes);
for (inti = 0; i < numNodes; i++) {
values[i] = scan.nextInt();
 }
for (inti = 0; i < numNodes; i++) {
colors[i] = scan.nextInt() == 0 ? Color.RED : Color.GREEN;
 }

/* Save edges */
for (inti = 0; i < numNodes - 1; i++) {
intu = scan.nextInt();
intv = scan.nextInt();

/* Edges are undirected: Add 1st direction */
HashSet<Integer> uNeighbors = map.get(u);
if (uNeighbors == null) {
uNeighbors = newHashSet();
map.put(u, uNeighbors);
 }
uNeighbors.add(v);

/* Edges are undirected: Add 2nd direction */
HashSet<Integer> vNeighbors = map.get(v);
if (vNeighbors == null) {
vNeighbors = newHashSet();
map.put(v, vNeighbors);
 }
vNeighbors.add(u);
 }
scan.close();

/* Handle 1-node tree */
if (numNodes == 1) {
returnnewTreeLeaf(values[0], colors[0], 0);
 }

/* Create Tree */
TreeNoderoot = newTreeNode(values[0], colors[0], 0);
addChildren(root, 1);
returnroot;
 }

/* Recursively adds children of a TreeNode */
privatestaticvoidaddChildren(TreeNodeparent, IntegerparentNum) {
/* Get HashSet of children and loop through them */
for (IntegertreeNum : map.get(parentNum)) {
map.get(treeNum).remove(parentNum); // removes the opposite arrow direction

/* Add child */
HashSet<Integer> grandChildren = map.get(treeNum);
booleanchildHasChild = (grandChildren != null && !grandChildren.isEmpty());
Treetree;
if (childHasChild) {
tree = newTreeNode(values[treeNum - 1], colors[treeNum - 1], parent.getDepth() + 1);
 } else {
tree = newTreeLeaf(values[treeNum - 1], colors[treeNum - 1], parent.getDepth() + 1);
 }
parent.addChild(tree);

/* Recurse if necessary */
if (treeinstanceofTreeNode) {
addChildren((TreeNode) tree, treeNum);
 }
 }
 }
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136

classSumInLeavesVisitorextendsTreeVis {
privateintresult = 0;

publicintgetResult() {
returnresult;
 }

publicvoidvisitNode(TreeNodenode) {
// do nothing
 }

publicvoidvisitLeaf(TreeLeafleaf) {
result += leaf.getValue();
 }
}

classProductOfRedNodesVisitorextendsTreeVis {
privatelongresult = 1;
privatefinalintM = 1000000007;

publicintgetResult() {
return (int) result;
 }

publicvoidvisitNode(TreeNodenode) {
if (node.getColor() == Color.RED) {
result = (result * node.getValue()) % M;
 }
 }

publicvoidvisitLeaf(TreeLeafleaf) {
if (leaf.getColor() == Color.RED) {
result = (result * leaf.getValue()) % M;
 }
 }
}

classFancyVisitorextendsTreeVis {
privateintnonLeafEvenDepthSum = 0;
privateintgreenLeavesSum = 0;

publicintgetResult() {
returnMath.abs(nonLeafEvenDepthSum - greenLeavesSum);
 }

publicvoidvisitNode(TreeNodenode) {
if (node.getDepth() % 2 == 0) {
nonLeafEvenDepthSum += node.getValue();
 }
 }

publicvoidvisitLeaf(TreeLeafleaf) {
if (leaf.getColor() == Color.GREEN) {
greenLeavesSum += leaf.getValue();
 }
 }
}

publicclassSolution {
privatestaticint [] values;
privatestaticColor [] colors;
privatestaticHashMap<Integer, HashSet<Integer>> map;

publicstaticTreesolve() {
Scannerscan = newScanner(System.in);
intnumNodes = scan.nextInt();

/* Save nodes and colors */
values = newint[numNodes];
colors = newColor[numNodes];
map = newHashMap(numNodes);
for (inti = 0; i < numNodes; i++) {
values[i] = scan.nextInt();
 }
for (inti = 0; i < numNodes; i++) {
colors[i] = scan.nextInt() == 0 ? Color.RED : Color.GREEN;
 }

/* Save edges */
for (inti = 0; i < numNodes - 1; i++) {
intu = scan.nextInt();
intv = scan.nextInt();

/* Edges are undirected: Add 1st direction */
HashSet<Integer> uNeighbors = map.get(u);
if (uNeighbors == null) {
uNeighbors = newHashSet();
map.put(u, uNeighbors);
 }
uNeighbors.add(v);

/* Edges are undirected: Add 2nd direction */
HashSet<Integer> vNeighbors = map.get(v);
if (vNeighbors == null) {
vNeighbors = newHashSet();
map.put(v, vNeighbors);
 }
vNeighbors.add(u);
 }
scan.close();

/* Handle 1-node tree */
if (numNodes == 1) {
returnnewTreeLeaf(values[0], colors[0], 0);
 }

/* Create Tree */
TreeNoderoot = newTreeNode(values[0], colors[0], 0);
addChildren(root, 1);
returnroot;
 }

/* Recursively adds children of a TreeNode */
privatestaticvoidaddChildren(TreeNodeparent, IntegerparentNum) {
/* Get HashSet of children and loop through them */
for (IntegertreeNum : map.get(parentNum)) {
map.get(treeNum).remove(parentNum); // removes the opposite arrow direction

/* Add child */
HashSet<Integer> grandChildren = map.get(treeNum);
booleanchildHasChild = (grandChildren != null && !grandChildren.isEmpty());
Treetree;
if (childHasChild) {
tree = newTreeNode(values[treeNum - 1], colors[treeNum - 1], parent.getDepth() + 1);
 } else {
tree = newTreeLeaf(values[treeNum - 1], colors[treeNum - 1], parent.getDepth() + 1);
 }
parent.addChild(tree);

/* Recurse if necessary */
if (treeinstanceofTreeNode) {
addChildren((TreeNode) tree, treeNum);
 }
 }
 }
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136

classSumInLeavesVisitorextendsTreeVis {
privateintresult = 0;

publicintgetResult() {
returnresult;
 }

publicvoidvisitNode(TreeNodenode) {
// do nothing
 }

publicvoidvisitLeaf(TreeLeafleaf) {
result += leaf.getValue();
 }
}

classProductOfRedNodesVisitorextendsTreeVis {
privatelongresult = 1;
privatefinalintM = 1000000007;

publicintgetResult() {
return (int) result;
 }

publicvoidvisitNode(TreeNodenode) {
if (node.getColor() == Color.RED) {
result = (result * node.getValue()) % M;
 }
 }

publicvoidvisitLeaf(TreeLeafleaf) {
if (leaf.getColor() == Color.RED) {
result = (result * leaf.getValue()) % M;
 }
 }
}

classFancyVisitorextendsTreeVis {
privateintnonLeafEvenDepthSum = 0;
privateintgreenLeavesSum = 0;

publicintgetResult() {
returnMath.abs(nonLeafEvenDepthSum - greenLeavesSum);
 }

publicvoidvisitNode(TreeNodenode) {
if (node.getDepth() % 2 == 0) {
nonLeafEvenDepthSum += node.getValue();
 }
 }

publicvoidvisitLeaf(TreeLeafleaf) {
if (leaf.getColor() == Color.GREEN) {
greenLeavesSum += leaf.getValue();
 }
 }
}

publicclassSolution {
privatestaticint [] values;
privatestaticColor [] colors;
privatestaticHashMap<Integer, HashSet<Integer>> map;

publicstaticTreesolve() {
Scannerscan = newScanner(System.in);
intnumNodes = scan.nextInt();

/* Save nodes and colors */
values = newint[numNodes];
colors = newColor[numNodes];
map = newHashMap(numNodes);
for (inti = 0; i < numNodes; i++) {
values[i] = scan.nextInt();
 }
for (inti = 0; i < numNodes; i++) {
colors[i] = scan.nextInt() == 0 ? Color.RED : Color.GREEN;
 }

/* Save edges */
for (inti = 0; i < numNodes - 1; i++) {
intu = scan.nextInt();
intv = scan.nextInt();

/* Edges are undirected: Add 1st direction */
HashSet<Integer> uNeighbors = map.get(u);
if (uNeighbors == null) {
uNeighbors = newHashSet();
map.put(u, uNeighbors);
 }
uNeighbors.add(v);

/* Edges are undirected: Add 2nd direction */
HashSet<Integer> vNeighbors = map.get(v);
if (vNeighbors == null) {
vNeighbors = newHashSet();
map.put(v, vNeighbors);
 }
vNeighbors.add(u);
 }
scan.close();

/* Handle 1-node tree */
if (numNodes == 1) {
returnnewTreeLeaf(values[0], colors[0], 0);
 }

/* Create Tree */
TreeNoderoot = newTreeNode(values[0], colors[0], 0);
addChildren(root, 1);
returnroot;
 }

/* Recursively adds children of a TreeNode */
privatestaticvoidaddChildren(TreeNodeparent, IntegerparentNum) {
/* Get HashSet of children and loop through them */
for (IntegertreeNum : map.get(parentNum)) {
map.get(treeNum).remove(parentNum); // removes the opposite arrow direction

/* Add child */
HashSet<Integer> grandChildren = map.get(treeNum);
booleanchildHasChild = (grandChildren != null && !grandChildren.isEmpty());
Treetree;
if (childHasChild) {
tree = newTreeNode(values[treeNum - 1], colors[treeNum - 1], parent.getDepth() + 1);
 } else {
tree = newTreeLeaf(values[treeNum - 1], colors[treeNum - 1], parent.getDepth() + 1);
 }
parent.addChild(tree);

/* Recurse if necessary */
if (treeinstanceofTreeNode) {
addChildren((TreeNode) tree, treeNum);
 }
 }
 }
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136

classSumInLeavesVisitorextendsTreeVis {
privateintresult = 0;

publicintgetResult() {
returnresult;
 }

publicvoidvisitNode(TreeNodenode) {
// do nothing
 }

publicvoidvisitLeaf(TreeLeafleaf) {
result += leaf.getValue();
 }
}

classProductOfRedNodesVisitorextendsTreeVis {
privatelongresult = 1;
privatefinalintM = 1000000007;

publicintgetResult() {
return (int) result;
 }

publicvoidvisitNode(TreeNodenode) {
if (node.getColor() == Color.RED) {
result = (result * node.getValue()) % M;
 }
 }

publicvoidvisitLeaf(TreeLeafleaf) {
if (leaf.getColor() == Color.RED) {
result = (result * leaf.getValue()) % M;
 }
 }
}

classFancyVisitorextendsTreeVis {
privateintnonLeafEvenDepthSum = 0;
privateintgreenLeavesSum = 0;

publicintgetResult() {
returnMath.abs(nonLeafEvenDepthSum - greenLeavesSum);
 }

publicvoidvisitNode(TreeNodenode) {
if (node.getDepth() % 2 == 0) {
nonLeafEvenDepthSum += node.getValue();
 }
 }

publicvoidvisitLeaf(TreeLeafleaf) {
if (leaf.getColor() == Color.GREEN) {
greenLeavesSum += leaf.getValue();
 }
 }
}

publicclassSolution {
privatestaticint [] values;
privatestaticColor [] colors;
privatestaticHashMap<Integer, HashSet<Integer>> map;

publicstaticTreesolve() {
Scannerscan = newScanner(System.in);
intnumNodes = scan.nextInt();

/* Save nodes and colors */
values = newint[numNodes];
colors = newColor[numNodes];
map = newHashMap(numNodes);
for (inti = 0; i < numNodes; i++) {
values[i] = scan.nextInt();
 }
for (inti = 0; i < numNodes; i++) {
colors[i] = scan.nextInt() == 0 ? Color.RED : Color.GREEN;
 }

/* Save edges */
for (inti = 0; i < numNodes - 1; i++) {
intu = scan.nextInt();
intv = scan.nextInt();

/* Edges are undirected: Add 1st direction */
HashSet<Integer> uNeighbors = map.get(u);
if (uNeighbors == null) {
uNeighbors = newHashSet();
map.put(u, uNeighbors);
 }
uNeighbors.add(v);

/* Edges are undirected: Add 2nd direction */
HashSet<Integer> vNeighbors = map.get(v);
if (vNeighbors == null) {
vNeighbors = newHashSet();
map.put(v, vNeighbors);
 }
vNeighbors.add(u);
 }
scan.close();

/* Handle 1-node tree */
if (numNodes == 1) {
returnnewTreeLeaf(values[0], colors[0], 0);
 }

/* Create Tree */
TreeNoderoot = newTreeNode(values[0], colors[0], 0);
addChildren(root, 1);
returnroot;
 }

/* Recursively adds children of a TreeNode */
privatestaticvoidaddChildren(TreeNodeparent, IntegerparentNum) {
/* Get HashSet of children and loop through them */
for (IntegertreeNum : map.get(parentNum)) {
map.get(treeNum).remove(parentNum); // removes the opposite arrow direction

/* Add child */
HashSet<Integer> grandChildren = map.get(treeNum);
booleanchildHasChild = (grandChildren != null && !grandChildren.isEmpty());
Treetree;
if (childHasChild) {
tree = newTreeNode(values[treeNum - 1], colors[treeNum - 1], parent.getDepth() + 1);
 } else {
tree = newTreeLeaf(values[treeNum - 1], colors[treeNum - 1], parent.getDepth() + 1);
 }
parent.addChild(tree);

/* Recurse if necessary */
if (treeinstanceofTreeNode) {
addChildren((TreeNode) tree, treeNum);
 }
 }
 }
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136

classSumInLeavesVisitorextendsTreeVis {
privateintresult = 0;

publicintgetResult() {
returnresult;
 }

publicvoidvisitNode(TreeNodenode) {
// do nothing
 }

publicvoidvisitLeaf(TreeLeafleaf) {
result += leaf.getValue();
 }
}

classProductOfRedNodesVisitorextendsTreeVis {
privatelongresult = 1;
privatefinalintM = 1000000007;

publicintgetResult() {
return (int) result;
 }

publicvoidvisitNode(TreeNodenode) {
if (node.getColor() == Color.RED) {
result = (result * node.getValue()) % M;
 }
 }

publicvoidvisitLeaf(TreeLeafleaf) {
if (leaf.getColor() == Color.RED) {
result = (result * leaf.getValue()) % M;
 }
 }
}

classFancyVisitorextendsTreeVis {
privateintnonLeafEvenDepthSum = 0;
privateintgreenLeavesSum = 0;

publicintgetResult() {
returnMath.abs(nonLeafEvenDepthSum - greenLeavesSum);
 }

publicvoidvisitNode(TreeNodenode) {
if (node.getDepth() % 2 == 0) {
nonLeafEvenDepthSum += node.getValue();
 }
 }

publicvoidvisitLeaf(TreeLeafleaf) {
if (leaf.getColor() == Color.GREEN) {
greenLeavesSum += leaf.getValue();
 }
 }
}

publicclassSolution {
privatestaticint [] values;
privatestaticColor [] colors;
privatestaticHashMap<Integer, HashSet<Integer>> map;

publicstaticTreesolve() {
Scannerscan = newScanner(System.in);
intnumNodes = scan.nextInt();

/* Save nodes and colors */
values = newint[numNodes];
colors = newColor[numNodes];
map = newHashMap(numNodes);
for (inti = 0; i < numNodes; i++) {
values[i] = scan.nextInt();
 }
for (inti = 0; i < numNodes; i++) {
colors[i] = scan.nextInt() == 0 ? Color.RED : Color.GREEN;
 }

/* Save edges */
for (inti = 0; i < numNodes - 1; i++) {
intu = scan.nextInt();
intv = scan.nextInt();

/* Edges are undirected: Add 1st direction */
HashSet<Integer> uNeighbors = map.get(u);
if (uNeighbors == null) {
uNeighbors = newHashSet();
map.put(u, uNeighbors);
 }
uNeighbors.add(v);

/* Edges are undirected: Add 2nd direction */
HashSet<Integer> vNeighbors = map.get(v);
if (vNeighbors == null) {
vNeighbors = newHashSet();
map.put(v, vNeighbors);
 }
vNeighbors.add(u);
 }
scan.close();

/* Handle 1-node tree */
if (numNodes == 1) {
returnnewTreeLeaf(values[0], colors[0], 0);
 }

/* Create Tree */
TreeNoderoot = newTreeNode(values[0], colors[0], 0);
addChildren(root, 1);
returnroot;
 }

/* Recursively adds children of a TreeNode */
privatestaticvoidaddChildren(TreeNodeparent, IntegerparentNum) {
/* Get HashSet of children and loop through them */
for (IntegertreeNum : map.get(parentNum)) {
map.get(treeNum).remove(parentNum); // removes the opposite arrow direction

/* Add child */
HashSet<Integer> grandChildren = map.get(treeNum);
booleanchildHasChild = (grandChildren != null && !grandChildren.isEmpty());
Treetree;
if (childHasChild) {
tree = newTreeNode(values[treeNum - 1], colors[treeNum - 1], parent.getDepth() + 1);
 } else {
tree = newTreeLeaf(values[treeNum - 1], colors[treeNum - 1], parent.getDepth() + 1);
 }
parent.addChild(tree);

/* Recurse if necessary */
if (treeinstanceofTreeNode) {
addChildren((TreeNode) tree, treeNum);
 }
 }
 }
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136

classSumInLeavesVisitorextendsTreeVis {
privateintresult = 0;

publicintgetResult() {
returnresult;
 }

publicvoidvisitNode(TreeNodenode) {
// do nothing
 }

publicvoidvisitLeaf(TreeLeafleaf) {
result += leaf.getValue();
 }
}

classProductOfRedNodesVisitorextendsTreeVis {
privatelongresult = 1;
privatefinalintM = 1000000007;

publicintgetResult() {
return (int) result;
 }

publicvoidvisitNode(TreeNodenode) {
if (node.getColor() == Color.RED) {
result = (result * node.getValue()) % M;
 }
 }

publicvoidvisitLeaf(TreeLeafleaf) {
if (leaf.getColor() == Color.RED) {
result = (result * leaf.getValue()) % M;
 }
 }
}

classFancyVisitorextendsTreeVis {
privateintnonLeafEvenDepthSum = 0;
privateintgreenLeavesSum = 0;

publicintgetResult() {
returnMath.abs(nonLeafEvenDepthSum - greenLeavesSum);
 }

publicvoidvisitNode(TreeNodenode) {
if (node.getDepth() % 2 == 0) {
nonLeafEvenDepthSum += node.getValue();
 }
 }

publicvoidvisitLeaf(TreeLeafleaf) {
if (leaf.getColor() == Color.GREEN) {
greenLeavesSum += leaf.getValue();
 }
 }
}

publicclassSolution {
privatestaticint [] values;
privatestaticColor [] colors;
privatestaticHashMap<Integer, HashSet<Integer>> map;

publicstaticTreesolve() {
Scannerscan = newScanner(System.in);
intnumNodes = scan.nextInt();

/* Save nodes and colors */
values = newint[numNodes];
colors = newColor[numNodes];
map = newHashMap(numNodes);
for (inti = 0; i < numNodes; i++) {
values[i] = scan.nextInt();
 }
for (inti = 0; i < numNodes; i++) {
colors[i] = scan.nextInt() == 0 ? Color.RED : Color.GREEN;
 }

/* Save edges */
for (inti = 0; i < numNodes - 1; i++) {
intu = scan.nextInt();
intv = scan.nextInt();

/* Edges are undirected: Add 1st direction */
HashSet<Integer> uNeighbors = map.get(u);
if (uNeighbors == null) {
uNeighbors = newHashSet();
map.put(u, uNeighbors);
 }
uNeighbors.add(v);

/* Edges are undirected: Add 2nd direction */
HashSet<Integer> vNeighbors = map.get(v);
if (vNeighbors == null) {
vNeighbors = newHashSet();
map.put(v, vNeighbors);
 }
vNeighbors.add(u);
 }
scan.close();

/* Handle 1-node tree */
if (numNodes == 1) {
returnnewTreeLeaf(values[0], colors[0], 0);
 }

/* Create Tree */
TreeNoderoot = newTreeNode(values[0], colors[0], 0);
addChildren(root, 1);
returnroot;
 }

/* Recursively adds children of a TreeNode */
privatestaticvoidaddChildren(TreeNodeparent, IntegerparentNum) {
/* Get HashSet of children and loop through them */
for (IntegertreeNum : map.get(parentNum)) {
map.get(treeNum).remove(parentNum); // removes the opposite arrow direction

/* Add child */
HashSet<Integer> grandChildren = map.get(treeNum);
booleanchildHasChild = (grandChildren != null && !grandChildren.isEmpty());
Treetree;
if (childHasChild) {
tree = newTreeNode(values[treeNum - 1], colors[treeNum - 1], parent.getDepth() + 1);
 } else {
tree = newTreeLeaf(values[treeNum - 1], colors[treeNum - 1], parent.getDepth() + 1);
 }
parent.addChild(tree);

/* Recurse if necessary */
if (treeinstanceofTreeNode) {
addChildren((TreeNode) tree, treeNum);
 }
 }
 }
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136

classSumInLeavesVisitorextendsTreeVis {
privateintresult = 0;

publicintgetResult() {
returnresult;
 }

publicvoidvisitNode(TreeNodenode) {
// do nothing
 }

publicvoidvisitLeaf(TreeLeafleaf) {
result += leaf.getValue();
 }
}

classProductOfRedNodesVisitorextendsTreeVis {
privatelongresult = 1;
privatefinalintM = 1000000007;

publicintgetResult() {
return (int) result;
 }

publicvoidvisitNode(TreeNodenode) {
if (node.getColor() == Color.RED) {
result = (result * node.getValue()) % M;
 }
 }

publicvoidvisitLeaf(TreeLeafleaf) {
if (leaf.getColor() == Color.RED) {
result = (result * leaf.getValue()) % M;
 }
 }
}

classFancyVisitorextendsTreeVis {
privateintnonLeafEvenDepthSum = 0;
privateintgreenLeavesSum = 0;

publicintgetResult() {
returnMath.abs(nonLeafEvenDepthSum - greenLeavesSum);
 }

publicvoidvisitNode(TreeNodenode) {
if (node.getDepth() % 2 == 0) {
nonLeafEvenDepthSum += node.getValue();
 }
 }

publicvoidvisitLeaf(TreeLeafleaf) {
if (leaf.getColor() == Color.GREEN) {
greenLeavesSum += leaf.getValue();
 }
 }
}

publicclassSolution {
privatestaticint [] values;
privatestaticColor [] colors;
privatestaticHashMap<Integer, HashSet<Integer>> map;

publicstaticTreesolve() {
Scannerscan = newScanner(System.in);
intnumNodes = scan.nextInt();

/* Save nodes and colors */
values = newint[numNodes];
colors = newColor[numNodes];
map = newHashMap(numNodes);
for (inti = 0; i < numNodes; i++) {
values[i] = scan.nextInt();
 }
for (inti = 0; i < numNodes; i++) {
colors[i] = scan.nextInt() == 0 ? Color.RED : Color.GREEN;
 }

/* Save edges */
for (inti = 0; i < numNodes - 1; i++) {
intu = scan.nextInt();
intv = scan.nextInt();

/* Edges are undirected: Add 1st direction */
HashSet<Integer> uNeighbors = map.get(u);
if (uNeighbors == null) {
uNeighbors = newHashSet();
map.put(u, uNeighbors);
 }
uNeighbors.add(v);

/* Edges are undirected: Add 2nd direction */
HashSet<Integer> vNeighbors = map.get(v);
if (vNeighbors == null) {
vNeighbors = newHashSet();
map.put(v, vNeighbors);
 }
vNeighbors.add(u);
 }
scan.close();

/* Handle 1-node tree */
if (numNodes == 1) {
returnnewTreeLeaf(values[0], colors[0], 0);
 }

/* Create Tree */
TreeNoderoot = newTreeNode(values[0], colors[0], 0);
addChildren(root, 1);
returnroot;
 }

/* Recursively adds children of a TreeNode */
privatestaticvoidaddChildren(TreeNodeparent, IntegerparentNum) {
/* Get HashSet of children and loop through them */
for (IntegertreeNum : map.get(parentNum)) {
map.get(treeNum).remove(parentNum); // removes the opposite arrow direction

/* Add child */
HashSet<Integer> grandChildren = map.get(treeNum);
booleanchildHasChild = (grandChildren != null && !grandChildren.isEmpty());
Treetree;
if (childHasChild) {
tree = newTreeNode(values[treeNum - 1], colors[treeNum - 1], parent.getDepth() + 1);
 } else {
tree = newTreeLeaf(values[treeNum - 1], colors[treeNum - 1], parent.getDepth() + 1);
 }
parent.addChild(tree);

/* Recurse if necessary */
if (treeinstanceofTreeNode) {
addChildren((TreeNode) tree, treeNum);
 }
 }
 }
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136

classSumInLeavesVisitorextendsTreeVis {
privateintresult = 0;

publicintgetResult() {
returnresult;
 }

publicvoidvisitNode(TreeNodenode) {
// do nothing
 }

publicvoidvisitLeaf(TreeLeafleaf) {
result += leaf.getValue();
 }
}

classProductOfRedNodesVisitorextendsTreeVis {
privatelongresult = 1;
privatefinalintM = 1000000007;

publicintgetResult() {
return (int) result;
 }

publicvoidvisitNode(TreeNodenode) {
if (node.getColor() == Color.RED) {
result = (result * node.getValue()) % M;
 }
 }

publicvoidvisitLeaf(TreeLeafleaf) {
if (leaf.getColor() == Color.RED) {
result = (result * leaf.getValue()) % M;
 }
 }
}

classFancyVisitorextendsTreeVis {
privateintnonLeafEvenDepthSum = 0;
privateintgreenLeavesSum = 0;

publicintgetResult() {
returnMath.abs(nonLeafEvenDepthSum - greenLeavesSum);
 }

publicvoidvisitNode(TreeNodenode) {
if (node.getDepth() % 2 == 0) {
nonLeafEvenDepthSum += node.getValue();
 }
 }

publicvoidvisitLeaf(TreeLeafleaf) {
if (leaf.getColor() == Color.GREEN) {
greenLeavesSum += leaf.getValue();
 }
 }
}

publicclassSolution {
privatestaticint [] values;
privatestaticColor [] colors;
privatestaticHashMap<Integer, HashSet<Integer>> map;

publicstaticTreesolve() {
Scannerscan = newScanner(System.in);
intnumNodes = scan.nextInt();

/* Save nodes and colors */
values = newint[numNodes];
colors = newColor[numNodes];
map = newHashMap(numNodes);
for (inti = 0; i < numNodes; i++) {
values[i] = scan.nextInt();
 }
for (inti = 0; i < numNodes; i++) {
colors[i] = scan.nextInt() == 0 ? Color.RED : Color.GREEN;
 }

/* Save edges */
for (inti = 0; i < numNodes - 1; i++) {
intu = scan.nextInt();
intv = scan.nextInt();

/* Edges are undirected: Add 1st direction */
HashSet<Integer> uNeighbors = map.get(u);
if (uNeighbors == null) {
uNeighbors = newHashSet();
map.put(u, uNeighbors);
 }
uNeighbors.add(v);

/* Edges are undirected: Add 2nd direction */
HashSet<Integer> vNeighbors = map.get(v);
if (vNeighbors == null) {
vNeighbors = newHashSet();
map.put(v, vNeighbors);
 }
vNeighbors.add(u);
 }
scan.close();

/* Handle 1-node tree */
if (numNodes == 1) {
returnnewTreeLeaf(values[0], colors[0], 0);
 }

/* Create Tree */
TreeNoderoot = newTreeNode(values[0], colors[0], 0);
addChildren(root, 1);
returnroot;
 }

/* Recursively adds children of a TreeNode */
privatestaticvoidaddChildren(TreeNodeparent, IntegerparentNum) {
/* Get HashSet of children and loop through them */
for (IntegertreeNum : map.get(parentNum)) {
map.get(treeNum).remove(parentNum); // removes the opposite arrow direction

/* Add child */
HashSet<Integer> grandChildren = map.get(treeNum);
booleanchildHasChild = (grandChildren != null && !grandChildren.isEmpty());
Treetree;
if (childHasChild) {
tree = newTreeNode(values[treeNum - 1], colors[treeNum - 1], parent.getDepth() + 1);
 } else {
tree = newTreeLeaf(values[treeNum - 1], colors[treeNum - 1], parent.getDepth() + 1);
 }
parent.addChild(tree);

/* Recurse if necessary */
if (treeinstanceofTreeNode) {
addChildren((TreeNode) tree, treeNum);
 }
 }
 }