結果
問題 | No.807 umg tours |
ユーザー | ccppjsrb |
提出日時 | 2020-08-10 15:30:35 |
言語 | Go (1.22.1) |
結果 |
AC
|
実行時間 | 1,012 ms / 4,000 ms |
コード長 | 2,974 bytes |
コンパイル時間 | 14,186 ms |
コンパイル使用メモリ | 211,724 KB |
実行使用メモリ | 69,836 KB |
最終ジャッジ日時 | 2023-08-15 12:56:45 |
合計ジャッジ時間 | 25,518 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 3 ms
4,376 KB |
testcase_03 | AC | 3 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 4 ms
5,516 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 763 ms
69,836 KB |
testcase_12 | AC | 490 ms
42,192 KB |
testcase_13 | AC | 777 ms
55,108 KB |
testcase_14 | AC | 289 ms
31,672 KB |
testcase_15 | AC | 216 ms
19,012 KB |
testcase_16 | AC | 858 ms
54,892 KB |
testcase_17 | AC | 985 ms
67,552 KB |
testcase_18 | AC | 966 ms
67,760 KB |
testcase_19 | AC | 968 ms
61,572 KB |
testcase_20 | AC | 379 ms
27,468 KB |
testcase_21 | AC | 404 ms
27,484 KB |
testcase_22 | AC | 157 ms
14,632 KB |
testcase_23 | AC | 117 ms
12,468 KB |
testcase_24 | AC | 472 ms
52,328 KB |
testcase_25 | AC | 1,012 ms
69,188 KB |
ソースコード
package main import ( "bufio" "container/heap" "fmt" "math" "os" "strconv" ) func configure(scanner *bufio.Scanner) { scanner.Split(bufio.ScanWords) scanner.Buffer(make([]byte, 1000005), 1000005) } func getNextString(scanner *bufio.Scanner) string { scanned := scanner.Scan() if !scanned { panic("scan failed") } return scanner.Text() } func getNextInt(scanner *bufio.Scanner) int { i, _ := strconv.Atoi(getNextString(scanner)) return i } func getNextInt64(scanner *bufio.Scanner) int64 { i, _ := strconv.ParseInt(getNextString(scanner), 10, 64) return i } func getNextFloat64(scanner *bufio.Scanner) float64 { i, _ := strconv.ParseFloat(getNextString(scanner), 64) return i } func main() { fp := os.Stdin wfp := os.Stdout extra := 0 if os.Getenv("I") == "IronMan" { fp, _ = os.Open(os.Getenv("END_GAME")) extra = 100 } scanner := bufio.NewScanner(fp) configure(scanner) writer := bufio.NewWriter(wfp) defer func() { r := recover() if r != nil { fmt.Fprintln(writer, r) } writer.Flush() }() solve(scanner, writer) for i := 0; i < extra; i++ { fmt.Fprintln(writer, "-----------------------------------") solve(scanner, writer) } } func solve(scanner *bufio.Scanner, writer *bufio.Writer) { n := getNextInt(scanner) m := getNextInt(scanner) g := newGraph(n) for i := 0; i < m; i++ { a := getNextInt(scanner) - 1 b := getNextInt(scanner) - 1 c := getNextInt64(scanner) g.appendEdge(a, b, i, c) g.appendEdge(b, a, i, c) } dd := &daikes{} for i := 0; i < n; i++ { g.v[i].c = math.MaxInt64 g.v[i].used = math.MaxInt64 } heap.Push(dd, newDaike(0, 0, false)) for dd.Len() > 0 { p := heap.Pop(dd).(daike) if p.used { if g.v[p.i].used <= p.c { continue } g.v[p.i].used = p.c } else { if g.v[p.i].c <= p.c { continue } g.v[p.i].c = p.c } for _, e := range g.e[p.i] { heap.Push(dd, newDaike(e.to, p.c+e.c, p.used)) if p.used { continue } heap.Push(dd, newDaike(e.to, p.c, true)) } } fmt.Fprintln(writer, 0) for i := 1; i < n; i++ { fmt.Fprintln(writer, g.v[i].c+g.v[i].used) } } func newDaike(i int, c int64, used bool) daike { return daike{i: i, c: c, used: used} } type daike struct { i int c int64 used bool } type daikes []daike func (h daikes) Len() int { return len(h) } func (h daikes) Less(i, j int) bool { return h[i].c < h[j].c } func (h daikes) Swap(i, j int) { h[i], h[j] = h[j], h[i] } func (h *daikes) Push(x interface{}) { *h = append(*h, x.(daike)) } func (h *daikes) Pop() interface{} { old := *h n := len(old) x := old[n-1] *h = old[0 : n-1] return x } type vertex struct { c, used int64 } type edge struct { to, id int c int64 } type graph struct { v []vertex e [][]edge } func newGraph(n int) graph { return graph{ v: make([]vertex, n), e: make([][]edge, n), } } func (g *graph) appendEdge(from, to, id int, c int64) { g.e[from] = append(g.e[from], edge{ to: to, id: id, c: c, }) }