結果
問題 | No.1544 [Cherry 2nd Tune C] Synchroscope |
ユーザー | McGregorsh |
提出日時 | 2023-05-12 12:59:03 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 908 ms / 2,000 ms |
コード長 | 1,512 bytes |
コンパイル時間 | 726 ms |
コンパイル使用メモリ | 86,740 KB |
実行使用メモリ | 93,448 KB |
最終ジャッジ日時 | 2023-08-18 22:46:59 |
合計ジャッジ時間 | 22,695 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 197 ms
92,336 KB |
testcase_01 | AC | 829 ms
92,536 KB |
testcase_02 | AC | 199 ms
92,392 KB |
testcase_03 | AC | 210 ms
93,004 KB |
testcase_04 | AC | 206 ms
93,184 KB |
testcase_05 | AC | 201 ms
93,180 KB |
testcase_06 | AC | 205 ms
93,112 KB |
testcase_07 | AC | 206 ms
92,924 KB |
testcase_08 | AC | 207 ms
93,184 KB |
testcase_09 | AC | 263 ms
92,920 KB |
testcase_10 | AC | 203 ms
93,048 KB |
testcase_11 | AC | 204 ms
93,092 KB |
testcase_12 | AC | 208 ms
93,300 KB |
testcase_13 | AC | 217 ms
93,176 KB |
testcase_14 | AC | 212 ms
92,968 KB |
testcase_15 | AC | 204 ms
93,064 KB |
testcase_16 | AC | 212 ms
93,192 KB |
testcase_17 | AC | 204 ms
93,056 KB |
testcase_18 | AC | 197 ms
93,064 KB |
testcase_19 | AC | 208 ms
93,360 KB |
testcase_20 | AC | 211 ms
93,404 KB |
testcase_21 | AC | 206 ms
93,112 KB |
testcase_22 | AC | 202 ms
93,060 KB |
testcase_23 | AC | 208 ms
93,172 KB |
testcase_24 | AC | 204 ms
93,332 KB |
testcase_25 | AC | 209 ms
93,108 KB |
testcase_26 | AC | 210 ms
93,136 KB |
testcase_27 | AC | 210 ms
93,168 KB |
testcase_28 | AC | 208 ms
92,900 KB |
testcase_29 | AC | 210 ms
93,120 KB |
testcase_30 | AC | 210 ms
93,448 KB |
testcase_31 | AC | 202 ms
93,040 KB |
testcase_32 | AC | 213 ms
93,080 KB |
testcase_33 | AC | 816 ms
93,040 KB |
testcase_34 | AC | 204 ms
92,356 KB |
testcase_35 | AC | 839 ms
92,584 KB |
testcase_36 | AC | 209 ms
93,088 KB |
testcase_37 | AC | 831 ms
92,900 KB |
testcase_38 | AC | 810 ms
93,364 KB |
testcase_39 | AC | 848 ms
93,212 KB |
testcase_40 | AC | 837 ms
93,168 KB |
testcase_41 | AC | 839 ms
93,052 KB |
testcase_42 | AC | 908 ms
93,068 KB |
testcase_43 | AC | 795 ms
92,904 KB |
testcase_44 | AC | 803 ms
93,048 KB |
testcase_45 | AC | 829 ms
93,180 KB |
testcase_46 | AC | 824 ms
93,388 KB |
testcase_47 | AC | 834 ms
93,068 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): N, M = i_map() A = i_list() B = i_list() for i in range(5000*5000): if A[i%N] == B[i%M]: print(i+1) exit() print(-1) if __name__ == '__main__': main()