QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #439989 | #6751. Game | suibian_xiaozhao# | WA | 116ms | 28036kb | Python3 | 304b | 2024-06-12 22:11:53 | 2024-06-12 22:11:53 |
Judging History
answer
import sys
input = lambda: sys.stdin.readline().strip()
n = int(input())
a = list(map(int, input().split()))
res = 0
mx = max(a)
idx = a.index(mx)
for i in range(idx, idx + n):
mn = min(a[(i - 1) % n], a[i % n])
res += mn
a[(i - 1) % n] -= mn
a[i % n] -= mn
print(res)
詳細信息
Test #1:
score: 100
Accepted
time: 4ms
memory: 9456kb
input:
2 7 5
output:
5
result:
ok 1 number(s): "5"
Test #2:
score: -100
Wrong Answer
time: 116ms
memory: 28036kb
input:
200000 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 1...
output:
10000000000
result:
wrong answer 1st numbers differ - expected: '10000050000', found: '10000000000'