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 | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | DNR | 133 |
| 8 | Dominater069 | 131 |
| 9 | Proof_by_QED | 130 |
| 10 | BledDest | 129 |
| 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