Submission #845969


Source Code Expand

import numpy as np
N = int(raw_input())
A = []
for i in xrange(N):
    A.append(int(raw_input()))
A = np.array(A)
num_pair = (A / 2).sum()
A = A % 2
for i in xrange(len(A) - 1):
    if A[i] == 1 and A[i + 1] == 1:
        num_pair += 1
        A[i] = 0
        A[i + 1] = 0
print num_pair

Submission Info

Submission Time
Task B - Simplified mahjong
User kibo35
Language Python (2.7.6)
Score 0
Code Size 301 Byte
Status WA
Exec Time 1105 ms
Memory 15636 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 1105 ms 15636 KB
02.txt WA 683 ms 14384 KB
03.txt WA 685 ms 14384 KB
04.txt WA 612 ms 13216 KB
05.txt WA 595 ms 13104 KB
06.txt WA 603 ms 13216 KB
07.txt WA 625 ms 13872 KB
08.txt WA 641 ms 13872 KB
09.txt WA 646 ms 14384 KB
10.txt WA 667 ms 14384 KB
11.txt AC 600 ms 12144 KB
12.txt AC 584 ms 14384 KB
13.txt AC 726 ms 14384 KB
14.txt AC 737 ms 14384 KB
15.txt AC 628 ms 12144 KB
16.txt WA 644 ms 14384 KB
17.txt WA 654 ms 14384 KB
18.txt AC 139 ms 10420 KB
19.txt AC 140 ms 10420 KB
20.txt AC 142 ms 10420 KB
21.txt AC 139 ms 10420 KB
22.txt AC 139 ms 10420 KB
s1.txt AC 150 ms 10420 KB
s2.txt AC 145 ms 10420 KB