結果
問題 | No.1692 Expectations |
ユーザー | cozy_sauna |
提出日時 | 2021-10-11 12:31:35 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 91 ms / 2,000 ms |
コード長 | 1,744 bytes |
コンパイル時間 | 98 ms |
コンパイル使用メモリ | 11,156 KB |
実行使用メモリ | 33,596 KB |
最終ジャッジ日時 | 2023-10-13 13:23:40 |
合計ジャッジ時間 | 3,558 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 21 ms
9,540 KB |
testcase_01 | AC | 21 ms
9,668 KB |
testcase_02 | AC | 21 ms
9,568 KB |
testcase_03 | AC | 21 ms
9,588 KB |
testcase_04 | AC | 21 ms
9,572 KB |
testcase_05 | AC | 21 ms
9,796 KB |
testcase_06 | AC | 21 ms
9,576 KB |
testcase_07 | AC | 20 ms
9,628 KB |
testcase_08 | AC | 21 ms
9,760 KB |
testcase_09 | AC | 20 ms
9,680 KB |
testcase_10 | AC | 81 ms
29,500 KB |
testcase_11 | AC | 76 ms
31,336 KB |
testcase_12 | AC | 22 ms
9,624 KB |
testcase_13 | AC | 22 ms
9,672 KB |
testcase_14 | AC | 26 ms
11,908 KB |
testcase_15 | AC | 77 ms
27,700 KB |
testcase_16 | AC | 27 ms
12,216 KB |
testcase_17 | AC | 47 ms
19,080 KB |
testcase_18 | AC | 34 ms
15,540 KB |
testcase_19 | AC | 91 ms
32,320 KB |
testcase_20 | AC | 75 ms
30,488 KB |
testcase_21 | AC | 83 ms
33,596 KB |
ソースコード
from sys import setrecursionlimit, stdin from collections import defaultdict, deque from itertools import permutations, combinations, product from functools import lru_cache from random import sample, choice, randint, random from heapq import heappush, heappop from math import factorial, gcd, exp from copy import copy, deepcopy from time import time setrecursionlimit(500000) readline = stdin.readline # @lru_cache(maxsize=None) INF = 10 ** 18 MOD = 1000000007 MOD2 = 998244353 DYDX = [(-1, 0), (1, 0), (0, -1), (0, 1)] def I(): return int(readline()) def S(): return readline()[:-1] def LI(): return list(map(int, readline().split())) def SPI(): return map(int, readline().split()) def SPII(): return map(lambda x: int(x)-1, readline().split()) def FIE(x): return [readline()[:-1] for _ in [0] * x] def NODE(x): return [[] for _ in [0] * x] def ranges(*args): return [(i, j) for i in range(args[0]) for j in range(args[-1])] def nynx(y, x, ly = INF, lx = INF): return [(y+dy, x+dx) for dy, dx in DYDX if 0 <= y+dy < ly and 0 <= x+dx < lx] def imax(A, idx=-1, m=-(1<<18)): for i, a in enumerate(A): m, idx = [[m, idx], [a, i]][m < a] return idx def imin(A, idx=-1, m=1<<18): for i, a in enumerate(A): m, idx = [[m, idx], [a, i]][m > a] return idx def cmin(dp, i, x): if x < dp[i]: dp[i] = x def cmax(dp, i, x): if x > dp[i]: dp[i] = x def gen(x, *args): ret = [x] * args[-1] for e in args[:-1][::-1]: ret = [deepcopy(ret) for _ in [0] * e] return ret def puts(E): for e in E: print(e) def pprint(E): print() puts(E) #################################################################### N, M = SPI() A = LI() mx = len(set(A)) mn = 1 if all(e == A[0] for e in A) and M == N else 0 print(mx, mn)