結果

問題 No.78 クジ付きアイスバー
ユーザー Coki628
提出日時 2020-10-22 00:18:50
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 1,330 bytes
コンパイル時間 183 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 66,048 KB
最終ジャッジ日時 2024-07-21 09:11:22
合計ジャッジ時間 3,563 ms
ジャッジサーバーID
(参考情報)
judge4 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 27 WA * 8
権限があれば一括ダウンロードができます

ソースコード

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

import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c for j in range(b)] for i in range(a)]
def list3d(a, b, c, d): return [[[d for k in range(c)] for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e for l in range(d)] for k in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10**9)
INF = 10**19
MOD = 10**9 + 7
EPS = 10**-10
N, K = MAP()
A = list(map(int, input()))
M = 10**5 // N * N
cost = bonus = 0
for i in range(min(K, M)):
if bonus == 0:
cost += 1
else:
bonus -= 1
if A[i%N] == 1:
bonus += 1
elif A[i%N] == 2:
bonus += 2
if cost == 1:
print(1)
exit()
if K > M:
K -= M
d, m = divmod(K, N)
use = min(d, 1000)
d -= use
m += N*use
cost += N*d - sum(A)*d
for i in range(m):
if bonus == 0:
cost += 1
else:
bonus -= 1
if A[i%N] == 1:
bonus += 1
elif A[i%N] == 2:
bonus += 2
print(cost)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0