oj.uz

Submission #197944

# Submission time Handle Problem Language Result Execution time Memory
197944 2020-01-24T11:47:03 Z model_code Pod starim krovovima (COCI20_psk) Python 3
50 / 50
 438 ms 3660 KB 
N = int(input())
 
stol = []
for i in range(N):
    Ti, Zi = map(int, input().split())
    stol += [[i, Ti, Zi]]
#print(stol)
 
stol = sorted(stol, key = lambda x: x[2])
 
#print(stol)
 
for i in range(N-1):
    koliko = stol[i][1]
    j = i + 1
    while koliko > 0 and j < N:
        t = stol[j][1]
        stol[j][1] = min(stol[j][2], stol[j][1] + koliko)
        koliko = koliko - (stol[j][1] - t)
        stol[i][1] = koliko
        j += 1
 
    #print(stol)
 
stol = sorted(stol, key = lambda x: x[0])
#print(stol)
 
ukupno = 0
for i in range(N):
    if stol[i][1] == 0:
        ukupno += 1
print(ukupno)

stol.sort()
 
for i in range(N):
    print(stol[i][1], end = ' ')

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 3428 KB Output is correct
2 Correct 26 ms 3340 KB Output is correct
3 Correct 26 ms 3428 KB Output is correct
4 Correct 25 ms 3388 KB Output is correct
5 Correct 25 ms 3348 KB Output is correct
6 Correct 27 ms 3348 KB Output is correct
7 Correct 27 ms 3348 KB Output is correct
8 Correct 438 ms 3660 KB Output is correct
9 Correct 139 ms 3476 KB Output is correct
10 Correct 245 ms 3648 KB Output is correct