#724805 (Go) No.1601 With Animals into Institute

• 問題: No.1601 With Animals into Institute
• ユーザー: 小野寺健
• 提出日時: 2021-12-18 09:05:20
• 言語: Go (1.22.1)
• 結果: AC
• 実行時間: 638 ms / 3,000 ms
• コード長: 1,857 bytes
• コンパイル時間: 14,536 ms
• コンパイル使用メモリ: 231,712 KB
• 実行使用メモリ: 41,944 KB
• 最終ジャッジ日時: 2024-09-15 09:44:40
• 合計ジャッジ時間: 25,582 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	10 ms; 5,376 KB
testcase_04	AC	10 ms; 5,376 KB
testcase_05	AC	10 ms; 5,376 KB
testcase_06	AC	616 ms; 36,992 KB
testcase_07	AC	595 ms; 37,632 KB
testcase_08	AC	635 ms; 41,944 KB
testcase_09	AC	615 ms; 37,120 KB
testcase_10	AC	623 ms; 39,792 KB
testcase_11	AC	600 ms; 37,504 KB
testcase_12	AC	634 ms; 36,992 KB
testcase_13	AC	619 ms; 40,576 KB
testcase_14	AC	621 ms; 39,872 KB
testcase_15	AC	611 ms; 40,576 KB
testcase_16	AC	623 ms; 36,736 KB
testcase_17	AC	638 ms; 40,704 KB
testcase_18	AC	11 ms; 5,376 KB
testcase_19	AC	11 ms; 5,376 KB
testcase_20	AC	11 ms; 5,376 KB
testcase_21	AC	11 ms; 5,376 KB
testcase_22	AC	11 ms; 5,376 KB
testcase_23	AC	10 ms; 5,376 KB
testcase_24	AC	10 ms; 5,376 KB
testcase_25	AC	11 ms; 5,376 KB
testcase_26	AC	11 ms; 5,376 KB
testcase_27	AC	1 ms; 5,376 KB
testcase_28	AC	1 ms; 5,376 KB
testcase_29	AC	1 ms; 5,376 KB
testcase_30	AC	1 ms; 5,376 KB
testcase_31	AC	1 ms; 5,376 KB
testcase_32	AC	1 ms; 5,376 KB
testcase_33	AC	2 ms; 5,376 KB
testcase_34	AC	1 ms; 5,376 KB
testcase_35	AC	1 ms; 5,376 KB
testcase_36	AC	1 ms; 5,376 KB
testcase_37	AC	1 ms; 5,376 KB
testcase_38	AC	2 ms; 5,376 KB

ソースコード

package main

import (
	"fmt"
	"bufio"
	"os"
	"math"
)

type Cell struct {
	items [2]int
	next *Cell
}

func newCell(items [2]int, cp *Cell) *Cell {
	newcp := new(Cell)
	newcp.items, newcp.next = items, cp
	return newcp
}

type Queue struct {
	size int
	front, rear *Cell
}

func newQueue() *Queue {
	newqp := new(Queue)
	newqp.size, newqp.front, newqp.rear = 0, nil, nil
	return newqp
}

func (q *Queue) enqueue(items [2]int) {
	cp := newCell(items, nil)
	if q.size == 0 {
		q.front = cp
		q.rear = cp
	} else {
		q.rear.next = cp
		q.rear = cp
	}
	q.size++
}

func (q *Queue) dequeue() ([2]int, bool) {
	if q.size == 0 {
		return [2]int{0, 0}, false
	} else {
		items := q.front.items
		q.front = q.front.next
		q.size--
		if q.size == 0 {
			q.rear = nil
		}
		return items, true
	}
}

func (q *Queue) isEmpty() bool {
	return q.size == 0
}

func main() {
	r := bufio.NewReader(os.Stdin)
	w := bufio.NewWriter(os.Stdout)
    defer w.Flush()
	var N, M int
	fmt.Fscan(r, &N, &M)
	cost := make([][][3]int, N)
	for i := 0; i < N; i++ {
		cost[i] = make([][3]int, 0)
	}
	for i := 0; i < M; i++ {
		var a, b, c, x int
		fmt.Fscan(r, &a, &b, &c, &x)
		cost[a-1] = append(cost[a-1], [3]int{b-1, c, x})
		cost[b-1] = append(cost[b-1], [3]int{a-1, c, x})
	}
	d := make([][2]int, N)
	for i := 0; i < N; i++ {
		d[i] = [2]int{math.MaxInt64, math.MaxInt64}
	}
	d[N-1][0] = 0
	q := newQueue()
	q.enqueue([2]int{N-1, 0})
	for !q.isEmpty() {
		items, _ := q.dequeue()
		v, x := items[0], items[1]
		for _, costs := range cost[v] {
			nv, c, nx := costs[0], costs[1], costs[2]
			if nx == 0 {
				if d[nv][x] > d[v][x] + c {
					d[nv][x] = d[v][x] + c
					q.enqueue([2]int{nv, x})
				}
			} else {
				if d[nv][nx] > d[v][x] + c {
					d[nv][nx] = d[v][x] + c
					q.enqueue([2]int{nv, nx})
				}
			}
		}
	}
	for i := 0; i < N-1; i++ {
		fmt.Fprintln(w, d[i][1])
	}
}