結果
問題 | No.447 ゆきこーだーの雨と雪 (2) |
ユーザー | McGregorsh |
提出日時 | 2022-10-28 09:22:16 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 359 ms / 2,000 ms |
コード長 | 2,721 bytes |
コンパイル時間 | 333 ms |
コンパイル使用メモリ | 87,208 KB |
実行使用メモリ | 98,824 KB |
最終ジャッジ日時 | 2023-09-19 02:57:01 |
合計ジャッジ時間 | 11,687 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 261 ms
92,960 KB |
testcase_01 | AC | 262 ms
93,056 KB |
testcase_02 | AC | 262 ms
93,044 KB |
testcase_03 | AC | 306 ms
95,248 KB |
testcase_04 | AC | 306 ms
95,460 KB |
testcase_05 | AC | 349 ms
97,928 KB |
testcase_06 | AC | 347 ms
97,556 KB |
testcase_07 | AC | 323 ms
95,888 KB |
testcase_08 | AC | 339 ms
97,680 KB |
testcase_09 | AC | 344 ms
98,768 KB |
testcase_10 | AC | 307 ms
95,668 KB |
testcase_11 | AC | 307 ms
95,744 KB |
testcase_12 | AC | 340 ms
96,988 KB |
testcase_13 | AC | 346 ms
97,748 KB |
testcase_14 | AC | 352 ms
98,748 KB |
testcase_15 | AC | 314 ms
95,648 KB |
testcase_16 | AC | 295 ms
95,076 KB |
testcase_17 | AC | 312 ms
95,572 KB |
testcase_18 | AC | 291 ms
94,200 KB |
testcase_19 | AC | 353 ms
97,764 KB |
testcase_20 | AC | 359 ms
98,824 KB |
testcase_21 | AC | 317 ms
95,536 KB |
testcase_22 | AC | 320 ms
95,892 KB |
testcase_23 | AC | 324 ms
95,688 KB |
testcase_24 | AC | 355 ms
97,592 KB |
testcase_25 | AC | 359 ms
98,092 KB |
testcase_26 | AC | 327 ms
95,812 KB |
testcase_27 | AC | 327 ms
95,744 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(): def score(x, rank): return int(50 * x + (50 * x / (0.8 + 0.2 * rank))) names = set() N = int(input()) L = i_list() T = int(input()) query = [] for i in range(T): name, p = s_map() names.add(name) query.append([name, p]) renum = defaultdict(int) mozi = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' for i in range(26): renum[mozi[i]] = i names = list(names) members = defaultdict(int) remembers = defaultdict(list) for i in range(len(names)): members[names[i]] = i remembers[i].append(names[i]) AC_num = [0] * N scores = [[0] * 26 for i in range(len(names))] last = [0] * len(names) for i in range(T): a, b = query[i] point = members[a] point1 = renum[b] AC_num[point1] += 1 point2 = AC_num[point1] cost = score(L[point1], point2) scores[point][point1] = cost last[point] = i ans = [] for i in range(len(names)): human = remembers[i][0] total = 0 for j in range(N): total += scores[i][j] ans.append([-total, last[i], human]) #print(ans) ans.sort(key=lambda x:(x[0], x[1])) for i in range(len(names)): lank = i+1 hu = ans[i][2] cost1 = -ans[i][0] point3 = members[hu] print(lank, hu, *scores[point3][:N], cost1) if __name__ == '__main__': main()