結果

問題 No.1207 グラフX
ユーザー dot_haraaidot_haraai
提出日時 2021-05-31 20:33:59
言語 Nim
(2.0.2)
結果
AC  
実行時間 509 ms / 2,000 ms
コード長 1,798 bytes
コンパイル時間 4,101 ms
コンパイル使用メモリ 88,064 KB
実行使用メモリ 72,448 KB
最終ジャッジ日時 2024-04-26 08:18:01
合計ジャッジ時間 23,293 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 402 ms
29,696 KB
testcase_01 AC 401 ms
29,568 KB
testcase_02 AC 402 ms
30,720 KB
testcase_03 AC 395 ms
29,312 KB
testcase_04 AC 402 ms
31,232 KB
testcase_05 AC 506 ms
72,320 KB
testcase_06 AC 497 ms
72,320 KB
testcase_07 AC 509 ms
72,320 KB
testcase_08 AC 320 ms
20,736 KB
testcase_09 AC 345 ms
23,552 KB
testcase_10 AC 481 ms
52,352 KB
testcase_11 AC 507 ms
72,448 KB
testcase_12 AC 321 ms
23,296 KB
testcase_13 AC 173 ms
12,928 KB
testcase_14 AC 397 ms
28,800 KB
testcase_15 AC 336 ms
23,680 KB
testcase_16 AC 170 ms
11,776 KB
testcase_17 AC 260 ms
18,560 KB
testcase_18 AC 218 ms
19,328 KB
testcase_19 AC 252 ms
15,616 KB
testcase_20 AC 397 ms
29,056 KB
testcase_21 AC 30 ms
5,376 KB
testcase_22 AC 263 ms
18,688 KB
testcase_23 AC 285 ms
21,376 KB
testcase_24 AC 189 ms
18,176 KB
testcase_25 AC 402 ms
28,800 KB
testcase_26 AC 305 ms
22,144 KB
testcase_27 AC 367 ms
26,240 KB
testcase_28 AC 346 ms
23,808 KB
testcase_29 AC 337 ms
25,600 KB
testcase_30 AC 177 ms
13,184 KB
testcase_31 AC 149 ms
12,160 KB
testcase_32 AC 150 ms
12,416 KB
testcase_33 AC 159 ms
12,544 KB
testcase_34 AC 325 ms
23,168 KB
testcase_35 AC 31 ms
5,376 KB
testcase_36 AC 325 ms
23,040 KB
testcase_37 AC 285 ms
19,584 KB
testcase_38 AC 73 ms
7,680 KB
testcase_39 AC 168 ms
14,464 KB
testcase_40 AC 118 ms
11,648 KB
testcase_41 AC 233 ms
15,488 KB
testcase_42 AC 2 ms
5,376 KB
testcase_43 AC 2 ms
5,376 KB
testcase_44 AC 2 ms
5,376 KB
testcase_45 AC 392 ms
30,336 KB
testcase_46 AC 392 ms
30,336 KB
testcase_47 AC 397 ms
30,336 KB
testcase_48 AC 392 ms
30,336 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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(2, 18) Warning: imported and not used: 'future' [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,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 modPow(x,n,md:int):int=
  var
    x = x
    n = n
  result = 1
  while n > 0:
    if (n and 1) > 0:
      result*=x
      result.mod=md
    x = (x^2).mod(md)
    n = n shr 1




proc solve()=
  var
    n = scan()
    m = scan()
    X = scan()
    #
    xyz = newseqwith(m,(scan()-1,scan()-1,scan()))
    md = 10^9+7
    roots = newseqwith(n,0)
  xyz = xyz.sortedByIt(it[2])
  
  for i in 0..<n:
    roots[i] = i
  
  proc find(x:int):int=
    if roots[x] == x:
      return x
    else:
      result = find(roots[x])
      roots[x] = result

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

  var
    es = newseqwith(n,newseq[int]())
    cs = newseqwith(n,newseq[int]())
    res = 0
  
  for (x,y,z) in xyz:
    if find(x)!=find(y):
      es[x].add(y)
      es[y].add(x)
      cs[x].add(z)
      cs[y].add(z)
      unite(x,y)
  #echo es.join("\n")
  #echo ""
  #echo cs.join("\n")
  #echo  roots
  
  proc dfs(par,p:int):int=
    result = 1
    for (nxt,cost) in zip(es[p],cs[p]):
      if nxt == par:continue
      var t = dfs(p,nxt)
      res+=(((n-t)*t).mod(md)*modPow(X,cost,md)).mod(md)
      res.mod=md
      result+=t
  discard dfs(-1,0)
  echo res
    

  

  
  
    
solve()
0