結果
問題 | No.990 N×Mマス計算(Kの倍数) |
ユーザー | ayaoni |
提出日時 | 2020-11-24 18:30:23 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,280 bytes |
コンパイル時間 | 408 ms |
コンパイル使用メモリ | 87,092 KB |
実行使用メモリ | 112,476 KB |
最終ジャッジ日時 | 2023-10-01 01:09:33 |
合計ジャッジ時間 | 4,074 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 69 ms
71,116 KB |
testcase_01 | RE | - |
testcase_02 | RE | - |
testcase_03 | AC | 71 ms
71,424 KB |
testcase_04 | AC | 74 ms
71,488 KB |
testcase_05 | AC | 72 ms
71,292 KB |
testcase_06 | AC | 71 ms
71,516 KB |
testcase_07 | RE | - |
testcase_08 | AC | 73 ms
71,492 KB |
testcase_09 | AC | 73 ms
71,024 KB |
testcase_10 | AC | 119 ms
87,948 KB |
testcase_11 | AC | 125 ms
89,160 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 120 ms
85,936 KB |
testcase_15 | AC | 102 ms
80,632 KB |
testcase_16 | AC | 124 ms
90,168 KB |
testcase_17 | AC | 99 ms
80,452 KB |
testcase_18 | WA | - |
testcase_19 | RE | - |
testcase_20 | AC | 162 ms
112,476 KB |
ソースコード
import sys from math import gcd def I(): return int(sys.stdin.readline().rstrip()) def MI(): return map(int,sys.stdin.readline().rstrip().split()) def LS(): return list(sys.stdin.readline().rstrip().split()) N,M,K = MI() X = LS() op = X[0] B = [int(X[i]) for i in range(1,M+1)] A = [I() for _ in range(N)] if op == '+': count_A = {} count_B = {} for i in range(N): a = A[i] % K if a in count_A.keys(): count_A[a] += 1 else: count_A[a] = 1 for i in range(M): b = B[i] % K if b in count_B.keys(): count_B[b] += 1 else: count_B[b] = 1 ans = 0 for i in count_A.keys(): j = (K-i) % K if j in count_B.keys(): ans += count_A[i]*count_B[j] else: count_A = {} count_B = {} for a in A: g = gcd(a,K) if g in count_A.keys(): count_A[g] += 1 else: count_A[g] = 1 for b in B: g = gcd(b,K) if g in count_B.keys(): count_B[g] += 1 else: count_B[g] = 1 ans = 0 for da in count_A.keys(): e = K//da for db in count_B.keys(): if db % e == 0: ans += count_A[db]*count_B[db] print(ans)