結果

問題 No.1451 集団登校
コンテスト
ユーザー dot_haraai
提出日時 2021-05-09 17:19:40
言語 Nim
(2.2.0)
結果
WA  
実行時間 -
コード長 2,415 bytes
コンパイル時間 5,551 ms
コンパイル使用メモリ 90,856 KB
実行使用メモリ 41,244 KB
最終ジャッジ日時 2024-09-18 22:45:23
合計ジャッジ時間 8,381 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 18 WA * 9
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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, 37) Warning: imported and not used: 'deques' [UnusedImport]
/home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport]
/home/judge/data/code/Main.nim(2, 44) Warning: imported and not used: 'heapqueue' [UnusedImport]
/home/judge/data/code/Main.nim(1, 41) Warning: imported and not used: 'algorithm' [UnusedImport]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [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]

ソースコード

diff # 

import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques,heapqueue
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 xgcd(a,b:int):(int,int,int)=
  var
    b = b
    x0=1
    y0=0
    x1=0
    y1=1
    q:int
    a = a
  while b!=0:
    (q,a,b) = (a.div(b),b,a.mod(b))
    (x0,x1)=(x1,x0-q*x1)
    (y0,y1)=(y1,y0-q*y1)
  return (a,x0,y0)

# modの逆元
proc modinv(a,m:int):int=
  var (g,x,y)=xgcd(a,m)
  if g!=1:
    return -1
  else:
    return x mod m
proc solve()=
  var 
    md = 10^9+7
    n = scan()
    m = scan()
    roots = newseqwith(n,0) # 各生徒が所属する班のメンバー
    population = newseqwith(n,1) # 各rootが所属する班の人数
    #groupLeader = newseqwith(n,initHashSet[int]()) # 各rootに対応するリーダー
    groupLeader = initTable[int,HashSet[int]]()

  
  proc find(x:int):int=
    if roots[x]==x:
      result = x
    else:
      result = find(roots[x])
      roots[x] = result

  proc unite(x,y:int)=
    var
      rx = find(x)
      ry = find(y)
      popx = population[rx]
      popy = population[ry]
    if rx == ry:return
    if popx > popy:
      roots[ry]=rx
      population[rx]+=popy
      groupLeader.del(ry)
    elif popy > popx:
      roots[rx]=ry
      population[ry]+=popx
      groupLeader.del(rx)
    else:
      roots[ry] = rx
      population[rx]+=popy
      groupLeader[rx] =  groupLeader[rx] + groupLeader[ry]
      groupLeader.del(ry)



  for i in 0..<n:
    roots[i]=i
    groupLeader[i] = @[i].toHashSet()
  for i in 0..<m:
    var
      (a,b)=(scan()-1,scan()-1)
    unite(a,b)
  for i in 0..<n:
    discard find(i)
  var
    rts = initHashSet[int]()
  for i in 0..<n:
    rts.incl(roots[i])
  var
    bunshi = newseqwith(n,1)
    bunbo = newseqwith(n,0)
  #echo population
  #echo roots
  #echo rts
  for rt in rts:
    for leader in groupLeader[rt]:
      bunbo[leader] = groupLeader[rt].len
  for i in 0..<n:
    if bunbo[i] == 0:
      echo 0
    else:
      echo (modinv(bunbo[i],md)+md).mod(md)


solve()
0