Submission #1431068

Source Code Expand

n = gets.to_i
a = gets.chomp.split(" ").map{|i| i.to_i}
sum = a.inject(:+)
now = a[0]
ans = (sum-now-now).abs
for i in 1...(n-1)
  # puts i
  now += a[i]
  ans = [ans, (sum-now - now).abs].min
end
puts ans

Submission Info

Submission Time
Task C - Splitting Pile
User kazunetakahashi
Language Ruby (2.3.3)
Score 300
Code Size 217 Byte
Status AC
Exec Time 185 ms
Memory 20484 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 16
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt
All 00_example_01.txt, 00_example_02.txt, 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
Case Name Status Exec Time Memory
00_example_01.txt AC 7 ms 1788 KB
00_example_02.txt AC 7 ms 1788 KB
01.txt AC 92 ms 11396 KB
02.txt AC 39 ms 4604 KB
03.txt AC 33 ms 4348 KB
04.txt AC 117 ms 12164 KB
05.txt AC 32 ms 4348 KB
06.txt AC 184 ms 20484 KB
07.txt AC 185 ms 20484 KB
08.txt AC 185 ms 20484 KB
09.txt AC 185 ms 20484 KB
10.txt AC 185 ms 20484 KB
11.txt AC 7 ms 1788 KB
12.txt AC 9 ms 1788 KB
13.txt AC 177 ms 19588 KB
14.txt AC 7 ms 1788 KB