| ||||||||||
Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Announcement | Current Contest Past Contests Scheduled Contests Award Contest |
Ikki's Story I - Road Reconstruction
Description Ikki
is the king of a small country ¨C Phoenix, Phoenix is so small that
there is only one city that is responsible for the production of daily
goods, and uses the road network to transport the goods to the capital.
Ikki finds that the biggest problem in the country is that
transportation speed is too slow. Since Ikki was an ACM/ICPC
contestant before, he realized that this, indeed, is a maximum flow
problem. He coded a maximum flow program and found the answer. Not
satisfied with the current status of the transportation speed, he wants
to increase the transportation ability of the nation. The method is
relatively simple, Ikki will reconstruct some roads in this
transportation network, to make those roads afford higher capacity in
transportation. But unfortunately, the country of Phoenix is not so
rich in GDP that there is only enough money to rebuild one road. Ikki
wants to find such roads that if reconstructed, the total capacity of
transportation will increase. He thought this problem for a
loooong time but cannot get it. So he gave this problem to frkstyc, who
put it in this POJ Monthly contest for you to solve. Can you solve it
for Ikki? Input The input contains exactly one test case. The first line of the test case contains two integers N, M (N ¡Ü 500, M ¡Ü 5,000) which represents the number of cities and roads in the country, Phoenix, respectively. M lines follow, each line contains three integers a, b, c, which means that there is a road from city a to city b with a transportation capacity of c (0 ¡Ü a, b < n, c ¡Ü 100). All the roads are directed. Cities are numbered from 0 to n − 1, the city which can product goods is numbered 0, and the capital is numbered n − 1. Output Sample Input Sample Output Source |
[Submit] [Go Back] [Status] [Discuss]
All Rights Reserved 2003-2006 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator