結果

問題 No.2307 [Cherry 5 th Tune *] Cool 46
ユーザー McGregorshMcGregorsh
提出日時 2023-05-30 14:11:18
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,517 bytes
コンパイル時間 773 ms
コンパイル使用メモリ 81,920 KB
実行使用メモリ 139,136 KB
最終ジャッジ日時 2024-12-28 11:50:54
合計ジャッジ時間 35,517 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 21 WA * 25
権限があれば一括ダウンロードができます

ソースコード

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, lru_cache
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
alpa = 'abcdefghijklmnopqrstuvwxyz'
ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
#input = sys.stdin.readline


def main():
   
   T = int(input())
   
   for i in range(T):
   	  N, M = i_map()
   	  A = i_list()
   	  B = i_list()
   	  CA = Counter(A)
   	  CB = Counter(B)
   	  juge = False
   	  if N == 0 or M == 0:
   	  	  juge = True
   	  nums = []
   	  for key, value in CB.items():
   	  	  if CA[key] > 0:
   	  	  	  juge = True
   	  	  	  p = min(value, CA[key])
   	  	  	  nums.append([p, key])
   	  	  	  CA[key] -= p
   	  	  	  CB[key] -= p
   	  if juge:
   	  	  print('Yes')
   	  	  for key, value in CA.items():
   	  	  	  for j in range(value):
   	  	  	  	  print('Red', key)
   	  	  flag = True
   	  	  for k in range(len(nums)):
   	  	  	  a, b = nums[k]
   	  	  	  for l in range(a):
   	  	  	  	  if flag:
   	  	  	  	  	  print('Red', b)
   	  	  	  	  	  print('Blue', b)
   	  	  	  	  else:
   	  	  	  	  	  print('Blue', b)
   	  	  	  	  	  print('Red', b)
   	  	  	  	  flag = not flag
   	  	  for key, value in CB.items():
   	  	  	  for m in range(value):
   	  	  	  	  print('Blue', key)
   	  else:
   	  	  print('No')
   	  
   
   
if __name__ == '__main__':
    main()
0