Submission #3171524
Source Code Expand
import sys stdin = sys.stdin def li(): return [int(x) for x in stdin.readline().split()] def li_(): return [int(x)-1 for x in stdin.readline().split()] def lf(): return [float(x) for x in stdin.readline().split()] def ls(): return stdin.readline().split() def ns(): return stdin.readline().rstrip() def lc(): return list(ns()) def ni(): return int(ns()) def nf(): return float(ns()) n = ni() a = [] for _ in range(n): a.append(ni()) res = 0 ans = 0 for ai in a: if ai == 0: ans += res//2 res = 0 else: res += ai ans += res//2 print(ans)
Submission Info
Submission Time | |
---|---|
Task | B - Simplified mahjong |
User | polarbear08 |
Language | Python (3.4.3) |
Score | 400 |
Code Size | 623 Byte |
Status | AC |
Exec Time | 107 ms |
Memory | 7072 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 | 99 ms | 7068 KB |
02.txt | AC | 99 ms | 7072 KB |
03.txt | AC | 98 ms | 7072 KB |
04.txt | AC | 107 ms | 5532 KB |
05.txt | AC | 104 ms | 5528 KB |
06.txt | AC | 107 ms | 5532 KB |
07.txt | AC | 105 ms | 6412 KB |
08.txt | AC | 106 ms | 6404 KB |
09.txt | AC | 100 ms | 7072 KB |
10.txt | AC | 100 ms | 7072 KB |
11.txt | AC | 95 ms | 3880 KB |
12.txt | AC | 99 ms | 7072 KB |
13.txt | AC | 105 ms | 7064 KB |
14.txt | AC | 100 ms | 7072 KB |
15.txt | AC | 95 ms | 3880 KB |
16.txt | AC | 96 ms | 7072 KB |
17.txt | AC | 102 ms | 7068 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 |