oj.uz

Submission #165581

# Submission time Handle Problem Language Result Execution time Memory
165581 2019-11-27T13:38:51 Z boolodifjenula Timovi (COCI18_timovi) Python 3
80 / 80
 507 ms 12748 KB 
N,K,M=map(int,input().split())
L=N*[0]
i=-1
k=1
c=(2*K+(N-2)*K*2)
#print(c)
if M//c:
    c=M//c
    L=[K*c]+(N-2)*[2*K*c]+[K*c]
    M-=(c*2*K+(N-2)*2*K*c)
    #print(L,M)
while M>0:
    if k: i+=1
    else: i-=1
    if M>K:
        L[i]+=K
        M-=K
    else:
        L[i]+=M
        M=0
        break
    if i==N-1:
        k=0
    if i==0:
        k=1
for j in range(N): print(L[j],end=" ")

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 3428 KB Output is correct
2 Correct 26 ms 3300 KB Output is correct
3 Correct 291 ms 6092 KB Output is correct
4 Correct 282 ms 6044 KB Output is correct
5 Correct 26 ms 3300 KB Output is correct
6 Correct 26 ms 3300 KB Output is correct
7 Correct 497 ms 12748 KB Output is correct
8 Correct 507 ms 12736 KB Output is correct