Submission #2529509

Source Code Expand

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

A = []
ans = 0
for _ in range(N):
    d, m = divmod(int(input()), 2)
    ans += d
    A.append(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 296 Byte
Status WA
Exec Time 254 ms
Memory 3880 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 238 ms 3868 KB
02.txt WA 236 ms 3872 KB
03.txt WA 243 ms 3848 KB
04.txt WA 241 ms 3864 KB
05.txt WA 223 ms 3864 KB
06.txt WA 232 ms 3864 KB
07.txt WA 237 ms 3864 KB
08.txt WA 240 ms 3864 KB
09.txt WA 244 ms 3864 KB
10.txt WA 243 ms 3868 KB
11.txt AC 221 ms 3880 KB
12.txt AC 233 ms 3868 KB
13.txt AC 254 ms 3872 KB
14.txt AC 241 ms 3872 KB
15.txt AC 226 ms 3864 KB
16.txt WA 236 ms 3868 KB
17.txt WA 245 ms 3872 KB
18.txt AC 17 ms 3060 KB
19.txt AC 17 ms 3060 KB
20.txt AC 17 ms 3064 KB
21.txt AC 17 ms 2940 KB
22.txt AC 17 ms 3060 KB
s1.txt AC 17 ms 3064 KB
s2.txt AC 17 ms 3060 KB