結果
問題 | No.628 Tagの勢い |
ユーザー | McGregorsh |
提出日時 | 2023-04-11 22:31:39 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 182 ms / 2,000 ms |
コード長 | 1,749 bytes |
コンパイル時間 | 287 ms |
コンパイル使用メモリ | 82,440 KB |
実行使用メモリ | 91,328 KB |
最終ジャッジ日時 | 2024-10-07 17:37:21 |
合計ジャッジ時間 | 4,027 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 131 ms
89,112 KB |
testcase_01 | AC | 139 ms
89,544 KB |
testcase_02 | AC | 144 ms
89,248 KB |
testcase_03 | AC | 132 ms
89,344 KB |
testcase_04 | AC | 138 ms
89,168 KB |
testcase_05 | AC | 135 ms
89,396 KB |
testcase_06 | AC | 131 ms
89,124 KB |
testcase_07 | AC | 132 ms
89,412 KB |
testcase_08 | AC | 132 ms
89,088 KB |
testcase_09 | AC | 131 ms
89,332 KB |
testcase_10 | AC | 141 ms
89,332 KB |
testcase_11 | AC | 139 ms
89,216 KB |
testcase_12 | AC | 164 ms
90,216 KB |
testcase_13 | AC | 160 ms
90,328 KB |
testcase_14 | AC | 162 ms
90,380 KB |
testcase_15 | AC | 169 ms
90,384 KB |
testcase_16 | AC | 182 ms
91,328 KB |
testcase_17 | AC | 131 ms
89,052 KB |
testcase_18 | AC | 130 ms
89,384 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 = int(input()) cou = defaultdict(int) for i in range(N): s = int(input()) a, b = i_map() c = s_list() for j in range(a): cou[c[j]] += b ans = [] for key, value in cou.items(): ans.append([-value, key]) ans.sort(key=lambda x:(x[0], x[1])) for i in range(min(10, len(ans))): ans[i][0] *= -1 print(*ans[i][::-1]) if __name__ == '__main__': main()