| Task: | Increasing Array |
| Sender: | sspilsbury |
| Submission time: | 2020-09-26 13:19:36 +0300 |
| Language: | Python3 (CPython3) |
| Status: | READY |
| Result: | WRONG ANSWER |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.02 s | details |
| #2 | WRONG ANSWER | 0.02 s | details |
| #3 | WRONG ANSWER | 0.02 s | details |
| #4 | ACCEPTED | 0.15 s | details |
| #5 | WRONG ANSWER | 0.14 s | details |
| #6 | WRONG ANSWER | 0.17 s | details |
| #7 | ACCEPTED | 0.02 s | details |
Code
n = int(input())
inputs = [int(x) for x in (input()).split(" ")]
turns = 0
if n == 0:
print(0)
else:
for i in range(1, len(inputs)):
turns += max(0, inputs[i - 1] - inputs[i])
print(turns)Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 10 1 1 1 1 1 1 1 1 1 1 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 2
Verdict: WRONG ANSWER
| input |
|---|
| 10 1000000000 1 1 1 1 1 1 1 1 1 |
| correct output |
|---|
| 8999999991 |
| user output |
|---|
| 999999999 |
Test 3
Verdict: WRONG ANSWER
| input |
|---|
| 10 6 10 4 10 2 8 9 2 7 7 |
| correct output |
|---|
| 31 |
| user output |
|---|
| 21 |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 5
Verdict: WRONG ANSWER
| input |
|---|
| 200000 1000000000 1 1 1 1 1 1 1 1 1 1... |
| correct output |
|---|
| 199998999800001 |
| user output |
|---|
| 999999999 |
Test 6
Verdict: WRONG ANSWER
| input |
|---|
| 200000 763977854 530688450 486447012 ... |
| correct output |
|---|
| 100126194120455 |
| user output |
|---|
| 33410715681340 |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 1 329873232 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
