QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #552861 | #9255. Python Program | ucup-team4810# | AC ✓ | 515ms | 10924kb | Python3 | 692b | 2024-09-08 03:15:15 | 2024-09-08 03:15:15 |
Judging History
answer
ans = 0
input()
inp0 = input()
inp1 = inp0.split()
i = inp1[1]
abc = list(map(int, inp1[3][6:-2].split(',')))
inp2 = input()
input()
inplast=input()
inp3 = inp2.split()
ddd = inp3[3][6:-2].split(',')
if len(ddd) == 1:
d='0'
e=ddd[0]
f='1'
elif len(ddd) == 2:
d=ddd[0]
e=ddd[1]
f='1'
else:
d,e,f=ddd
inner_sim=[
'v0='+d,
'v1='+e,
'v2='+f,
'if v1-v0<=0<v2 or v1-v0>=0>v2:continue',
'v2a=abs(v2)',
'numv = (abs(v1-v0)+v2a-1)//v2a',
'midv2=v0*2+(numv-1)*v2',
# 'print(numv,midv2)',
'ans+=(numv*midv2)//2'
]
inner_sim=[' '+x for x in inner_sim]
exec(compile('\n'.join(['ans=0',inp0]+inner_sim+[inplast]),'<string>',"exec"))
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 16ms
memory: 10780kb
input:
ans=0
for a in range(1,3):
for b in range(5,1,-2):
ans+=b
print(ans)
output:
16
result:
ok single line: '16'
Test #2:
score: 0
Accepted
time: 12ms
memory: 10916kb
input:
ans=0
for q in range(100,50,-1):
for i in range(q,77,20):
ans+=i
print(ans)
output:
2092
result:
ok single line: '2092'
Test #3:
score: 0
Accepted
time: 515ms
memory: 10748kb
input:
ans=0
for i in range(1,1000000):
for j in range(i,1,-1):
ans+=j
print(ans)
output:
166666666665500001
result:
ok single line: '166666666665500001'
Test #4:
score: 0
Accepted
time: 93ms
memory: 10856kb
input:
ans=0
for i in range(31,321983,2):
for j in range(313,382193):
ans+=j
print(ans)
output:
11756963404587200
result:
ok single line: '11756963404587200'
Test #5:
score: 0
Accepted
time: 474ms
memory: 10924kb
input:
ans=0
for i in range(1,1000000):
for j in range(i,114514,-1):
ans+=j
print(ans)
output:
160610445975856765
result:
ok single line: '160610445975856765'
Extra Test:
score: 0
Extra Test Passed