結果
問題 | No.261 ぐるぐるぐるぐる!あみだくじ! |
ユーザー | maspy |
提出日時 | 2020-05-05 02:08:39 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 50 ms / 5,000 ms |
コード長 | 2,402 bytes |
コンパイル時間 | 157 ms |
コンパイル使用メモリ | 11,160 KB |
実行使用メモリ | 8,872 KB |
最終ジャッジ日時 | 2023-09-07 20:37:55 |
合計ジャッジ時間 | 3,457 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 19 ms
8,572 KB |
testcase_01 | AC | 19 ms
8,744 KB |
testcase_02 | AC | 17 ms
8,548 KB |
testcase_03 | AC | 45 ms
8,780 KB |
testcase_04 | AC | 20 ms
8,612 KB |
testcase_05 | AC | 19 ms
8,760 KB |
testcase_06 | AC | 41 ms
8,760 KB |
testcase_07 | AC | 41 ms
8,724 KB |
testcase_08 | AC | 20 ms
8,792 KB |
testcase_09 | AC | 22 ms
8,700 KB |
testcase_10 | AC | 20 ms
8,808 KB |
testcase_11 | AC | 19 ms
8,792 KB |
testcase_12 | AC | 26 ms
8,732 KB |
testcase_13 | AC | 23 ms
8,600 KB |
testcase_14 | AC | 49 ms
8,624 KB |
testcase_15 | AC | 44 ms
8,856 KB |
testcase_16 | AC | 39 ms
8,752 KB |
testcase_17 | AC | 44 ms
8,752 KB |
testcase_18 | AC | 39 ms
8,824 KB |
testcase_19 | AC | 41 ms
8,872 KB |
testcase_20 | AC | 43 ms
8,812 KB |
testcase_21 | AC | 49 ms
8,844 KB |
testcase_22 | AC | 40 ms
8,760 KB |
testcase_23 | AC | 46 ms
8,600 KB |
testcase_24 | AC | 40 ms
8,764 KB |
testcase_25 | AC | 47 ms
8,624 KB |
testcase_26 | AC | 44 ms
8,800 KB |
testcase_27 | AC | 47 ms
8,628 KB |
testcase_28 | AC | 44 ms
8,824 KB |
testcase_29 | AC | 44 ms
8,816 KB |
testcase_30 | AC | 50 ms
8,780 KB |
testcase_31 | AC | 47 ms
8,744 KB |
testcase_32 | AC | 41 ms
8,640 KB |
testcase_33 | AC | 49 ms
8,692 KB |
testcase_34 | AC | 45 ms
8,716 KB |
testcase_35 | AC | 40 ms
8,828 KB |
testcase_36 | AC | 39 ms
8,684 KB |
testcase_37 | AC | 40 ms
8,700 KB |
testcase_38 | AC | 46 ms
8,596 KB |
testcase_39 | AC | 46 ms
8,556 KB |
ソースコード
import sys import itertools from math import gcd read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines N = int(readline()) K = int(readline()) XY = tuple(tuple(map(int, readline().split())) for _ in range(K)) Q = int(readline()) P = list(range(N+1)) for x, y in XY: P[x], P[y] = P[y], P[x] period = [[] for _ in range(N+1)] for i in range(N+1): A = [i] j = i while True: j = P[j] if j == i: break A.append(j) period[i] = A def solve(A): Y = [] X = [] for i, x in enumerate(itertools.chain([0], A)): if x not in period[i]: return -1 Y.append(len(period[i])) X.append(period[i].index(x)) def to_coprime_case(D1, A1, D2, A2): """ x=A1 mod D1, x=A2 mod D2. iff x=A1' mod D1', x=A2' mod D2'""" D = gcd(D1, D2) if A1 % D != A2 % D: return None A = D2 // D D2 = A while True: g = gcd(D, A) if g == 1: break D //= g D2 *= g D1 //= gcd(D1, D2) A1 %= D1 A2 %= D2 return D1, A1 % D1, D2, A2 % D2 def extgcd(a, b): s = a sx = 1 sy = 0 t = b tx = 0 ty = 1 while t: q, r = divmod(s, t) s, sx, sy, t, tx, ty = t, tx, ty, r, sx - tx * q, sy - ty * q return sx, sy def Garner(D, A, MOD): N = len(D) coefs = [0] * N for i in range(N): mod = D[i] prod = 1 num = A[i] for j, x in enumerate(D[:i]): num -= coefs[j] * prod prod *= x prod %= mod x, _ = extgcd(prod, mod) coefs[i] = x * num % mod ret = 0 prod = 1 for c, mod in zip(coefs, D): ret += prod * c prod *= mod prod %= MOD return ret % MOD for i, j in itertools.combinations(range(N), 2): ret = to_coprime_case(Y[i], X[i], Y[j], X[j]) if ret is None: return -1 else: Y[i], X[i], Y[j], X[j] = ret X = [(x - 1) % y for x, y in zip(X, Y)] x = Garner(Y, X, 10**19) x += 1 return x for query in readlines(): A = map(int, query.split()) print(solve(A))