結果

問題 No.556 仁義なきサルたち
ユーザー ccppjsrb
提出日時 2020-08-26 12:23:29
言語 Go
(1.23.4)
結果
AC  
実行時間 4 ms / 2,000 ms
コード長 1,970 bytes
コンパイル時間 13,836 ms
コンパイル使用メモリ 236,256 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-11-07 03:59:23
合計ジャッジ時間 14,584 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

package main
import (
"bufio"
"fmt"
"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)
uf := make([]int, n)
cnt := make([]int, n)
for i := 0; i < n; i++ {
uf[i] = i
cnt[i] = 1
}
for i := 0; i < m; i++ {
a := getNextInt(scanner) - 1
b := getNextInt(scanner) - 1
ra := root(a, uf)
rb := root(b, uf)
if ra == rb {
continue
}
if cnt[ra] == cnt[rb] {
if ra < rb {
uf[rb] = ra
cnt[ra] += cnt[rb]
continue
}
uf[ra] = rb
cnt[rb] += cnt[ra]
continue
}
if cnt[ra] > cnt[rb] {
uf[rb] = ra
cnt[ra] += cnt[rb]
continue
}
uf[ra] = rb
cnt[rb] += cnt[ra]
}
for i := 0; i < n; i++ {
fmt.Fprintln(writer, root(i, uf)+1)
}
}
func root(i int, uf []int) int {
if i == uf[i] {
return i
}
uf[i] = root(uf[i], uf)
return uf[i]
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0