結果

問題 No.2307 [Cherry 5 th Tune *] Cool 46
ユーザー とろちゃとろちゃ
提出日時 2023-05-19 22:37:59
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 1,793 bytes
コンパイル時間 523 ms
コンパイル使用メモリ 81,920 KB
実行使用メモリ 147,048 KB
最終ジャッジ日時 2024-12-21 03:22:47
合計ジャッジ時間 30,585 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 11 WA * 35
権限があれば一括ダウンロードができます

ソースコード

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

# import pypyjit;pypyjit.set_param("max_unroll_recursion=-1")
# from bisect import *
# from collections import *
# from heapq import *
# from itertools import *
# from math import *
# from datetime import *
# from decimal import*
# from string import ascii_lowercase,ascii_uppercase
# import numpy as np
import sys
import os
# sys.setrecursionlimit(10**6)
INF = 10**18
MOD = 998244353
# MOD = 10**9 + 7
File = open("input.txt", "r") if os.path.exists("input.txt") else sys.stdin
def input():
return File.readline()[:-1]
# ///////////////////////////////////////////////////////////////////////////
T = int(input())
def f(l, s):
res = 0
flag = [0] * (len(l) + 1)
for i in range(len(l)):
if l[i] in s:
flag[i] = 1
res += 1
return flag, res
for _ in range(T):
N, M = map(int, input().split())
A = list(map(int, input().split()))
As = set(A)
B = list(map(int, input().split()))
Bs = set(B)
if len(A) == 0 or len(B) == 0:
print("Yes")
print(*["Red " + str(i) for i in A], sep="\n") if len(A) else print(
*["Blue " + str(i) for i in B], sep="\n"
)
continue
flagA, cnt1 = f(A, Bs)
flagB, cnt2 = f(B, As)
if cnt1 == 0 or cnt2 == 0:
print("No")
continue
print("Yes")
for i in range(N):
if not flagA[i]:
print("Red", A[i])
parity = 1
for i in range(N):
if flagA[i]:
if parity:
print("Red", A[i])
print("Blue", A[i])
else:
print("Blue", A[i])
print("Red", A[i])
parity ^= 1
if i == 1:
for j in range(M):
if not flagB[j]:
print("Blue", B[j])
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0