結果

問題 No.1390 Get together
ユーザー dot_haraai
提出日時 2021-03-20 17:55:35
言語 Nim
(2.2.0)
結果
AC  
実行時間 153 ms / 2,000 ms
コード長 1,200 bytes
コンパイル時間 3,901 ms
コンパイル使用メモリ 87,136 KB
実行使用メモリ 13,056 KB
最終ジャッジ日時 2024-11-21 06:29:59
合計ジャッジ時間 8,860 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 29
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/judge/data/code/Main.nim(2, 18) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated]
/home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'times' [UnusedImport]
/home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport]
/home/judge/data/code/Main.nim(2, 37) Warning: imported and not used: 'deques' [UnusedImport]
/home/judge/data/code/Main.nim(1, 41) Warning: imported and not used: 'algorithm' [UnusedImport]
/home/judge/data/code/Main.nim(1, 52) Warning: imported and not used: 'tables' [UnusedImport]
/home/judge/data/code/Main.nim(1, 60) Warning: imported and not used: 'sets' [UnusedImport]
/home/judge/data/code/Main.nim(1, 66) Warning: imported and not used: 'lists' [UnusedImport]
/home/judge/data/code/Main.nim(1, 73) Warning: imported and not used: 'intsets' [UnusedImport]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [UnusedImport]

ソースコード

diff # 

import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')



proc solve():int=
  var
    (n,m) = (scan(),scan())
    colors = newseqwith(n,newseq[int]())
    roots = newseqwith(m,0)
  for i in 0..<m:
    roots[i]=i
  for i in 0..<n:
    var  (b,c)=(scan()-1,scan()-1)
    colors[c].add(b)


  proc find(x:int):int=
    if roots[x]==x:
      return x
    else:
      roots[x]=find(roots[x])
      return roots[x]
  proc unite(x,y:int)=
    
    var
      rx = find(x)
      ry = find(y)
    if rx==ry:
      return
    else:
      roots[max(rx,ry)]=min(rx,ry)


  for color in colors:
    for i in 1..<color.len:
      if find(color[0])!=find(color[i]):
        unite(color[0],color[i])
        result+=1
  




  

  
echo solve()
0