Submission #2529557


Source Code Expand

# -*- coding: utf-8 -*-
def inpl(): return map(int, input().split())
N = int(input())

A = [int(input()) for _ in range(N)]
ans = 0
for i in range(1, N-1):
    if A[i-1]%2 == 1 and A[i] >= 2 and A[i]%2==0 and A[i+1]%2 == 1:
        A[i-1] += 1
        A[i] -= 2
        A[i+1] += 1

#print(A)

for i in range(N):
    d, m = divmod(A[i], 2)
    ans += d
    A[i] = m

for i in range(N-1):
    if 1 == A[i] == A[i+1]:
        A[i+1] = 0
        ans += 1
print(ans)

Submission Info

Submission Time
Task B - Simplified mahjong
User nadare881
Language Python (3.4.3)
Score 0
Code Size 485 Byte
Status WA
Exec Time 272 ms
Memory 7064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
AC × 12
WA × 12
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt WA 262 ms 7064 KB
02.txt WA 269 ms 7040 KB
03.txt WA 267 ms 7036 KB
04.txt WA 241 ms 5428 KB
05.txt WA 248 ms 5456 KB
06.txt WA 231 ms 5444 KB
07.txt WA 252 ms 6432 KB
08.txt WA 255 ms 6436 KB
09.txt WA 268 ms 7052 KB
10.txt WA 266 ms 7044 KB
11.txt AC 218 ms 3880 KB
12.txt AC 245 ms 7040 KB
13.txt AC 269 ms 7040 KB
14.txt AC 272 ms 7036 KB
15.txt AC 226 ms 3880 KB
16.txt WA 258 ms 7052 KB
17.txt WA 254 ms 7052 KB
18.txt AC 17 ms 3064 KB
19.txt AC 17 ms 3064 KB
20.txt AC 17 ms 3064 KB
21.txt AC 17 ms 3064 KB
22.txt AC 17 ms 3064 KB
s1.txt AC 17 ms 3064 KB
s2.txt AC 17 ms 3064 KB