Description: 264. Travel
time limit per test: 1 sec.
memory limit per test: 65536 KB
input: standard
output: standard
Travel agency decides to make a summer trip to Petrozavodsk for its best clients. N men and N women were selected to take part in this trip. There are N cars in the travel agency and in each car there are exactly two places for passengers, and one for driver. The head of the customer service of agency decided to place one man and one woman in each car, that s why they decided to ask customers to prepare their preference lists.
The preference list for each person is a list of persons of opposite sex in order best to worst. So, each man lists all women in the order of preference, and vice versa.
Suppose we ve assigned woman and men in such a way that each man has got exactly one woman and each woman has got exactly one man. We ll call this situation a perfect assignment .
If in a perfect assignment there is a pair of man and woman not assigned to each other and th
To Search:
File list (Check if you may need any files):
sgu264.cpp
Download