Submission #618108
Source Code Expand
n = gets.chomp.to_i ks = gets.split.map(&:to_i) results = Array.new(n) results[0] = ks[0] results[-1] = ks[-1] i = 1 ks.each_cons(2) do |j, k| results[i] = (j < k) ? j : k i += 1 end puts results.join(' ')
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | vivaYasu |
Language | Ruby (2.1.5p273) |
Score | 80 |
Code Size | 219 Byte |
Status | AC |
Exec Time | 246 ms |
Memory | 16528 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 80 / 80 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample1.txt | AC | 53 ms | 4804 KB |
sample2.txt | AC | 59 ms | 4684 KB |
sample3.txt | AC | 56 ms | 4672 KB |
subtask0_0.txt | AC | 227 ms | 15380 KB |
subtask0_1.txt | AC | 238 ms | 15772 KB |
subtask0_10.txt | AC | 221 ms | 14824 KB |
subtask0_11.txt | AC | 236 ms | 15664 KB |
subtask0_12.txt | AC | 231 ms | 14980 KB |
subtask0_13.txt | AC | 228 ms | 15328 KB |
subtask0_14.txt | AC | 242 ms | 16100 KB |
subtask0_2.txt | AC | 212 ms | 13872 KB |
subtask0_3.txt | AC | 217 ms | 14560 KB |
subtask0_4.txt | AC | 226 ms | 15592 KB |
subtask0_5.txt | AC | 208 ms | 14140 KB |
subtask0_6.txt | AC | 218 ms | 14564 KB |
subtask0_7.txt | AC | 203 ms | 13712 KB |
subtask0_8.txt | AC | 234 ms | 15540 KB |
subtask0_9.txt | AC | 246 ms | 16528 KB |