結果

問題 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
権限があれば一括ダウンロードができます

ソースコード

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

from copy import deepcopy, copy
import sys
import io
from typing import Optional
import time
from random import randrange, randint, random, uniform
import sys, io
from collections import deque, defaultdict
import heapq
from collections import Counter
import math
from math import gcd
from functools import lru_cache
from itertools import combinations, permutations
from bisect import bisect_left, bisect_right
from itertools import groupby
from itertools import accumulate
from math import factorial
import decimal
import 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 = False
for t in T:
    if t % t0 != 0:
        is_ok = True
if 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")
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0