Submission #616617

Source Code Expand

n = gets.chomp.to_i
ks = gets.split.map(&:to_i)
results = Array.new(n)
results[0] = 1
results[-1] = ks[-1]
ks.size.times do |i|
  if i == ks.size - 1
    break
  end

  results[i + 1] = (ks[i] < ks[i + 1]) ? ks[i] : ks[i + 1]
end
puts results

Submission Info

Submission Time
Task B - 積み鉛筆
User vivaYasu
Language Ruby (2.1.5p273)
Score 0
Code Size 256 Byte
Status WA
Exec Time 302 ms
Memory 15856 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 80
Status
AC × 3
AC × 13
WA × 2
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 61 ms 5096 KB
sample2.txt AC 57 ms 5096 KB
sample3.txt AC 58 ms 5096 KB
subtask0_0.txt AC 277 ms 14824 KB
subtask0_1.txt AC 302 ms 15592 KB
subtask0_10.txt AC 246 ms 14696 KB
subtask0_11.txt WA 266 ms 15336 KB
subtask0_12.txt WA 260 ms 14568 KB
subtask0_13.txt AC 262 ms 15204 KB
subtask0_14.txt AC 274 ms 15856 KB
subtask0_2.txt AC 241 ms 13680 KB
subtask0_3.txt AC 254 ms 14184 KB
subtask0_4.txt AC 264 ms 15464 KB
subtask0_5.txt AC 238 ms 13976 KB
subtask0_6.txt AC 246 ms 14052 KB
subtask0_7.txt AC 234 ms 13676 KB
subtask0_8.txt AC 266 ms 15336 KB
subtask0_9.txt AC 282 ms 15812 KB