Submission #4240667

Source Code Expand

n = gets.to_i
a = n.times.map{gets.to_i}
ans = 0
for i in 0..n-1
    if i > 0 && a[i-1] == 1 && a[i] > 0
        a[i] -= 1
        ans += 1
    end
    ans += a[i]/2
    a[i] %= 2
end
puts ans

Submission Info

Submission Time
Task B - Simplified mahjong
User koikotya
Language Ruby (2.3.3)
Score 400
Code Size 203 Byte
Status AC
Exec Time 88 ms
Memory 3836 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 24
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 88 ms 2684 KB
02.txt AC 85 ms 2996 KB
03.txt AC 85 ms 2684 KB
04.txt AC 77 ms 2996 KB
05.txt AC 76 ms 2996 KB
06.txt AC 77 ms 2996 KB
07.txt AC 82 ms 2684 KB
08.txt AC 81 ms 2996 KB
09.txt AC 86 ms 2996 KB
10.txt AC 87 ms 2996 KB
11.txt AC 69 ms 2996 KB
12.txt AC 79 ms 2996 KB
13.txt AC 84 ms 2996 KB
14.txt AC 85 ms 2996 KB
15.txt AC 71 ms 2996 KB
16.txt AC 86 ms 2996 KB
17.txt AC 85 ms 2996 KB
18.txt AC 6 ms 1788 KB
19.txt AC 6 ms 1788 KB
20.txt AC 6 ms 1788 KB
21.txt AC 6 ms 1788 KB
22.txt AC 6 ms 1788 KB
s1.txt AC 6 ms 1788 KB
s2.txt AC 7 ms 3836 KB