結果
問題 | No.2148 ひとりUNO |
ユーザー | Theta |
提出日時 | 2022-12-05 18:55:20 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 267 ms / 2,000 ms |
コード長 | 2,003 bytes |
コンパイル時間 | 129 ms |
コンパイル使用メモリ | 12,800 KB |
実行使用メモリ | 11,008 KB |
最終ジャッジ日時 | 2024-04-20 18:54:11 |
合計ジャッジ時間 | 6,413 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 27 ms
11,008 KB |
testcase_01 | AC | 54 ms
10,880 KB |
testcase_02 | AC | 55 ms
10,880 KB |
testcase_03 | AC | 56 ms
10,880 KB |
testcase_04 | AC | 58 ms
10,880 KB |
testcase_05 | AC | 58 ms
10,880 KB |
testcase_06 | AC | 57 ms
11,008 KB |
testcase_07 | AC | 61 ms
10,880 KB |
testcase_08 | AC | 63 ms
10,880 KB |
testcase_09 | AC | 57 ms
11,008 KB |
testcase_10 | AC | 56 ms
10,880 KB |
testcase_11 | AC | 56 ms
11,008 KB |
testcase_12 | AC | 54 ms
10,880 KB |
testcase_13 | AC | 55 ms
10,880 KB |
testcase_14 | AC | 56 ms
11,008 KB |
testcase_15 | AC | 54 ms
10,880 KB |
testcase_16 | AC | 256 ms
10,880 KB |
testcase_17 | AC | 263 ms
10,880 KB |
testcase_18 | AC | 265 ms
10,880 KB |
testcase_19 | AC | 267 ms
10,880 KB |
testcase_20 | AC | 261 ms
11,008 KB |
testcase_21 | AC | 255 ms
11,008 KB |
testcase_22 | AC | 253 ms
10,880 KB |
testcase_23 | AC | 253 ms
10,880 KB |
testcase_24 | AC | 254 ms
11,008 KB |
testcase_25 | AC | 243 ms
10,880 KB |
testcase_26 | AC | 118 ms
11,008 KB |
testcase_27 | AC | 122 ms
10,880 KB |
testcase_28 | AC | 123 ms
11,008 KB |
testcase_29 | AC | 132 ms
10,880 KB |
testcase_30 | AC | 124 ms
10,880 KB |
testcase_31 | AC | 120 ms
10,880 KB |
testcase_32 | AC | 120 ms
10,880 KB |
testcase_33 | AC | 121 ms
10,880 KB |
testcase_34 | AC | 116 ms
11,008 KB |
testcase_35 | AC | 115 ms
10,880 KB |
testcase_36 | AC | 124 ms
11,008 KB |
testcase_37 | AC | 123 ms
11,008 KB |
testcase_38 | AC | 123 ms
11,008 KB |
testcase_39 | AC | 28 ms
10,880 KB |
ソースコード
def main(): for _ in range(int(input())): N = int(input()) cards = [list(input().split()) for _ in range(N)] r_cards = filter(lambda card: card[0] == "R", cards) g_cards = filter(lambda card: card[0] == "G", cards) b_cards = filter(lambda card: card[0] == "B", cards) r_nums = set(map(lambda card: int(card[1]), r_cards)) g_nums = set(map(lambda card: int(card[1]), g_cards)) b_nums = set(map(lambda card: int(card[1]), b_cards)) rg_common = r_nums & g_nums gb_common = g_nums & b_nums br_common = b_nums & r_nums if max(map(len, (r_nums, b_nums, g_nums))) == sum(map(len, (r_nums, b_nums, g_nums))): print("YES") continue if len(tuple(filter(lambda elm: len(elm) >= 2, (rg_common, gb_common, br_common)))) >= 2: print("YES") continue if max(map(len, (rg_common, gb_common, br_common))) >= 2: if sum(map(len, (rg_common, gb_common, br_common))) - max(map(len, (rg_common, gb_common, br_common))) > 0: print("YES") elif min(map(len, (r_nums, b_nums, g_nums))) == 0: print("YES") else: print("NO") continue if max(map(len, (rg_common, gb_common, br_common))) == 1: if sum(map(len, (rg_common, gb_common, br_common))) == 3: if rg_common & gb_common: if all(len(nums) > 1 for nums in (r_nums, g_nums, b_nums)): print("NO") else: print("YES") else: print("YES") elif sum(map(len, (rg_common, gb_common, br_common))) == 2: print("YES") elif min(map(len, (r_nums, b_nums, g_nums))) == 0: print("YES") else: print("NO") continue print("NO") if __name__ == "__main__": main()