CF1325C Ehab and Path-etic MEXs
Description
You are given a tree consisting of $ n $ nodes. You want to write some labels on the tree's edges such that the following conditions hold:
- Every label is an integer between $ 0 $ and $ n-2 $ inclusive.
- All the written labels are distinct.
- The largest value among $ MEX(u,v) $ over all pairs of nodes $ (u,v) $ is as small as possible.
Here, $ MEX(u,v) $ denotes the smallest non-negative integer that isn't written on any edge on the unique simple path from node $ u $ to node $ v $ .
Input Format
N/A
Output Format
N/A
Explanation/Hint
The tree from the second sample:
