結果

問題 No.2307 [Cherry 5 th Tune *] Cool 46
ユーザー McGregorshMcGregorsh
提出日時 2023-05-30 14:11:18
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,517 bytes
コンパイル時間 337 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 139,264 KB
最終ジャッジ日時 2024-06-08 20:09:41
合計ジャッジ時間 34,149 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 146 ms
89,216 KB
testcase_01 AC 146 ms
89,344 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 315 ms
110,848 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 AC 304 ms
123,136 KB
testcase_19 WA -
testcase_20 AC 335 ms
125,256 KB
testcase_21 AC 361 ms
126,680 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 331 ms
125,260 KB
testcase_28 WA -
testcase_29 AC 336 ms
123,780 KB
testcase_30 WA -
testcase_31 AC 332 ms
125,012 KB
testcase_32 WA -
testcase_33 AC 304 ms
123,880 KB
testcase_34 AC 346 ms
125,840 KB
testcase_35 AC 387 ms
135,424 KB
testcase_36 WA -
testcase_37 AC 346 ms
127,616 KB
testcase_38 AC 696 ms
91,392 KB
testcase_39 AC 868 ms
93,824 KB
testcase_40 AC 330 ms
90,880 KB
testcase_41 AC 377 ms
92,800 KB
testcase_42 AC 376 ms
138,240 KB
testcase_43 AC 365 ms
137,856 KB
testcase_44 AC 302 ms
139,264 KB
testcase_45 AC 298 ms
138,752 KB
権限があれば一括ダウンロードができます

ソースコード

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