|
| 1 | +class Solution(object): |
| 2 | + def rootCount(self, edges, guesses, k): |
| 3 | + """ |
| 4 | + :type edges: List[List[int]] |
| 5 | + :type guesses: List[List[int]] |
| 6 | + :type k: int |
| 7 | + :rtype: int |
| 8 | + """ |
| 9 | + self.k = k |
| 10 | + g = set(map(tuple,guesses)) |
| 11 | + uag = defaultdict(list) |
| 12 | + for a, b in edges: |
| 13 | + uag[a].append(b) |
| 14 | + uag[b].append(a) |
| 15 | + been = set([0]) |
| 16 | + self.crr = 0 |
| 17 | + def dfs(node): |
| 18 | + for n in uag[node]: |
| 19 | + if n in been: |
| 20 | + continue |
| 21 | + been.add(n) |
| 22 | + self.crr += (node, n) in g |
| 23 | + dfs(n) |
| 24 | + def rev(node): |
| 25 | + for n in uag[node]: |
| 26 | + if n in been: |
| 27 | + continue |
| 28 | + been.add(n) |
| 29 | + self.crr -= (node, n) in g |
| 30 | + self.crr += (n, node) in g |
| 31 | + if self.crr >= self.k: |
| 32 | + self.ans += 1 |
| 33 | + rev(n) |
| 34 | + self.crr -= (n, node) in g |
| 35 | + self.crr += (node, n) in g |
| 36 | + dfs(0) |
| 37 | + been = set([0]) |
| 38 | + self.ans = int(self.crr >= k) |
| 39 | + rev(0) |
| 40 | + return self.ans |
0 commit comments