結果
問題 | No.2042 RGB Caps |
ユーザー | McGregorsh |
提出日時 | 2022-08-19 22:49:40 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 552 ms / 2,000 ms |
コード長 | 3,130 bytes |
コンパイル時間 | 160 ms |
コンパイル使用メモリ | 82,152 KB |
実行使用メモリ | 114,168 KB |
最終ジャッジ日時 | 2024-04-27 20:35:57 |
合計ジャッジ時間 | 6,289 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 140 ms
89,396 KB |
testcase_01 | AC | 144 ms
89,216 KB |
testcase_02 | AC | 141 ms
89,092 KB |
testcase_03 | AC | 139 ms
89,292 KB |
testcase_04 | AC | 139 ms
89,156 KB |
testcase_05 | AC | 142 ms
89,388 KB |
testcase_06 | AC | 149 ms
89,720 KB |
testcase_07 | AC | 271 ms
96,212 KB |
testcase_08 | AC | 389 ms
104,544 KB |
testcase_09 | AC | 205 ms
91,216 KB |
testcase_10 | AC | 497 ms
111,276 KB |
testcase_11 | AC | 187 ms
91,304 KB |
testcase_12 | AC | 552 ms
114,000 KB |
testcase_13 | AC | 543 ms
114,168 KB |
testcase_14 | AC | 544 ms
113,904 KB |
testcase_15 | AC | 139 ms
89,336 KB |
testcase_16 | AC | 259 ms
95,572 KB |
testcase_17 | AC | 195 ms
90,792 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') amari = n - now ans.extend('R' * amari) print(''.join(ans)) if __name__ == '__main__': main()