結果
問題 | No.1929 Exponential Sequence |
ユーザー | mkawa2 |
提出日時 | 2022-05-06 22:44:05 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 260 ms / 2,000 ms |
コード長 | 1,435 bytes |
コンパイル時間 | 357 ms |
コンパイル使用メモリ | 86,764 KB |
実行使用メモリ | 84,388 KB |
最終ジャッジ日時 | 2023-10-12 04:23:02 |
合計ジャッジ時間 | 5,409 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 97 ms
71,304 KB |
testcase_01 | AC | 101 ms
71,464 KB |
testcase_02 | AC | 102 ms
71,568 KB |
testcase_03 | AC | 254 ms
84,040 KB |
testcase_04 | AC | 98 ms
71,392 KB |
testcase_05 | AC | 99 ms
71,124 KB |
testcase_06 | AC | 99 ms
71,376 KB |
testcase_07 | AC | 97 ms
71,344 KB |
testcase_08 | AC | 97 ms
71,412 KB |
testcase_09 | AC | 97 ms
71,672 KB |
testcase_10 | AC | 99 ms
71,372 KB |
testcase_11 | AC | 98 ms
71,516 KB |
testcase_12 | AC | 98 ms
71,596 KB |
testcase_13 | AC | 101 ms
71,496 KB |
testcase_14 | AC | 98 ms
71,220 KB |
testcase_15 | AC | 120 ms
77,484 KB |
testcase_16 | AC | 104 ms
71,964 KB |
testcase_17 | AC | 100 ms
71,244 KB |
testcase_18 | AC | 100 ms
71,612 KB |
testcase_19 | AC | 101 ms
71,384 KB |
testcase_20 | AC | 102 ms
72,012 KB |
testcase_21 | AC | 257 ms
84,388 KB |
testcase_22 | AC | 208 ms
81,800 KB |
testcase_23 | AC | 260 ms
84,180 KB |
testcase_24 | AC | 179 ms
80,004 KB |
testcase_25 | AC | 252 ms
83,956 KB |
testcase_26 | AC | 254 ms
84,236 KB |
testcase_27 | AC | 102 ms
71,572 KB |
ソースコード
import sys sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = (1 << 63)-1 # inf = (1 << 31)-1 # md = 10**9+7 md = 998244353 from collections import Counter def mid(xx): cnt = Counter() cnt[0] = 1 for x in xx: nc = Counter() for t, c in cnt.items(): e = 1 while t+x**e <= s: nc[t+x**e] += c e += 1 cnt = nc # print(cnt) return sorted(cnt.items()) n, s = LI() aa = LI() if n < 5: cnt = mid(aa) # print(cnt) ans = sum(c for a, c in cnt) else: pre = aa[:n//2] pos = aa[n//2:] ll = mid(pre) rr = mid(pos) j = 0 t = 0 ans = 0 for i in range(len(ll))[::-1]: while j < len(rr) and ll[i][0]+rr[j][0] <= s: t += rr[j][1] j += 1 ans += ll[i][1]*t print(ans)