結果
問題 | No.112 ややこしい鶴亀算 |
ユーザー | McGregorsh |
提出日時 | 2023-05-11 22:05:02 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 219 ms / 5,000 ms |
コード長 | 1,662 bytes |
コンパイル時間 | 330 ms |
コンパイル使用メモリ | 87,040 KB |
実行使用メモリ | 92,572 KB |
最終ジャッジ日時 | 2023-08-18 12:54:12 |
合計ジャッジ時間 | 7,010 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 209 ms
92,396 KB |
testcase_01 | AC | 209 ms
92,040 KB |
testcase_02 | AC | 207 ms
92,152 KB |
testcase_03 | AC | 207 ms
92,572 KB |
testcase_04 | AC | 206 ms
92,300 KB |
testcase_05 | AC | 205 ms
92,056 KB |
testcase_06 | AC | 202 ms
92,072 KB |
testcase_07 | AC | 203 ms
92,288 KB |
testcase_08 | AC | 219 ms
92,236 KB |
testcase_09 | AC | 210 ms
92,292 KB |
testcase_10 | AC | 209 ms
92,144 KB |
testcase_11 | AC | 208 ms
92,444 KB |
testcase_12 | AC | 209 ms
92,140 KB |
testcase_13 | AC | 217 ms
92,288 KB |
testcase_14 | AC | 206 ms
92,140 KB |
testcase_15 | AC | 211 ms
92,292 KB |
testcase_16 | AC | 212 ms
92,368 KB |
testcase_17 | AC | 216 ms
92,228 KB |
testcase_18 | AC | 209 ms
92,160 KB |
testcase_19 | AC | 214 ms
92,316 KB |
testcase_20 | AC | 210 ms
92,104 KB |
testcase_21 | AC | 215 ms
92,112 KB |
testcase_22 | AC | 217 ms
92,168 KB |
testcase_23 | AC | 200 ms
92,288 KB |
testcase_24 | AC | 206 ms
92,332 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()) A = i_list() if len(set(A)) == 2: C = Counter(A) CC = [] for key, value in C.items(): CC.append([key, value]) CC.sort() print(CC[1][1], CC[0][1]) else: if A[0] == (N-1) * 2: print(N, 0) else: print(0, N) if __name__ == '__main__': main()