-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path4_test.go
83 lines (81 loc) · 1.6 KB
/
4_test.go
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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
package contest392
import (
"reflect"
"testing"
)
func Test_minimumCost(t *testing.T) {
type args struct {
n int
edges [][]int
query [][]int
}
tests := []struct {
name string
args args
want []int
}{
{
args: args{
n: 10,
edges: [][]int{
{0, 1, 0}, {6, 8, 4}, {8, 1, 7},
},
query: [][]int{{0, 1}, {0, 9}, {2, 7}, {9, 4}, {3, 5}, {2, 6}},
},
want: []int{0, -1, -1, -1, -1, -1},
},
{
args: args{
n: 3,
edges: [][]int{
{0, 2, 7}, {0, 1, 15}, {1, 2, 6}, {1, 2, 1},
},
query: [][]int{{1, 2}},
},
want: []int{0},
},
{
args: args{
n: 8,
edges: [][]int{
{0, 4, 7}, {3, 5, 1}, {1, 3, 5}, {1, 5, 1},
},
query: [][]int{{0, 4}, {1, 5}, {3, 0}, {3, 3}, {3, 2}, {2, 0}, {7, 7}, {7, 0}},
},
want: []int{7, 1, -1, 0, -1, -1, 0, -1},
},
{
args: args{
n: 8,
edges: [][]int{
{0, 1, 7}, {1, 3, 7}, {1, 2, 1},
},
query: [][]int{{0, 3}, {3, 4}},
},
want: []int{1, -1},
},
{
args: args{
n: 9,
edges: [][]int{{5, 4, 9}, {6, 1, 1}, {6, 5, 7}, {5, 7, 4}, {5, 7, 8}, {8, 3, 0}, {4, 0, 8}, {3, 7, 0}, {1, 5, 3}},
query: [][]int{{3, 0}},
},
want: []int{0},
},
{
args: args{
n: 8,
edges: [][]int{{0, 3, 5}, {0, 3, 2}, {4, 5, 7}, {3, 1, 7}, {5, 2, 5}, {1, 0, 0}},
query: [][]int{{4, 5}},
},
want: []int{5},
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
if got := minimumCost(tt.args.n, tt.args.edges, tt.args.query); !reflect.DeepEqual(got, tt.want) {
t.Errorf("minimumCost() = %v, want %v", got, tt.want)
}
})
}
}