Cable TVYou would like to provide citizens of a newly constructed neighborhood with cable television.
As a computer scientist, you know this calls for... wires!
Surveyors have done their work and have given you the cost of connecting pairs of locations.
However, they have also warned you that certain links might be dangerous - there is a risk of interference from power lines and such.
Find the minimum cost to connect all the houses, minimizing the cost but above all minimzing the number of dangerous links used.
InputN ≤ 100, the number of locations.
M ≤ 10000, the number of possible links.
M lines, each with four integers a,b,c,d.
Each line signifies a possible (bidirectonal) link between locations a and b, with cost c. d will be 1 if the link is dangerous, and 0 otherwise.
Output a) the minimum number of dangerous links required and b) the total minimum cost.
4 4 1 2 2 0 2 3 1 1 3 1 1 0 3 4 1 1
Take 1-2, 3-1, and 3-4.
The use of one dangerous cable is inevitable, but we can avoid the use of the other.
Point Value: 15
Time Limit: 1.00s
Memory Limit: 32M
Added: Mar 04, 2009
- Graph Theory
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3