結果
問題 | No.2153 何コーダーが何人? |
ユーザー | McGregorsh |
提出日時 | 2023-05-05 12:55:20 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 151 ms / 2,000 ms |
コード長 | 1,579 bytes |
コンパイル時間 | 275 ms |
コンパイル使用メモリ | 82,116 KB |
実行使用メモリ | 89,760 KB |
最終ジャッジ日時 | 2024-05-02 09:26:42 |
合計ジャッジ時間 | 4,131 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 140 ms
89,260 KB |
testcase_01 | AC | 148 ms
89,488 KB |
testcase_02 | AC | 140 ms
89,048 KB |
testcase_03 | AC | 142 ms
89,544 KB |
testcase_04 | AC | 142 ms
89,460 KB |
testcase_05 | AC | 141 ms
88,792 KB |
testcase_06 | AC | 146 ms
89,272 KB |
testcase_07 | AC | 147 ms
89,360 KB |
testcase_08 | AC | 141 ms
89,468 KB |
testcase_09 | AC | 145 ms
89,640 KB |
testcase_10 | AC | 145 ms
88,920 KB |
testcase_11 | AC | 150 ms
89,760 KB |
testcase_12 | AC | 143 ms
89,040 KB |
testcase_13 | AC | 144 ms
89,396 KB |
testcase_14 | AC | 146 ms
89,424 KB |
testcase_15 | AC | 142 ms
89,176 KB |
testcase_16 | AC | 148 ms
89,380 KB |
testcase_17 | AC | 144 ms
89,560 KB |
testcase_18 | AC | 151 ms
89,512 KB |
testcase_19 | AC | 139 ms
89,504 KB |
testcase_20 | AC | 141 ms
89,468 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()) juge = defaultdict(int) for i in range(N): s, a = s_map() juge[s] = int(a) ans = [0] * 8 for key, value in juge.items(): ans[value] += 1 for i in ans: print(i) if __name__ == '__main__': main()