Submission #616598


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 A - ニコニコ数
User vivaYasu
Language Ruby (2.1.5p273)
Score 0
Code Size 256 Byte
Status RE
Exec Time 52 ms
Memory 5156 KB

Judge Result

Set Name Sample Subtask1
Score / Max Score 0 / 0 0 / 60
Status
RE × 2
RE × 17
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
Subtask1 sample_01.txt, sample_02.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt
Case Name Status Exec Time Memory
sample_01.txt RE 51 ms 5100 KB
sample_02.txt RE 50 ms 5100 KB
test_01.txt RE 49 ms 5096 KB
test_02.txt RE 50 ms 5100 KB
test_03.txt RE 49 ms 5096 KB
test_04.txt RE 49 ms 5156 KB
test_05.txt RE 50 ms 5100 KB
test_06.txt RE 52 ms 5100 KB
test_07.txt RE 49 ms 5100 KB
test_08.txt RE 49 ms 5096 KB
test_09.txt RE 50 ms 5100 KB
test_10.txt RE 50 ms 5100 KB
test_11.txt RE 51 ms 5100 KB
test_12.txt RE 49 ms 5100 KB
test_13.txt RE 52 ms 5144 KB
test_14.txt RE 52 ms 5096 KB
test_15.txt RE 50 ms 5096 KB