oj.uz

Submission #726998

# Submission time Handle Problem Language Result Execution time Memory
726998 2023-04-19T19:18:41 Z beaconmc Coins (BOI06_coins) PyPy 3
90 / 100
 904 ms 41244 KB 
n,k = map(int, input().split())

coins = []
have = []

for i in range(n):
    a,b = map(int, input().split())
    coins.append(a)
    have.append(b)

ans = 0
sum = 0

for i in range(len(coins)-1):
    if have[i]==0 and sum + coins[i] < coins[i+1] and sum+coins[i] < k:
        ans += 1
        sum += coins[i]
    
if sum+coins[-1] < k and have[-1]==0:
    ans += 1
    sum += coins[-1]
print(ans)
print((k-sum) if (k-sum) >= 1 else 1)

Subtask #1
90.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 18220 KB Output is correct
2 Correct 38 ms 18208 KB Output is correct
3 Correct 38 ms 18180 KB Output is correct
4 Correct 37 ms 18220 KB Output is correct
5 Correct 44 ms 18108 KB Output is correct
6 Correct 42 ms 18224 KB Output is correct
7 Correct 817 ms 40612 KB Output is correct
8 Incorrect 904 ms 40604 KB Output isn't correct
9 Correct 849 ms 40028 KB Output is correct
10 Correct 857 ms 41244 KB Output is correct