# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 167 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
5 | nor | 151 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
9 | Petr | 145 |
10 | pajenegod | 143 |
This is the question Link
3
-525187879 0 425880698
There is a diff of 2. Can anyone look why my code is wrong?
a = int(input())
def solve(t):
coins = 0
for i in range(len(t)):
if t[i]==1 or t[i] ==-1:
pass
else:
if t[i]<0:
coins+=-1 - t[i]
t[i] = -1
elif t[i]>0:
coins += t[i] - 1
t[i] = 1
else:
coins+=1
t[i] += 1
less = 0
great = 0
for i in t:
if i<0:
less+=1
else:
great+=1
# print(coins)
if less&1!=0:
#odd
coins+=2
return print(coins)
t = list(map(int, input().strip().split()))
solve(t)
Name |
---|
your code always transform 0 to 1
where in the test case 6 it's faster to just transform 0 to -1