結果
問題 | No.112 ややこしい鶴亀算 |
ユーザー | McGregorsh |
提出日時 | 2023-05-11 22:01:59 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,662 bytes |
コンパイル時間 | 310 ms |
コンパイル使用メモリ | 86,576 KB |
実行使用メモリ | 92,296 KB |
最終ジャッジ日時 | 2023-08-18 12:52:23 |
合計ジャッジ時間 | 7,694 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 233 ms
92,156 KB |
testcase_01 | AC | 237 ms
92,112 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | AC | 235 ms
92,004 KB |
testcase_05 | AC | 239 ms
92,096 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 233 ms
91,980 KB |
testcase_09 | AC | 234 ms
92,272 KB |
testcase_10 | WA | - |
testcase_11 | AC | 234 ms
91,880 KB |
testcase_12 | WA | - |
testcase_13 | AC | 232 ms
91,988 KB |
testcase_14 | AC | 239 ms
92,040 KB |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 238 ms
92,112 KB |
testcase_20 | AC | 236 ms
92,296 KB |
testcase_21 | WA | - |
testcase_22 | AC | 238 ms
91,992 KB |
testcase_23 | WA | - |
testcase_24 | AC | 233 ms
92,236 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[0][1], CC[1][1]) else: if A[0] == (N-1) * 2: print(N, 0) else: print(0, N) if __name__ == '__main__': main()