結果
問題 | No.2811 Calculation Within Sequence |
ユーザー |
![]() |
提出日時 | 2024-07-19 22:28:41 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,485 bytes |
コンパイル時間 | 322 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 143,140 KB |
最終ジャッジ日時 | 2024-07-19 22:28:55 |
合計ジャッジ時間 | 12,879 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 37 WA * 4 |
ソースコード
from copy import deepcopy, copyimport sysimport iofrom typing import Optionalimport timefrom random import randrange, randint, random, uniformimport sys, iofrom collections import deque, defaultdictimport heapqfrom collections import Counterimport mathfrom math import gcdfrom functools import lru_cachefrom itertools import combinations, permutationsfrom bisect import bisect_left, bisect_rightfrom itertools import groupbyfrom itertools import accumulatefrom math import factorialimport decimalimport math# from sortedcontainers import SortedList# import pypyjit# pypyjit.set_param("max_unroll_recursion=-1")sys.setrecursionlimit(1000000000)sys.set_int_max_str_digits(1000000000)start_time = time.time()A, B = map(int, input().split())T = [int(x) for x in input().split()]S = [int(x) for x in input().split()]T_odd = [x for x in T if x % 2 == 1]T_even = [x for x in T if x % 2 == 0]S_odd = [x for x in S if x % 2 == 1]S_even = [x for x in S if x % 2 == 0]if 1 in T:print("Yes")exit()if len(T) == 1:t = T[0]for s in S:if s % t != 0:print("No")exit()print("Yes")exit()T = sorted(T)t0 = T[0]is_ok = Falsefor t in T:if t % t0 != 0:is_ok = Trueif not is_ok:for s in S:if s % t0 != 0:print("No")exit()print("Yes")exit()if len(T_odd) == 0 and len(S_odd) > 0:print("No")exit()print("Yes")