結果
問題 | No.1340 おーじ君をさがせ |
ユーザー | mkawa2 |
提出日時 | 2023-01-18 22:27:14 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 161 ms / 2,000 ms |
コード長 | 1,100 bytes |
コンパイル時間 | 208 ms |
コンパイル使用メモリ | 12,928 KB |
実行使用メモリ | 10,880 KB |
最終ジャッジ日時 | 2024-06-11 22:14:16 |
合計ジャッジ時間 | 4,829 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 32 ms
10,752 KB |
testcase_01 | AC | 31 ms
10,752 KB |
testcase_02 | AC | 30 ms
10,880 KB |
testcase_03 | AC | 31 ms
10,752 KB |
testcase_04 | AC | 31 ms
10,752 KB |
testcase_05 | AC | 30 ms
10,624 KB |
testcase_06 | AC | 31 ms
10,752 KB |
testcase_07 | AC | 30 ms
10,752 KB |
testcase_08 | AC | 31 ms
10,752 KB |
testcase_09 | AC | 30 ms
10,624 KB |
testcase_10 | AC | 32 ms
10,752 KB |
testcase_11 | AC | 40 ms
10,752 KB |
testcase_12 | AC | 35 ms
10,752 KB |
testcase_13 | AC | 38 ms
10,752 KB |
testcase_14 | AC | 46 ms
10,752 KB |
testcase_15 | AC | 42 ms
10,752 KB |
testcase_16 | AC | 36 ms
10,880 KB |
testcase_17 | AC | 36 ms
10,752 KB |
testcase_18 | AC | 38 ms
10,752 KB |
testcase_19 | AC | 32 ms
10,880 KB |
testcase_20 | AC | 32 ms
10,624 KB |
testcase_21 | AC | 76 ms
10,880 KB |
testcase_22 | AC | 111 ms
10,624 KB |
testcase_23 | AC | 78 ms
10,624 KB |
testcase_24 | AC | 142 ms
10,880 KB |
testcase_25 | AC | 49 ms
10,752 KB |
testcase_26 | AC | 44 ms
10,880 KB |
testcase_27 | AC | 40 ms
10,752 KB |
testcase_28 | AC | 50 ms
10,880 KB |
testcase_29 | AC | 40 ms
10,880 KB |
testcase_30 | AC | 80 ms
10,752 KB |
testcase_31 | AC | 161 ms
10,624 KB |
testcase_32 | AC | 95 ms
10,752 KB |
testcase_33 | AC | 93 ms
10,752 KB |
testcase_34 | AC | 107 ms
10,752 KB |
testcase_35 | AC | 111 ms
10,880 KB |
testcase_36 | AC | 30 ms
10,752 KB |
testcase_37 | AC | 43 ms
10,752 KB |
testcase_38 | AC | 74 ms
10,752 KB |
testcase_39 | AC | 60 ms
10,752 KB |
testcase_40 | AC | 58 ms
10,752 KB |
testcase_41 | AC | 59 ms
10,880 KB |
testcase_42 | AC | 30 ms
10,880 KB |
testcase_43 | AC | 31 ms
10,752 KB |
testcase_44 | AC | 31 ms
10,752 KB |
testcase_45 | AC | 30 ms
10,752 KB |
testcase_46 | AC | 48 ms
10,880 KB |
testcase_47 | AC | 49 ms
10,752 KB |
testcase_48 | AC | 51 ms
10,880 KB |
testcase_49 | AC | 44 ms
10,752 KB |
testcase_50 | AC | 45 ms
10,624 KB |
testcase_51 | AC | 45 ms
10,752 KB |
testcase_52 | AC | 56 ms
10,880 KB |
testcase_53 | AC | 56 ms
10,880 KB |
testcase_54 | AC | 56 ms
10,752 KB |
testcase_55 | AC | 60 ms
10,752 KB |
testcase_56 | AC | 30 ms
10,752 KB |
testcase_57 | AC | 31 ms
10,880 KB |
testcase_58 | AC | 31 ms
10,752 KB |
testcase_59 | AC | 37 ms
10,752 KB |
testcase_60 | AC | 31 ms
10,752 KB |
testcase_61 | AC | 39 ms
10,880 KB |
ソースコード
import sys # sys.setrecursionlimit(1000005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = (1 << 63)-1 # inf = (1 << 31)-1 md = 10**9+7 # md = 998244353 def popcnt(a): return bin(a).count("1") def move(s): t = 0 for u in range(n): if s >> u & 1: t |= to[u] return t n, m, t = LI() to = [0]*n for _ in range(m): u, v = LI() to[u] |= 1 << v ans = 1 while t: if t & 1: ans = move(ans) nt = [0]*n for u in range(n): nt[u] = move(to[u]) to = nt t >>= 1 print(popcnt(ans))