QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #876074 | #7695. Double Up | WeaRD276# | WA | 28ms | 11392kb | Python3 | 395b | 2025-01-30 16:53:26 | 2025-01-30 16:53:30 |
Judging History
answer
from inspect import stack
n = int(input())
a = list(map(int, input().split()))
st = list()
for i in range(n):
if len(st) > 0 and st[-1] == a[i]:
st.pop()
st.append(2 * a[i])
else:
st.append(a[i])
st = sorted(st)
nm = st[0]
for i in range(1, len(st)):
if (nm == st[i]):
nm *= 2
else:
nm = max(nm, st[i])
print(nm)
详细
Test #1:
score: 100
Accepted
time: 26ms
memory: 11392kb
input:
5 4 2 2 1 8
output:
16
result:
ok single line: '16'
Test #2:
score: -100
Wrong Answer
time: 28ms
memory: 11392kb
input:
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...
output:
4
result:
wrong answer 1st lines differ - expected: '512', found: '4'