Submission #1304558
Source Code Expand
n=int(raw_input()) a=[int(raw_input()) for _ in xrange(n)] ans=0 for i in xrange(n-1): ans+=a[i]/2 if a[i+1]!=0: a[i+1]+=a[i]%2 print ans+a[n-1]/2
Submission Info
Submission Time | |
---|---|
Task | B - Simplified mahjong |
User | roto_37 |
Language | Python (2.7.6) |
Score | 400 |
Code Size | 171 Byte |
Status | AC |
Exec Time | 159 ms |
Memory | 6020 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 | 150 ms | 6020 KB |
02.txt | AC | 147 ms | 5764 KB |
03.txt | AC | 159 ms | 5764 KB |
04.txt | AC | 140 ms | 4612 KB |
05.txt | AC | 146 ms | 4612 KB |
06.txt | AC | 139 ms | 4612 KB |
07.txt | AC | 145 ms | 5252 KB |
08.txt | AC | 146 ms | 5252 KB |
09.txt | AC | 158 ms | 5764 KB |
10.txt | AC | 149 ms | 5764 KB |
11.txt | AC | 121 ms | 3432 KB |
12.txt | AC | 146 ms | 5764 KB |
13.txt | AC | 147 ms | 5764 KB |
14.txt | AC | 144 ms | 5764 KB |
15.txt | AC | 142 ms | 3432 KB |
16.txt | AC | 150 ms | 5764 KB |
17.txt | AC | 147 ms | 5764 KB |
18.txt | AC | 10 ms | 2568 KB |
19.txt | AC | 10 ms | 2568 KB |
20.txt | AC | 11 ms | 2568 KB |
21.txt | AC | 11 ms | 2568 KB |
22.txt | AC | 11 ms | 2568 KB |
s1.txt | AC | 11 ms | 2568 KB |
s2.txt | AC | 11 ms | 2568 KB |