結果
問題 |
No.92 逃走経路
|
ユーザー |
|
提出日時 | 2019-01-22 08:54:18 |
言語 | Nim (2.2.0) |
結果 |
AC
|
実行時間 | 60 ms / 5,000 ms |
コード長 | 1,503 bytes |
コンパイル時間 | 3,291 ms |
コンパイル使用メモリ | 72,264 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-07-01 10:31:12 |
合計ジャッジ時間 | 4,274 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
コンパイルメッセージ
/home/judge/data/code/Main.nim(1, 27) Warning: imported and not used: 'strutils' [UnusedImport] /home/judge/data/code/Main.nim(1, 44) Warning: imported and not used: 'tables' [UnusedImport]
ソースコード
import sequtils,algorithm,strutils,intsets,tables template times*(n:int,body) = (for _ in 0..<n: body) proc getchar_unlocked():char {. importc:"getchar_unlocked",header: "<stdio.h>" .} proc scan(): int = while true: let k = getchar_unlocked() if k < '0': break result = 10 * result + k.ord - '0'.ord proc putchar_unlocked(c:char){. importc:"putchar_unlocked",header: "<stdio.h>" .} proc printInt(a:int32) = if a == 0: putchar_unlocked('0') return template div10(a:int32) : int32 = cast[int32]((0x1999999A * cast[int64](a)) shr 32) template mod10(a:int32) : int32 = a - (a.div10 * 10) var n = a var rev = a var cnt = 0 while rev.mod10 == 0: cnt += 1 rev = rev.div10 rev = 0 while n != 0: rev = rev * 10 + n.mod10 n = n.div10 while rev != 0: putchar_unlocked((rev.mod10 + '0'.ord).chr) rev = rev.div10 while cnt != 0: putchar_unlocked('0') cnt -= 1 proc printInt(a:int,last:char) = a.int32.printInt() putchar_unlocked(last) let n = scan() let m = scan() let k = scan() var A = newSeq[int](m) var B = newSeq[int](m) var C = newSeq[int](m) for i in 0..<m: A[i] = scan() B[i] = scan() C[i] = scan() var oks = initIntSet() for i in 1..n: oks.incl i k.times: var nexts = initIntSet() let d = scan() for i in 0..<m: if C[i] != d: continue if A[i] in oks: nexts.incl B[i] if B[i] in oks: nexts.incl A[i] oks = nexts printInt(oks.card,'\n') for i in toSeq(oks.items).sorted(cmp): printInt(i,' ')