結果

問題 No.2025 Select kk-th Submultiset
ユーザー mkawa2mkawa2
提出日時 2022-07-30 18:52:13
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 352 ms / 2,000 ms
コード長 1,519 bytes
コンパイル時間 148 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 82,204 KB
最終ジャッジ日時 2024-07-20 15:08:57
合計ジャッジ時間 13,065 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 42
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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)]
dij = [(-1, 1), (-1, 0), (-1, -1), (1, -1), (1, 1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353
from bisect import bisect_right
lim = 10**18
n, L = LI()
cc = LI()
dp = [[0]*(L+2) for _ in range(n)]
c = cc[-1]
dp[-1][:c+2] = list(range(c+2))
dp[-1][c+2:] = [c+1]*(L-c)
# p2D(dp)
for i in range(n-1)[::-1]:
c = cc[i]
for j in range(L+1):
l, r = max(0, j-c), j+1
dp[i][j+1] = dp[i][j]+dp[i+1][r]-dp[i+1][l]
# p2D(dp)
mx = dp[0][L+1]-dp[0][L]
for _ in range(II()):
k = II()
if k > mx:
print(-1)
continue
k -= 1
ans = [0]*n
s = 0
for i in range(n-1):
l = max(0, L-(s+cc[i]))
r = bisect_right(dp[i+1], k+dp[i+1][l])-1
ans[i] = L-s-r
s += ans[i]
k -= dp[i+1][r]-dp[i+1][l]
# print(l, r, s, k)
ans[-1] = L-s
print(*ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0