結果
問題 | No.1544 [Cherry 2nd Tune C] Synchroscope |
ユーザー | mkawa2 |
提出日時 | 2021-06-11 21:43:12 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 1,843 ms / 2,000 ms |
コード長 | 2,097 bytes |
コンパイル時間 | 552 ms |
コンパイル使用メモリ | 87,168 KB |
実行使用メモリ | 84,244 KB |
最終ジャッジ日時 | 2023-08-21 11:59:54 |
合計ジャッジ時間 | 12,834 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 169 ms
80,988 KB |
testcase_01 | AC | 166 ms
80,900 KB |
testcase_02 | AC | 167 ms
80,952 KB |
testcase_03 | AC | 232 ms
83,184 KB |
testcase_04 | AC | 192 ms
83,352 KB |
testcase_05 | AC | 191 ms
83,116 KB |
testcase_06 | AC | 197 ms
83,468 KB |
testcase_07 | AC | 193 ms
83,488 KB |
testcase_08 | AC | 185 ms
83,288 KB |
testcase_09 | AC | 179 ms
82,864 KB |
testcase_10 | AC | 194 ms
83,352 KB |
testcase_11 | AC | 191 ms
83,360 KB |
testcase_12 | AC | 185 ms
83,172 KB |
testcase_13 | AC | 173 ms
82,832 KB |
testcase_14 | AC | 192 ms
83,716 KB |
testcase_15 | AC | 198 ms
83,776 KB |
testcase_16 | AC | 184 ms
83,356 KB |
testcase_17 | AC | 184 ms
83,460 KB |
testcase_18 | AC | 179 ms
82,144 KB |
testcase_19 | AC | 171 ms
81,856 KB |
testcase_20 | AC | 191 ms
83,508 KB |
testcase_21 | AC | 178 ms
82,900 KB |
testcase_22 | AC | 178 ms
83,040 KB |
testcase_23 | AC | 197 ms
83,696 KB |
testcase_24 | AC | 199 ms
83,740 KB |
testcase_25 | AC | 200 ms
83,696 KB |
testcase_26 | AC | 198 ms
83,680 KB |
testcase_27 | AC | 204 ms
84,244 KB |
testcase_28 | AC | 195 ms
83,540 KB |
testcase_29 | AC | 201 ms
83,524 KB |
testcase_30 | AC | 195 ms
83,496 KB |
testcase_31 | AC | 199 ms
83,688 KB |
testcase_32 | AC | 198 ms
83,600 KB |
testcase_33 | AC | 1,843 ms
83,448 KB |
testcase_34 | AC | 172 ms
80,880 KB |
testcase_35 | AC | 173 ms
80,908 KB |
testcase_36 | AC | 173 ms
82,192 KB |
testcase_37 | AC | 170 ms
81,836 KB |
testcase_38 | AC | 177 ms
83,564 KB |
testcase_39 | AC | 178 ms
83,584 KB |
testcase_40 | AC | 178 ms
83,372 KB |
testcase_41 | AC | 181 ms
83,320 KB |
testcase_42 | AC | 179 ms
83,568 KB |
testcase_43 | AC | 181 ms
83,372 KB |
testcase_44 | AC | 180 ms
83,352 KB |
testcase_45 | AC | 178 ms
83,664 KB |
testcase_46 | AC | 177 ms
83,496 KB |
testcase_47 | AC | 177 ms
83,396 KB |
ソースコード
import sys sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.buffer.readline()) def LI(): return list(map(int, sys.stdin.buffer.readline().split())) def LI1(): return list(map(int1, sys.stdin.buffer.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def BI(): return sys.stdin.buffer.readline().rstrip() def SI(): return sys.stdin.buffer.readline().rstrip().decode() 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 = 10**16 # md = 998244353 # md = 10**9+7 from math import gcd from collections import defaultdict import typing def inv_gcd(a, b): a %= b if a == 0: return b, 0 s, t = b, a m0, m1 = 0, 1 while t: u = s//t s -= t*u m0 -= m1*u s, t = t, s m0, m1 = m1, m0 if m0 < 0: m0 += b//s return s, m0 # 複数の「mで割ったらr余る」という条件を満たすxをmod zで返す # 返り値 x,z(解なしの場合は0,0) def crt(r: typing.List[int], m: typing.List[int]) -> typing.Tuple[int, int]: assert len(r) == len(m) n = len(r) r0, m0 = 0, 1 for i in range(n): assert 1 <= m[i] r1 = r[i]%m[i] m1 = m[i] if m0 < m1: r0, r1 = r1, r0 m0, m1 = m1, m0 if m0%m1 == 0: if r0%m1 != r1: return 0, 0 continue g, im = inv_gcd(m0, m1) u1 = m1//g if (r1-r0)%g: return 0, 0 x = (r1-r0)//g%u1*im%u1 r0 += x*m0 m0 *= u1 if r0 < 0: r0 += m0 return r0, m0 def topos(aa): res = defaultdict(list) for i, a in enumerate(aa): res[a].append(i) return res n, m = LI() aa = LI() bb = LI() pos = topos(bb) ans = inf for i, a in enumerate(aa): for j in pos[a]: x, z = crt([i, j], [n, m]) if z == 0: continue ans = min(ans, x+1) if ans == inf: ans = -1 print(ans)