#870426 (PyPy3) No.2307 [Cherry 5 th Tune *] Cool 46

• 問題: No.2307 [Cherry 5 th Tune *] Cool 46
• ユーザー: FromBooska
• 提出日時: 2023-05-19 22:03:35
• 言語: PyPy3 (7.3.15)
• 結果: RE
• 実行時間: -
• コード長: 1,421 bytes
• コンパイル時間: 406 ms
• コンパイル使用メモリ: 82,048 KB
• 実行使用メモリ: 130,840 KB
• 最終ジャッジ日時: 2024-12-21 02:41:19
• 合計ジャッジ時間: 30,083 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

ファイルパターン	結果
other	AC * 6 RE * 40

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
# 貪欲法
T = int(input())
for t in range(T):
    N, M = map(int, input().split())
    A = set(map(int, input().split()))
    B = set(map(int, input().split()))
    A_solo = []
    A_double = []
    for a in A:
        if a in B:
            A_double.append(a)
        else:
            A_solo.append(a)
    B_solo = []
    B_double = []
    for b in B:
        if b in A:
            B_double.append(b)
        else:
            B_solo.append(b)
    #print(A_solo, A_double)
    #print(B_solo, B_double)
    if N == 0 and M == 0:
        print('Yes')
    elif N == 0:
        print('Yes')
        for b in B:
            print('Blue', b)
    elif M == 0:
        print('Yes')
        for a in A:
            print('Red', a)
    else:
        if len(A_double) == 0:
            print('No')
        else:
            print('Yes')
            A_double = sorted(list(A_double))
            B_double = sorted(list(B_double))
            for a in A_solo:
                print('Red', a)
            print('Red', A_double.pop())
            print('Blue', B_double.pop())
            for b in B_solo:
                print('Blue', b)
            while A_double and B_double:
                if i%2 == 0:
                    print('Blue', B_double.pop())
                    print('Red', A_double.pop())
                else:
                    print('Red', A_double.pop())
                    print('Blue', B_double.pop())
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX