QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #439973 | #6751. Game | suibian_xiaozhao# | WA | 100ms | 27992kb | Python3 | 238b | 2024-06-12 21:38:11 | 2024-06-12 21:38:13 |
Judging History
answer
import sys
input = lambda: sys.stdin.readline().strip()
n = int(input())
a = list(map(int, input().split()))
res = 0
for i in range(n):
cur = min(a[i], a[(i - 1) % n], a[(i + 1) % n])
res = max(res, cur)
print(res)
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 9ms
memory: 9436kb
input:
2 7 5
output:
5
result:
ok 1 number(s): "5"
Test #2:
score: -100
Wrong Answer
time: 100ms
memory: 27992kb
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:
199998
result:
wrong answer 1st numbers differ - expected: '10000050000', found: '199998'