結果
問題 | No.1340 おーじ君をさがせ |
ユーザー | akasia_midori |
提出日時 | 2023-01-22 13:45:38 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,698 ms / 2,000 ms |
コード長 | 2,140 bytes |
コンパイル時間 | 407 ms |
コンパイル使用メモリ | 87,076 KB |
実行使用メモリ | 82,652 KB |
最終ジャッジ日時 | 2023-09-07 00:33:12 |
合計ジャッジ時間 | 17,855 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 70 ms
71,084 KB |
testcase_01 | AC | 70 ms
71,356 KB |
testcase_02 | AC | 71 ms
71,136 KB |
testcase_03 | AC | 71 ms
71,404 KB |
testcase_04 | AC | 71 ms
71,548 KB |
testcase_05 | AC | 71 ms
71,316 KB |
testcase_06 | AC | 72 ms
71,544 KB |
testcase_07 | AC | 71 ms
71,144 KB |
testcase_08 | AC | 70 ms
71,584 KB |
testcase_09 | AC | 70 ms
71,292 KB |
testcase_10 | AC | 85 ms
76,548 KB |
testcase_11 | AC | 171 ms
77,388 KB |
testcase_12 | AC | 106 ms
76,644 KB |
testcase_13 | AC | 361 ms
78,408 KB |
testcase_14 | AC | 273 ms
77,384 KB |
testcase_15 | AC | 239 ms
77,168 KB |
testcase_16 | AC | 102 ms
76,756 KB |
testcase_17 | AC | 135 ms
77,060 KB |
testcase_18 | AC | 172 ms
77,336 KB |
testcase_19 | AC | 86 ms
76,880 KB |
testcase_20 | AC | 84 ms
76,476 KB |
testcase_21 | AC | 199 ms
78,152 KB |
testcase_22 | AC | 1,234 ms
82,652 KB |
testcase_23 | AC | 397 ms
77,720 KB |
testcase_24 | AC | 1,698 ms
78,684 KB |
testcase_25 | AC | 108 ms
77,788 KB |
testcase_26 | AC | 102 ms
77,732 KB |
testcase_27 | AC | 99 ms
77,668 KB |
testcase_28 | AC | 112 ms
77,748 KB |
testcase_29 | AC | 93 ms
77,504 KB |
testcase_30 | AC | 205 ms
78,160 KB |
testcase_31 | AC | 620 ms
78,912 KB |
testcase_32 | AC | 549 ms
78,592 KB |
testcase_33 | AC | 543 ms
78,588 KB |
testcase_34 | AC | 602 ms
78,456 KB |
testcase_35 | AC | 706 ms
78,760 KB |
testcase_36 | AC | 72 ms
71,328 KB |
testcase_37 | AC | 83 ms
76,708 KB |
testcase_38 | AC | 579 ms
78,852 KB |
testcase_39 | AC | 231 ms
78,216 KB |
testcase_40 | AC | 228 ms
78,208 KB |
testcase_41 | AC | 228 ms
78,172 KB |
testcase_42 | AC | 77 ms
76,432 KB |
testcase_43 | AC | 80 ms
76,292 KB |
testcase_44 | AC | 79 ms
76,556 KB |
testcase_45 | AC | 77 ms
76,472 KB |
testcase_46 | AC | 225 ms
77,936 KB |
testcase_47 | AC | 240 ms
78,020 KB |
testcase_48 | AC | 261 ms
77,968 KB |
testcase_49 | AC | 202 ms
77,608 KB |
testcase_50 | AC | 210 ms
77,568 KB |
testcase_51 | AC | 210 ms
77,440 KB |
testcase_52 | AC | 300 ms
77,508 KB |
testcase_53 | AC | 295 ms
77,316 KB |
testcase_54 | AC | 301 ms
77,564 KB |
testcase_55 | AC | 310 ms
77,844 KB |
testcase_56 | AC | 78 ms
76,604 KB |
testcase_57 | AC | 78 ms
76,628 KB |
testcase_58 | AC | 72 ms
71,432 KB |
testcase_59 | AC | 151 ms
77,768 KB |
testcase_60 | AC | 70 ms
71,272 KB |
testcase_61 | AC | 149 ms
77,664 KB |
ソースコード
def oi(): return int(input()) def os(): return input() def mi(): return list(map(int, input().split())) import sys input = sys.stdin.readline # import sys # sys.setrecursionlimit(10**8) # import pypyjit # pypyjit.set_param('max_unroll_recursion=-1') input_count = 0 def prod_func(a,b): if a*b > 0: return 1 return 0 def add_func(a,b): return a+b class MATRIX: def __init__(self, prod_func, add_func): self.prod_func = prod_func self.add_func = add_func def dot(self, A,B): if len(A[0]) != len(B): return None out = [[0] * len(B[0]) for _ in range(len(A))] for ay in range(len(A)): for bx in range(len(B[0])): sums = 0 for ax in range(len(A[0])): sums += self.prod_func(A[ay][ax], B[ax][bx]) out[ay][bx] = sums return out def sum(self, A,B): if not(len(A) == len(B) and len(A[0]) == len(B[0])): return None out = [] for ay in range(len(A)): temp = [] for ax in range(len(A[0])): temp.append(self.add_func(A[ay][ax], B[ay][ax])) out.append(temp) return out def prod(self, A,B): if not(len(A) == len(B) and len(A[0]) == len(B[0])): return None out = [] for ay in range(len(A)): temp = [] for ax in range(len(A[0])): temp.append(self.prod_func(A[ay][ax], B[ay][ax])) out.append(temp) return out # 正方行列AをN乗する。 def ruijou(self, A, N): out = [[0] * len(A) for _ in range(len(A))] for i in range(len(A)): out[i][i] = 1 while N: if N%2==1: out = self.dot(out, A) A = self.dot(A,A) N//=2 return out input_count = 0 N,M,T = mi() mat = [[0] * N for _ in range(N)] MAT = MATRIX(prod_func, add_func) for i in range(M): a,b = mi() mat[a][b] = 1 out = MAT.ruijou(mat, T) count = 0 for o in out[0]: if o>0: count += 1 print(count)