Submission #2529670
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(N-1): d, m = divmod(A[i], 2) if m and A[i+1]>0: d += 1 A[i+1] -= 1 ans += d ans += A[-1]//2 print(ans)
Submission Info
Submission Time | |
---|---|
Task | B - Simplified mahjong |
User | nadare881 |
Language | Python (3.4.3) |
Score | 400 |
Code Size | 294 Byte |
Status | AC |
Exec Time | 238 ms |
Memory | 7064 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
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 | AC | 227 ms | 7064 KB |
02.txt | AC | 234 ms | 7048 KB |
03.txt | AC | 229 ms | 7036 KB |
04.txt | AC | 204 ms | 5408 KB |
05.txt | AC | 227 ms | 5456 KB |
06.txt | AC | 217 ms | 5424 KB |
07.txt | AC | 219 ms | 6432 KB |
08.txt | AC | 225 ms | 6416 KB |
09.txt | AC | 233 ms | 7060 KB |
10.txt | AC | 236 ms | 7048 KB |
11.txt | AC | 191 ms | 3880 KB |
12.txt | AC | 225 ms | 7016 KB |
13.txt | AC | 238 ms | 7040 KB |
14.txt | AC | 232 ms | 7040 KB |
15.txt | AC | 190 ms | 3880 KB |
16.txt | AC | 230 ms | 7052 KB |
17.txt | AC | 237 ms | 7052 KB |
18.txt | AC | 17 ms | 2940 KB |
19.txt | AC | 17 ms | 2940 KB |
20.txt | AC | 17 ms | 3060 KB |
21.txt | AC | 17 ms | 3060 KB |
22.txt | AC | 17 ms | 2940 KB |
s1.txt | AC | 17 ms | 3060 KB |
s2.txt | AC | 17 ms | 2940 KB |