結果
問題 | No.1293 2種類の道路 |
ユーザー |
![]() |
提出日時 | 2020-11-30 21:32:30 |
言語 | Go (1.23.4) |
結果 |
AC
|
実行時間 | 1,957 ms / 2,000 ms |
コード長 | 3,197 bytes |
コンパイル時間 | 13,175 ms |
コンパイル使用メモリ | 223,168 KB |
実行使用メモリ | 103,940 KB |
最終ジャッジ日時 | 2024-09-13 02:35:37 |
合計ジャッジ時間 | 21,672 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 22 |
ソースコード
package mainimport ("bufio""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}//// Disjoint Set Union: Union Find Tree//// DSU :type DSU struct {parentOrSize []intn int}// Dsu :func Dsu(n int) *DSU {var d DSUd.n = nd.parentOrSize = make([]int, n)for i := 0; i < n; i++ {d.parentOrSize[i] = -1}return &d}// Merge :func (d DSU) Merge(a, b int) int {x, y := d.Leader(a), d.Leader(b)if x == y {return x}if -d.parentOrSize[x] < -d.parentOrSize[y] {x, y = y, x}d.parentOrSize[x] += d.parentOrSize[y]d.parentOrSize[y] = xreturn x}// Same :func (d DSU) Same(a, b int) bool {return d.Leader(a) == d.Leader(b)}// Leader :func (d DSU) Leader(a int) int {if d.parentOrSize[a] < 0 {return a}d.parentOrSize[a] = d.Leader(d.parentOrSize[a])return d.parentOrSize[a]}// Size :func (d DSU) Size(a int) int {return -d.parentOrSize[d.Leader(a)]}// Groups : original implementfunc (d DSU) Groups() [][]int {m := make(map[int][]int)for i := 0; i < d.n; i++ {x := d.Leader(i)if x < 0 {m[i] = append(m[i], i)} else {m[x] = append(m[x], i)}}ret := make([][]int, len(m))idx := 0for _, e := range m {ret[idx] = make([]int, len(e))copy(ret[idx], e)idx++}return ret}func main() {defer wr.Flush()sc.Split(bufio.ScanWords)sc.Buffer([]byte{}, 1000000)// this template is new version.// use getI(), getS(), getInts(), getF()N, D, W := getI(), getI(), getI()uf0 := Dsu(N)uf1 := Dsu(N)for i := 0; i < D; i++ {a, b := getI()-1, getI()-1uf0.Merge(a, b)}for i := 0; i < W; i++ {a, b := getI()-1, getI()-1uf1.Merge(a, b)}x := uf0.Groups()y := uf1.Groups()which := make([]int, N)for i := 0; i < len(y); i++ {for _, e := range y[i] {which[e] = i}}// out(x, y)// out(which)ans := 0for i := 0; i < len(x); i++ {n := 0used := make([]bool, len(y))for _, e := range x[i] {if used[which[e]] == false {n += len(y[which[e]]) - 1used[which[e]] = true} else {n--}}m := len(x[i])ans += m*(m-1) + m*n// out(x[i], n, m)}out(ans)}