題目大意
給定\(N\)個點，\(M\)條邊，聯通圖，每個點都有點權，每條邊都有邊權，定義最小權重為點權加邊權，求點1到其他點的最小權重？
題解
剛開始的思路是，列舉\(i\)，求1到\(i\)的最小權重，求最小權重的時間複雜度是\(O(MlogM)\)，這樣時間複雜度是爆炸的
後來我想，有一個結論：
如果一個圖是聯通的，我們在迪傑斯特拉的過程中，我們把佇列裡的所有點都跑完的話，最後算出來的就是1到其他點兒的最短路
有了這個結論的話，我們直接寫就行，這個題就完了
[ABC362D] Shortest Path 3
相關文章
- 題解：AT_abc362_d [ABC362D] Shortest Path 3
- QOJ #8232. Yet Another Shortest Path Query
- [ABC232G] Modulo Shortest Path （最佳化建圖）
- d3js path generator vs layoutsJS
- CSS3 clip-path 用法介紹CSSS3
- LeetCode-Shortest Word DistanceLeetCode
- D3原始碼解讀系列之Path原始碼
- [LeetCode] 243. Shortest Word DistanceLeetCode
- LeetCode-Shortest Word Distance IILeetCode
- LeetCode-Shortest Word Distance IIILeetCode
- Flutter Path(二) ： Path 進階Flutter
- LeetCode之Shortest Distance to a Character（Kotlin）LeetCodeKotlin
- [LeetCode] 244. Shortest Word Distance IILeetCode
- [ABC211D] Number of Shortest paths 題解
- Flutter Path(一) ： Path 與 CustomPainterFlutterAI
- Conventional Path Export和Direct Path ExportExport
- Conventional Path Export Versus Direct Path ExportExport
- 【論文筆記】Shortest Paths and Centrality in Uncertain Networks筆記AI
- LeetCode-Shortest Distance from All BuildingsLeetCodeUI
- enq: KO - fast object checkpoint 等待事件與 direct path read - 3ENQASTObject事件
- crontab on raspberry pi, full path, not relative path, is needed.
- Oracle for windows - pathOracleWindows
- Java Path (轉)Java
- [BUG反饋]defined('ADDON_PATH') or define('ADDON_PATH', APP_PATH.'Addon');APP
- [LeetCode] 317. Shortest Distance from All BuildingsLeetCodeUI
- 解決direct path read 與 direct path write問題
- hihoCoder 1107 Shortest Proper Prefix （字典樹的遍歷）
- BZOJ3084 : [Algorithmic Engagements 2011]The Shortest PeriodGo
- Cookie path 屬性Cookie
- os.path()模組
- CSS clip-pathCSS
- path模組 fs模組
- node之path模組
- chrome extension/plugin pathChromePlugin
- how to remove datafile pathREM
- os.path.split
- Python（Path().name）Python
- The Staff Engineer’s Path