QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #636942 | #9450. Balloon Robot | ucup-team4810# | AC ✓ | 785ms | 31320kb | Python3 | 542b | 2024-10-13 04:18:11 | 2024-10-13 04:18:13 |
Judging History
answer
for _ in range(int(input())):
n,m,p = map(int,input().split())
s=list(map(int,input().split()))
sad=0
happies=[]
for xx in range(p):
a,b=map(int,input().split())
need=(s[a-1]-b)%m
sad+=need
happies.append(need)
happies.sort()
prev_time = happies[0]
# print(sad)
sad -= (happies[0])*p
ans = sad
for start_time in happies:
sad -= (start_time-prev_time)*p
ans=min(ans,sad)
sad+=m
prev_time = start_time
print(ans)
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 14ms
memory: 10568kb
input:
4 2 3 3 1 2 1 1 2 1 1 4 2 3 5 1 2 1 1 2 1 1 2 1 3 1 4 3 7 5 3 5 7 1 5 2 1 3 3 1 5 2 5 2 100 2 1 51 1 500 2 1000
output:
1 4 5 50
result:
ok 4 lines
Test #2:
score: 0
Accepted
time: 785ms
memory: 31320kb
input:
1004 22 9426 26 1165 5248 8331 9055 1161 7381 2188 7489 5131 8434 2166 3981 6302 7188 4858 856 7797 9129 7839 1676 25 9053 20 6 22 68 12 16 11 63 17 49 5 10 21 68 17 80 18 18 10 28 15 55 14 80 1 45 21 67 5 74 13 4 3 34 7 80 9 95 5 52 8 31 2 53 7 22 5 99 20 66 12 2 33 9526 92 558 7460 280 7952 5186 9...
output:
94067 360219 223074 30971 171844 312753 0 158169 294738 291604 115632 59327 221328 287851 30518 337118 181724 249419 66367 10347 208411 180496 287130 40736 264604 278208 33792 191523 111583 31867 21143 232153 149868 191831 238832 63626 258936 133059 105618 237774 53942 342921 275883 110295 149350 20...
result:
ok 1004 lines
Extra Test:
score: 0
Extra Test Passed