提出 #18780911

---

ソースコード 拡げる

package main

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

var r = bufio.NewReader(os.Stdin)

var N, M int
var MAT [][]rune

func main() {
	N, M = ni(), ni()
	MAT = make([][]rune, N)
	for i := range MAT {
		MAT[i] = make([]rune, N)
		for j := range MAT[i] {
			MAT[i][j] = 'N'
		}
	}
	solve()
}

func solve() {
	for i := 0; i < M; i++ {
		a := ni()
		b := ni() - 1
		switch a {
		case 1:
			c := ni() - 1
			follow(b, c)
		case 2:
			followBackAll(b)
		case 3:
			followFollow(b)
		}
	}

	for i := range MAT {
		fmt.Println(string(MAT[i]))
	}

}

func follow(a, b int) {
	MAT[a][b] = 'Y'
	// log.Printf("%d followed %d", a+1, b+1)
}

func followBackAll(a int) {
	for _, b := range getFollower(a) {
		follow(a, b)
	}
}

func followFollow(a int) {
	for _, e1 := range getFollows(a) {
		for _, e2 := range getFollows(e1) {
			if e2 == a {
				continue
			}
			follow(a, e2)
		}
	}

}

// nをフォローしている人のidxを返す
func getFollower(n int) (ret []int) {
	for i := 0; i < N; i++ {
		if MAT[i][n] == 'Y' {
			ret = append(ret, i)
		}
	}
	return
}

// nがフォローしている人のidxを返す
func getFollows(n int) (ret []int) {
	for i := 0; i < N; i++ {
		if MAT[n][i] == 'Y' {
			ret = append(ret, i)
		}
	}
	return
}

func ni() int { var n int; fmt.Fscan(r, &n); return n }

提出情報

ジャッジ結果