結果
問題 | No.321 (P,Q)-サンタと街の子供たち |
ユーザー | matsu7874 |
提出日時 | 2015-12-14 13:08:16 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,723 bytes |
コンパイル時間 | 344 ms |
コンパイル使用メモリ | 12,672 KB |
実行使用メモリ | 11,008 KB |
最終ジャッジ日時 | 2024-09-15 12:30:24 |
合計ジャッジ時間 | 9,610 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 33 ms
10,880 KB |
testcase_01 | AC | 29 ms
10,752 KB |
testcase_02 | AC | 30 ms
10,752 KB |
testcase_03 | AC | 30 ms
10,880 KB |
testcase_04 | AC | 30 ms
10,752 KB |
testcase_05 | AC | 30 ms
10,752 KB |
testcase_06 | AC | 29 ms
10,880 KB |
testcase_07 | AC | 29 ms
10,752 KB |
testcase_08 | AC | 30 ms
10,880 KB |
testcase_09 | AC | 30 ms
10,880 KB |
testcase_10 | AC | 30 ms
10,752 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 30 ms
10,880 KB |
testcase_14 | WA | - |
testcase_15 | AC | 361 ms
10,880 KB |
testcase_16 | AC | 153 ms
10,880 KB |
testcase_17 | AC | 30 ms
10,752 KB |
testcase_18 | WA | - |
testcase_19 | AC | 251 ms
10,752 KB |
testcase_20 | AC | 358 ms
10,752 KB |
testcase_21 | WA | - |
testcase_22 | AC | 80 ms
10,752 KB |
testcase_23 | AC | 308 ms
10,752 KB |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | AC | 407 ms
10,752 KB |
testcase_30 | AC | 37 ms
10,880 KB |
testcase_31 | WA | - |
testcase_32 | AC | 221 ms
10,880 KB |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
ソースコード
def gcd(a, b): # 最大公約数 while b > 0: a, b = b, a % b return a def is_reachable(p, q, x, y): if p == 0: if q == 0: return x == 0 and y == 0 else: return x % q == 0 and y % q == 0 gap = gcd(p, q) if p % 2 == q % 2: if gap == 1: return x % 2 == 0 and y % 2 == 0 elif gap == p: gap = q - p # print(p,q,x,y) return (x % gap == 0 and y % gap == 0) or ((x + p) % gap == 0 and (y+p) % gap == 0) else: return (x % p == 0 and (y + gap) % p==0) or ((x + gap) % p == 0 and y % p==0) else: if gap == 1: return True elif gap == p: return x % p == 0 and y % p == 0 else: return (x % p == 0 and (y + gap) % p==0) or ((x + gap) % p == 0 and y % p==0) P, Q = map(int, input().split()) if P > Q: P, Q = Q, P N = int(input()) cnt = 0 for i in range(N): x, y = map(int, input().split()) if is_reachable(P, Q, x, y): # print(x, y, 'is good child') cnt += 1 print(cnt) # size = 30 # inf = 1000 # town = [[inf for j in range(size)] for i in range(size)] # town[0][0] = 0 # for i in range(100): # for j in range(size): # for k in range(size): # for dy, dx in ((P, Q), (P, -Q), (-P, Q), (-P, -Q), (Q, P), (Q, -P), (-Q, P), (-Q, -P)): # if town[j][k] < inf and 0 <= j + dy < size and 0 <= k + dx < size: # town[j + dy][k + # dx] = min(town[j + dy][k + dx], town[j][k] + 1) # for i in range(size): # for j in range(size): # print((' ' + str(town[i][j]))[-2:], end=' ') # print()