結果
問題 | No.1724 [Cherry 3rd Tune A] Lápiz labial de Sonia |
ユーザー | McGregorsh |
提出日時 | 2022-07-26 10:52:00 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 971 ms / 2,000 ms |
コード長 | 1,742 bytes |
コンパイル時間 | 759 ms |
コンパイル使用メモリ | 86,828 KB |
実行使用メモリ | 157,424 KB |
最終ジャッジ日時 | 2023-09-23 03:28:58 |
合計ジャッジ時間 | 30,325 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 254 ms
92,440 KB |
testcase_01 | AC | 252 ms
92,176 KB |
testcase_02 | AC | 247 ms
92,312 KB |
testcase_03 | AC | 248 ms
92,356 KB |
testcase_04 | AC | 256 ms
92,344 KB |
testcase_05 | AC | 251 ms
92,072 KB |
testcase_06 | AC | 252 ms
92,148 KB |
testcase_07 | AC | 249 ms
92,332 KB |
testcase_08 | AC | 252 ms
92,264 KB |
testcase_09 | AC | 251 ms
92,128 KB |
testcase_10 | AC | 251 ms
92,352 KB |
testcase_11 | AC | 251 ms
93,096 KB |
testcase_12 | AC | 254 ms
92,456 KB |
testcase_13 | AC | 253 ms
93,036 KB |
testcase_14 | AC | 256 ms
92,980 KB |
testcase_15 | AC | 249 ms
92,340 KB |
testcase_16 | AC | 561 ms
124,040 KB |
testcase_17 | AC | 951 ms
156,708 KB |
testcase_18 | AC | 720 ms
135,152 KB |
testcase_19 | AC | 413 ms
109,368 KB |
testcase_20 | AC | 439 ms
112,296 KB |
testcase_21 | AC | 969 ms
157,324 KB |
testcase_22 | AC | 951 ms
157,240 KB |
testcase_23 | AC | 964 ms
157,192 KB |
testcase_24 | AC | 964 ms
156,980 KB |
testcase_25 | AC | 964 ms
157,296 KB |
testcase_26 | AC | 970 ms
157,132 KB |
testcase_27 | AC | 967 ms
157,120 KB |
testcase_28 | AC | 971 ms
157,392 KB |
testcase_29 | AC | 955 ms
157,400 KB |
testcase_30 | AC | 955 ms
157,424 KB |
testcase_31 | AC | 944 ms
156,884 KB |
testcase_32 | AC | 548 ms
157,160 KB |
testcase_33 | AC | 550 ms
157,276 KB |
testcase_34 | AC | 576 ms
157,160 KB |
testcase_35 | AC | 575 ms
157,360 KB |
testcase_36 | AC | 249 ms
92,396 KB |
testcase_37 | AC | 247 ms
92,544 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() lines = [] for i in range(n): num = a[i] - b[i] lines.append([num, i]) lines.sort(reverse=True) ans = [0] * n cou = 0 for i in range(n): score, point = lines[i] if cou < k: ans[point] = 'A' cou += 1 else: ans[point] = 'B' print(''.join(ans)) if __name__ == '__main__': main()