Bessie wants to make a course from nearby farms. A farm is a subset of two or more meadows within which every meadow can reach every other meadow along a unique sequence of roads.
The nearby farmland may contain multiple farms. Suppose there are K farms. Bessie would like to make a goat kart loop by connecting all K farms by adding K roads of length X. Each farm should be visited exactly once and at least one road must be traversed inside each farm.
To make the course interesting for racers, the total length of the track should be at least Y. Bessie wants to know the sum, over all such interesting tracks, of the total track lengths. A track is different from another if there are two meadows which are adjacent (after adding the roads between farms) in one track but not the other. Please note that only the roads chosen matter, and not the direction the goat karts will travel along those roads.
5 3 1 12 1 2 3 2 3 4 4 5 6
54
This example has 6 possible tracks
1 --> 2 --> 4 --> 5 --> 1 (length 11)
1 --> 2 --> 5 --> 4 --> 1 (length 11)
2 --> 3 --> 4 --> 5 --> 2 (length 12)
2 --> 3 --> 5 --> 4 --> 2 (length 12)
1 --> 2 --> 3 --> 4 --> 5 --> 1 (length 15)
1 --> 2 --> 3 --> 5 --> 4 --> 1 (length 15)
The answer is 12+12+15+15=54, adding up only the tracks where the length is at least 12.
Note that for this problem, the standard time limit is increased to 3 seconds per test case (6 seconds per case for Java and Python).
5 3 1 12
1 2 3
2 3 4
4 5 654