結果
問題 | No.1692 Expectations |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 15:17:10 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 324 ms / 2,000 ms |
コード長 | 1,538 bytes |
コンパイル時間 | 351 ms |
コンパイル使用メモリ | 86,784 KB |
実行使用メモリ | 156,952 KB |
最終ジャッジ日時 | 2023-08-17 20:26:51 |
合計ジャッジ時間 | 7,580 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 248 ms
92,352 KB |
testcase_01 | AC | 238 ms
92,368 KB |
testcase_02 | AC | 246 ms
92,504 KB |
testcase_03 | AC | 246 ms
92,308 KB |
testcase_04 | AC | 246 ms
92,280 KB |
testcase_05 | AC | 243 ms
92,352 KB |
testcase_06 | AC | 243 ms
92,204 KB |
testcase_07 | AC | 250 ms
92,364 KB |
testcase_08 | AC | 249 ms
92,384 KB |
testcase_09 | AC | 241 ms
92,280 KB |
testcase_10 | AC | 277 ms
119,688 KB |
testcase_11 | AC | 281 ms
119,624 KB |
testcase_12 | AC | 244 ms
92,408 KB |
testcase_13 | AC | 245 ms
92,396 KB |
testcase_14 | AC | 248 ms
94,160 KB |
testcase_15 | AC | 298 ms
135,660 KB |
testcase_16 | AC | 248 ms
94,424 KB |
testcase_17 | AC | 274 ms
114,596 KB |
testcase_18 | AC | 252 ms
99,300 KB |
testcase_19 | AC | 311 ms
131,528 KB |
testcase_20 | AC | 293 ms
145,064 KB |
testcase_21 | AC | 324 ms
156,952 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, M = i_map() A = i_list() if N == M: if len(set(A)) == 1: print(len(set(A)), 1) else: print(len(set(A)), 0) else: print(len(set(A)), 0) if __name__ == '__main__': main()