Submission #1736155

Source Code Expand

def answer(n, a)
  count = 0
  n.times do |nn|
    next if a[nn] != nn + 1
    a[nn], a[nn + 1] = a[nn + 1], a[nn]
    count += 1
  end
  count
end

n = gets.to_i
a = gets.split.map(&:to_i)
puts answer(n, a)

Submission Info

Submission Time
Task D - Derangement
User eduidl
Language Ruby (2.3.3)
Score 400
Code Size 219 Byte
Status AC
Exec Time 60 ms
Memory 8068 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 4
AC × 15
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt
Case Name Status Exec Time Memory
0_000.txt AC 7 ms 1788 KB
0_001.txt AC 7 ms 1788 KB
0_002.txt AC 7 ms 1788 KB
0_003.txt AC 8 ms 1788 KB
1_004.txt AC 7 ms 1788 KB
1_005.txt AC 60 ms 8068 KB
1_006.txt AC 60 ms 8068 KB
1_007.txt AC 53 ms 8068 KB
1_008.txt AC 59 ms 8068 KB
1_009.txt AC 59 ms 8068 KB
1_010.txt AC 53 ms 8068 KB
1_011.txt AC 57 ms 8068 KB
1_012.txt AC 57 ms 8068 KB
1_013.txt AC 56 ms 8068 KB
1_014.txt AC 51 ms 8068 KB