248 . 最小生成樹？

Submit
Status
Discussion / Solution
Ranklist
Back to Problems List

TopCoder

dbGIs
＼(・ω・＼)SAN値!(／・ω・)／ピンチ!

User's AC Ratio

75.0% (6/8)

Submission's AC Ratio

29.3% (17/58)

Tags

ioicamp ioicamp-2020

Description

給你一張連通無向帶權圖 G，請你找出「最大邊權減最小邊權」最小的生成樹。

Input Format

第一行有兩個正整數 n,m，代表 G 的點數和邊數。

接下來有 m 行，第 i 行上有三個正整數 ui,vi,wi 代表說這條邊連接 ui,vi 邊權 wi。

  • 2≤n≤300
  • n−1≤m≤50000
  • 1≤wi≤108

Output Format

輸出「最大邊權減最小邊權」的最小值。

Sample Input 1

5 6
1 2 1
2 3 4
1 3 5
2 4 8
3 5 8
1 2 4

Sample Output 1

4

Sample Input 2

3 3
1 2 3
2 3 4
3 1 123

Sample Output 2

1

Hints

Problem Source

IOICamp 2020 Day3 pC

Subtasks

No. Testdata Range Constraints Score
1 0~1 範例測資 0
2 0~51 無額外限制 100

Testdata and Limits

No. Time Limit (ms) Memory Limit (VSS, KiB) Output Limit (KiB) Subtasks
0 1000 65536 65536 1 2
1 1000 65536 65536 1 2
2 1000 65536 65536 2
3 1000 65536 65536 2
4 1000 65536 65536 2
5 1000 65536 65536 2
6 1000 65536 65536 2
7 1000 65536 65536 2
8 1000 65536 65536 2
9 1000 65536 65536 2
10 1000 65536 65536 2
11 1000 65536 65536 2
12 1000 65536 65536 2
13 1000 65536 65536 2
14 1000 65536 65536 2
15 1000 65536 65536 2
16 1000 65536 65536 2
17 1000 65536 65536 2
18 1000 65536 65536 2
19 1000 65536 65536 2
20 1000 65536 65536 2
21 1000 65536 65536 2
22 1000 65536 65536 2
23 1000 65536 65536 2
24 1000 65536 65536 2
25 1000 65536 65536 2
26 1000 65536 65536 2
27 1000 65536 65536 2
28 1000 65536 65536 2
29 1000 65536 65536 2
30 1000 65536 65536 2
31 1000 65536 65536 2
32 1000 65536 65536 2
33 1000 65536 65536 2
34 1000 65536 65536 2
35 1000 65536 65536 2
36 1000 65536 65536 2
37 1000 65536 65536 2
38 1000 65536 65536 2
39 1000 65536 65536 2
40 1000 65536 65536 2
41 1000 65536 65536 2
42 1000 65536 65536 2
43 1000 65536 65536 2
44 1000 65536 65536 2
45 1000 65536 65536 2
46 1000 65536 65536 2
47 1000 65536 65536 2
48 1000 65536 65536 2
49 1000 65536 65536 2
50 1000 65536 65536 2
51 1000 65536 65536 2
Submit
Back to Top