-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy patht0502-combo.out
69 lines (49 loc) · 1.46 KB
/
t0502-combo.out
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
The input data is:
Wenham
Hamilton 1 mi
Hamilton
Wenham 1 mi
The shortest paths from Wenham are:
The shortest path from Wenham to Hamilton is 1 mi:
Wenham
Hamilton
The road upgrading goal can be achieved at minimal cost by upgrading:
Hamilton to Wenham
Connected components in event of a major storm are:
If all bridges fail, the following towns would form an isolated group:
Wenham
Hamilton
Destruction of any of the following would result in the province becoming
disconnected:
(None)
------------------------------------------------------------------
The input data is:
A
B 1 mi via bridge
B
A 1 mi via bridge
C 1 mi via bridge
C
B 1 mi via bridge
The shortest paths from A are:
The shortest path from A to B is 1 mi:
A
B
The shortest path from A to C is 2 mi:
A
B
C
The road upgrading goal can be achieved at minimal cost by upgrading:
B to A
C to B
Connected components in event of a major storm are:
If all bridges fail, the following towns would form an isolated group:
A
If all bridges fail, the following towns would form an isolated group:
B
If all bridges fail, the following towns would form an isolated group:
C
Destruction of any of the following would result in the province becoming
disconnected:
B
------------------------------------------------------------------