#578903 (Go) No.848 なかよし旅行

• 問題: No.848 なかよし旅行
• ユーザー: aru aru
• 提出日時: 2020-11-12 22:07:32
• 言語: Go (1.22.1)
• 結果: AC
• 実行時間: 807 ms / 2,000 ms
• コード長: 3,031 bytes
• コンパイル時間: 13,260 ms
• コンパイル使用メモリ: 223,860 KB
• 実行使用メモリ: 17,408 KB
• 最終ジャッジ日時: 2024-11-08 01:19:24
• 合計ジャッジ時間: 16,544 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	807 ms; 17,408 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,248 KB
testcase_03	AC	1 ms; 5,248 KB
testcase_04	AC	1 ms; 5,248 KB
testcase_05	AC	1 ms; 5,248 KB
testcase_06	AC	1 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	2 ms; 5,248 KB
testcase_10	AC	2 ms; 5,248 KB
testcase_11	AC	26 ms; 6,016 KB
testcase_12	AC	32 ms; 6,016 KB
testcase_13	AC	41 ms; 7,168 KB
testcase_14	AC	19 ms; 5,248 KB
testcase_15	AC	37 ms; 6,656 KB
testcase_16	AC	59 ms; 10,368 KB
testcase_17	AC	41 ms; 8,064 KB
testcase_18	AC	25 ms; 5,504 KB
testcase_19	AC	22 ms; 5,248 KB
testcase_20	AC	15 ms; 5,248 KB
testcase_21	AC	46 ms; 8,192 KB
testcase_22	AC	38 ms; 7,296 KB
testcase_23	AC	27 ms; 5,248 KB
testcase_24	AC	2 ms; 5,248 KB
testcase_25	AC	64 ms; 10,368 KB
testcase_26	AC	1 ms; 5,248 KB
testcase_27	AC	1 ms; 5,248 KB
testcase_28	AC	2 ms; 5,248 KB
testcase_29	AC	1 ms; 5,248 KB

ソースコード

package main

import (
	"bufio"
	"container/heap"
	"fmt"
	"os"
	"sort"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)
var wr = bufio.NewWriter(os.Stdout)

func out(x ...interface{}) {
	fmt.Fprintln(wr, x...)
}

func getI() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getF() float64 {
	sc.Scan()
	i, e := strconv.ParseFloat(sc.Text(), 64)
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getI()
	}
	return ret
}

func getS() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

type edge struct {
	to, cost int
}

var N, M, P, Q, T int
var node [][]edge

const inf = int(1e18)

//---------------------------------------------
// priority queue
//---------------------------------------------
type pqi struct{ a, pos int }

type priorityQueue []pqi

func (pq priorityQueue) Len() int            { return len(pq) }
func (pq priorityQueue) Swap(i, j int)       { pq[i], pq[j] = pq[j], pq[i] }
func (pq priorityQueue) Less(i, j int) bool  { return pq[i].a < pq[j].a }
func (pq *priorityQueue) Push(x interface{}) { *pq = append(*pq, x.(pqi)) }
func (pq *priorityQueue) Pop() interface{} {
	x := (*pq)[len(*pq)-1]
	*pq = (*pq)[0 : len(*pq)-1]
	return x
}

func dijkstra(s int) []int {
	dist := make([]int, N)
	for i := 0; i < N; i++ {
		dist[i] = inf
	}
	pq := priorityQueue{}
	dist[s] = 0
	heap.Push(&pq, pqi{0, s})
	for len(pq) != 0 {
		cur := pq[0]
		heap.Pop(&pq)
		for _, e := range node[cur.pos] {
			if dist[e.to] > dist[cur.pos]+e.cost {
				dist[e.to] = dist[cur.pos] + e.cost
				heap.Push(&pq, pqi{dist[e.to], e.to})
			}
		}
	}
	return dist
}

func main() {
	defer wr.Flush()
	sc.Split(bufio.ScanWords)
	sc.Buffer([]byte{}, 1000000)
	// this template is new version.
	// use getI(), getS(), getInts(), getF()
	N, M, P, Q, T = getI(), getI(), getI()-1, getI()-1, getI()
	node = make([][]edge, N)
	for i := 0; i < M; i++ {
		from, to, cost := getI()-1, getI()-1, getI()
		node[from] = append(node[from], edge{to, cost})
		node[to] = append(node[to], edge{from, cost})
	}

	s := dijkstra(0)
	p := dijkstra(P)
	q := dijkstra(Q)

	ans := -1

	d := s[P] + s[Q] + p[Q]
	if d <= T {
		ans = T
	}

	for x := 0; x < N; x++ {
		for y := 0; y < N; y++ {
			d0 := s[x] + p[x] + p[y] + s[y]
			d1 := s[x] + q[x] + q[y] + s[y]
			// out(x, d0, d1, s[x])
			if max(d0, d1) <= T {
				ans = max(ans, s[x]+s[y]+T-max(d0, d1))
			}

		}
	}
	// out(s, p, q)
	out(ans)
}