Submission #1447845
Source Code Expand
N = gets.to_i A = gets.split.map(&:to_i) def smaller(a, b) a < b ? a : b end C = [0, (A[1] - A[0]).abs] (2...N).each do |i| C[i] = smaller(C[i - 2] + (A[i] - A[i - 2]).abs, C[i - 1] + (A[i] - A[i - 1]).abs) end puts C.last
Submission Info
Submission Time | |
---|---|
Task | C - 柱柱柱柱柱 |
User | hatovalley |
Language | Ruby (2.3.3) |
Score | 100 |
Code Size | 240 Byte |
Status | AC |
Exec Time | 77 ms |
Memory | 8908 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 7 ms | 1788 KB |
sample_02.txt | AC | 7 ms | 1788 KB |
sample_03.txt | AC | 7 ms | 3836 KB |
subtask1_01.txt | AC | 7 ms | 1788 KB |
subtask1_02.txt | AC | 7 ms | 1788 KB |
subtask1_03.txt | AC | 7 ms | 1788 KB |
subtask1_04.txt | AC | 77 ms | 8908 KB |
subtask1_05.txt | AC | 74 ms | 8908 KB |
subtask1_06.txt | AC | 74 ms | 8908 KB |
subtask1_07.txt | AC | 74 ms | 8908 KB |