2143C - Max Tree It is useful, and actually very easy to implement.
I tried to solve it with DFS, but not very obviously,that's not gonna work.
Spoiler
2143C - Max Tree It is useful, and actually very easy to implement.
I tried to solve it with DFS, but not very obviously,that's not gonna work.
queue = deque()
for i in range(V):
if in_edge[i] == 0:
queue.append(i)
while queue:
process = queue.popleft()
results[process] = cur
cur -= 1
for v in edges[process]:
in_edge[v] -= 1
if in_edge[v] == 0:
queue.append(v)
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
| Name |
|---|



Here is the USACO guide page for topological sort
Please just look up what you are trying to learn instead of posting blogs like this