結果
| 問題 |
No.2307 [Cherry 5 th Tune *] Cool 46
|
| コンテスト | |
| ユーザー |
mkawa2
|
| 提出日時 | 2023-05-19 21:44:55 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 1,771 bytes |
| コンパイル時間 | 675 ms |
| コンパイル使用メモリ | 82,304 KB |
| 実行使用メモリ | 145,184 KB |
| 最終ジャッジ日時 | 2024-12-21 02:11:37 |
| 合計ジャッジ時間 | 31,830 ms |
|
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| other | AC * 21 WA * 25 |
ソースコード
import sys
# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
md = 10**9+7
# md = 998244353
def solve():
def trim(aa):
naa = []
for a in aa:
if a in ss: continue
naa.append(a)
return naa
n, m = LI()
aa = LI()
bb = LI()
ss = set(aa) & set(bb)
aa = trim(aa)
bb = trim(bb)
if aa and bb and not ss:
print("No")
return
print("Yes")
if not bb:
for a in aa: print("Red", a)
s, t = "Red", "Blue"
for a in ss:
print(s, a)
print(t, a)
s, t = t, s
elif not aa:
for a in bb: print("Blue", a)
t, s = "Red", "Blue"
for a in ss:
print(s, a)
print(t, a)
s, t = t, s
else:
if len(ss) & 1 == 0:
a = ss.pop()
aa.append(a)
bb.append(a)
for a in aa: print("Red", a)
s, t = "Red", "Blue"
for a in ss:
print(s, a)
print(t, a)
s, t = t, s
for a in bb: print("Blue", a)
for _ in range(II()): solve()
mkawa2