QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#380488 | #8565. Basic Blooms | ucup-team1766# | WA | 760ms | 49088kb | Python3 | 606b | 2024-04-07 04:47:00 | 2024-04-07 04:47:00 |
Judging History
answer
from heapq import *
MOD = 998244353
flowers = [0] * 1000001
heap = []
for b in range(2,17):
for d in range(1,b):
heappush(heap, [d, b, d, d])
for i in range(1,len(flowers)):
v,b,d,m = heappop(heap)
if v != flowers[i-1]:
flowers[i] = m % MOD
heappush(heap, [v*b+d, b, d, (m*b+d)%MOD])
if i % 10000 == 0:
for i in range(len(heap)):
heap[i][0] /= heap[0][0]
for i in range(1,len(flowers)):
flowers[i] = (flowers[i] + flowers[i-1]) % MOD
t = int(input())
for _ in range(t):
a, b = map(int,input().split())
print(flowers[b]-flowers[a-1])
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 760ms
memory: 49088kb
input:
3 1 2 1 10 15 2000
output:
1 5 735036421
result:
wrong answer 1st numbers differ - expected: '3', found: '1'