結果

問題 No.1544 [Cherry 2nd Tune C] Synchroscope
ユーザー McGregorshMcGregorsh
提出日時 2023-05-12 12:59:03
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 840 ms / 2,000 ms
コード長 1,512 bytes
コンパイル時間 241 ms
コンパイル使用メモリ 82,072 KB
実行使用メモリ 90,296 KB
最終ジャッジ日時 2024-11-28 08:58:51
合計ジャッジ時間 19,076 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 149 ms
89,088 KB
testcase_01 AC 840 ms
89,684 KB
testcase_02 AC 152 ms
89,472 KB
testcase_03 AC 154 ms
90,112 KB
testcase_04 AC 158 ms
89,856 KB
testcase_05 AC 156 ms
90,088 KB
testcase_06 AC 157 ms
90,296 KB
testcase_07 AC 159 ms
90,164 KB
testcase_08 AC 157 ms
89,912 KB
testcase_09 AC 152 ms
90,008 KB
testcase_10 AC 158 ms
89,768 KB
testcase_11 AC 157 ms
89,856 KB
testcase_12 AC 155 ms
89,620 KB
testcase_13 AC 153 ms
89,660 KB
testcase_14 AC 157 ms
89,880 KB
testcase_15 AC 156 ms
89,692 KB
testcase_16 AC 153 ms
90,252 KB
testcase_17 AC 156 ms
90,100 KB
testcase_18 AC 156 ms
89,856 KB
testcase_19 AC 156 ms
89,832 KB
testcase_20 AC 155 ms
90,112 KB
testcase_21 AC 154 ms
89,600 KB
testcase_22 AC 154 ms
90,088 KB
testcase_23 AC 155 ms
90,136 KB
testcase_24 AC 157 ms
90,248 KB
testcase_25 AC 155 ms
89,840 KB
testcase_26 AC 157 ms
89,856 KB
testcase_27 AC 155 ms
89,984 KB
testcase_28 AC 154 ms
89,968 KB
testcase_29 AC 157 ms
89,856 KB
testcase_30 AC 158 ms
89,572 KB
testcase_31 AC 155 ms
90,024 KB
testcase_32 AC 159 ms
89,892 KB
testcase_33 AC 826 ms
89,600 KB
testcase_34 AC 151 ms
89,088 KB
testcase_35 AC 825 ms
89,584 KB
testcase_36 AC 153 ms
89,856 KB
testcase_37 AC 826 ms
90,000 KB
testcase_38 AC 829 ms
89,984 KB
testcase_39 AC 828 ms
89,556 KB
testcase_40 AC 824 ms
89,856 KB
testcase_41 AC 827 ms
89,684 KB
testcase_42 AC 809 ms
90,028 KB
testcase_43 AC 782 ms
90,240 KB
testcase_44 AC 795 ms
89,932 KB
testcase_45 AC 818 ms
89,948 KB
testcase_46 AC 796 ms
89,856 KB
testcase_47 AC 808 ms
89,984 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0