結果
問題 | No.2042 RGB Caps |
ユーザー | McGregorsh |
提出日時 | 2022-08-19 22:46:46 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,084 bytes |
コンパイル時間 | 181 ms |
コンパイル使用メモリ | 82,488 KB |
実行使用メモリ | 114,048 KB |
最終ジャッジ日時 | 2024-04-17 01:24:40 |
合計ジャッジ時間 | 7,371 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 146 ms
89,344 KB |
testcase_01 | WA | - |
testcase_02 | AC | 151 ms
89,216 KB |
testcase_03 | AC | 149 ms
89,476 KB |
testcase_04 | AC | 152 ms
89,164 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 283 ms
96,128 KB |
testcase_08 | AC | 408 ms
104,832 KB |
testcase_09 | AC | 213 ms
91,776 KB |
testcase_10 | AC | 550 ms
111,240 KB |
testcase_11 | AC | 201 ms
91,392 KB |
testcase_12 | AC | 591 ms
113,920 KB |
testcase_13 | AC | 587 ms
113,920 KB |
testcase_14 | AC | 599 ms
114,048 KB |
testcase_15 | AC | 148 ms
89,392 KB |
testcase_16 | WA | - |
testcase_17 | AC | 208 ms
91,008 KB |
ソースコード
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 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 ###関数コピーしたか?### def main(): n, k = i_map() nums = [] for i in range(k): a, b = input().split() a = int(a) nums.append([a, b]) nums.sort() R = 0 G = 0 B = 0 ans = [] now = 0 for i in range(k): point, color = nums[i] cost = point - now now = point for j in range(cost): if R == G and G == B: if color == 'R': R += 1 ans.append('R') elif color == 'G': G += 1 ans.append('G') elif color == 'B': B += 1 ans.append('B') elif R == G and G < B: if color == 'R': R += 1 ans.append('R') elif color == 'G': G += 1 ans.append('G') elif color == 'B': R += 1 ans.append('R') elif R == G and G > B: B += 1 ans.append('B') elif R > G and G == B: if color == 'R': B += 1 ans.append('B') elif color == 'G': G += 1 ans.append('G') elif color == 'B': B += 1 ans.append('B') elif R > G and G < B: G += 1 ans.append('G') elif R < G and G == B: R += 1 ans.append('R') elif R < G and G > B: if color == 'R': R += 1 ans.append('R') elif color == 'G': R += 1 ans.append('R') elif color == 'B': B += 1 ans.append('B') print(''.join(ans)) if __name__ == '__main__': main()