結果
問題 | No.1724 [Cherry 3rd Tune A] Lápiz labial de Sonia |
ユーザー | McGregorsh |
提出日時 | 2022-07-26 10:07:50 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,120 bytes |
コンパイル時間 | 676 ms |
コンパイル使用メモリ | 86,984 KB |
実行使用メモリ | 162,600 KB |
最終ジャッジ日時 | 2023-09-23 02:41:03 |
合計ジャッジ時間 | 46,226 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 240 ms
92,492 KB |
testcase_01 | AC | 241 ms
92,428 KB |
testcase_02 | WA | - |
testcase_03 | AC | 243 ms
92,492 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | AC | 1,691 ms
161,972 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | AC | 240 ms
92,564 KB |
testcase_37 | AC | 240 ms
92,552 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 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() a = i_list() b = i_list() ab = [] for i in range(n): ab.append([a[i], 0, i]) ab.append([b[i], 1, i]) ab.sort(reverse=True) juge = [False] * n ans = [0] * n cou_a = 0 cou_b = 0 for i in range(n*2): score, color, point = ab[i] if juge[point] == False: if cou_a == k: ans[point] = 'B' juge[point] = True continue if cou_b == n - k: ans[point] = 'A' juge[point] = True continue if color == 0: ans[point] = 'A' cou_a += 1 else: ans[point] = 'B' cou_b += 1 juge[point] = True print(''.join(ans)) if __name__ == '__main__': main()