Preparing NOJ

# Dividing the Kingdom

1000ms 0K

## Description:

The kingdom of Nlogonia has historically been a very wealthy and quiet place. However, the current circumstances could bring this era of peace and prosperity to an end: The king is a father of two twins, so both of them are heirs to the throne.

The twins don't get along well and are jealous and overly competitive towards each other. Due to this, having both of them rule over the kingdom cooperatively is not a viable option. The kingdom will have to be divided into two independent principalities so that each of them can be given to each prince. Also, the division needs to be totally fair to avoid conflict between the envious brothers.

The kingdom consists of $N$ cities and $M$ roads connecting pairs of cities. The Nlogonians are peculiarly proud of their roads. Each road has an associated positive value which represents its beauty.

The kingdom will be divided in this manner: First, the cities will be partitioned in two sets such that every city is in one and only one set. Then, each principality will consist of the cities in one set and the roads connecting cities of this same set. Roads that connect cities of different principalities will be destroyed, as the princes are not interested in trading with each other, and keeping the roads would only make war more likely.

The beauty of a principality is defined as the maximum beauty of the roads within the principality, or $0$ (zero) if the principality has no roads at all. For obvious reasons, the king would like the beauty of both principalities to be the same.

Help the king determine all the possible values of the beauty of the resulting principalities, given that the division is made in such a way that the principalities are equally beautiful.

## Input:

The first line contains two integers $N$, $M$ ($1 \le N,M \le 5 \times 10^5$), representing the number of cities and the number of roads respectively.

Each of the next $M$ lines contains three integers $x_i,y_i,b_i$ ($1 \le x_i < y_i \le N$, $1 \le b_i \le 10^9$), representing that there's a road which connects cities $x_i$ and $y_i$ and has beauty $b_i$. There's no two roads connecting the same pair of cities.

## Output:

If it's not possible to divide the kingdom so that both principalities have the same beauty, output a line with the string "IMPOSSIBLE". Otherwise, output all the possible values for principality beauty resulting from divisions in principalities with equal beauty. Values should be outputted in ascending order, each in its own line.

## Sample Input:

9 7
1 2 3
2 3 3
3 4 3
1 3 2
2 4 2
6 7 1
8 9 1


## Sample Output:

2
3


## Sample Input:

4 4
1 2 5
2 3 6
1 3 7
3 4 7


## Sample Output:

IMPOSSIBLE


## Sample Input:

2 1
1 2 10


## Sample Output:

0


Info

Provider CodeForces Gym

Code GYM103388D

Tags

Submitted 0

Passed 0

AC Rate 0%

Date 11/01/2021 22:23:29

Related

Nothing Yet