結果
問題 | No.92 逃走経路 |
ユーザー | むらため |
提出日時 | 2019-01-22 17:16:10 |
言語 | Nim (2.0.2) |
結果 |
AC
|
実行時間 | 8 ms / 5,000 ms |
コード長 | 1,633 bytes |
コンパイル時間 | 2,740 ms |
コンパイル使用メモリ | 66,236 KB |
実行使用メモリ | 4,380 KB |
最終ジャッジ日時 | 2023-09-14 02:30:11 |
合計ジャッジ時間 | 3,645 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 8 ms
4,380 KB |
testcase_06 | AC | 3 ms
4,376 KB |
testcase_07 | AC | 3 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,380 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 8 ms
4,376 KB |
testcase_11 | AC | 8 ms
4,376 KB |
testcase_12 | AC | 8 ms
4,376 KB |
testcase_13 | AC | 2 ms
4,376 KB |
testcase_14 | AC | 2 ms
4,376 KB |
testcase_15 | AC | 4 ms
4,380 KB |
testcase_16 | AC | 4 ms
4,376 KB |
testcase_17 | AC | 5 ms
4,376 KB |
testcase_18 | AC | 4 ms
4,376 KB |
testcase_19 | AC | 4 ms
4,376 KB |
コンパイルメッセージ
/home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'sequtils' [UnusedImport] /home/judge/data/code/Main.nim(1, 51) Warning: imported and not used: 'sugar' [UnusedImport] /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,sugar 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 : array[1001,int] var B : array[1001,int] var C : array[1001,int] for i in 0..<m: A[i] = scan() B[i] = scan() C[i] = scan() var oks : array[101,bool] var nexts : array[101,bool] for i in 1..n: oks[i] = true k.times: let d = scan() for i in 0..<m: if C[i] != d : continue nexts[A[i]] = nexts[A[i]] or oks[B[i]] nexts[B[i]] = nexts[B[i]] or oks[A[i]] for i in 1..n: oks[i] = nexts[i] nexts[i] = false var ans = 0 for i in 1..n: if oks[i] : ans += 1 printInt(ans,'\n') for i in 1..n: if oks[i] : printInt(i,' ') putchar_unlocked('\n')