Submission #2251327

Source Code Expand

n = read_line.to_i
p = read_line.split.map { |e| e.to_i - 1 }
a = 0
(n - 1).times do |i|
  if p[i] == i
    p[i], p[i + 1] = p[i + 1], p[i]
    a += 1
  end
end
a += 1 if p[n - 1] == n - 1
puts a

Submission Info

Submission Time
Task D - Derangement
User tomerun
Language Crystal (0.20.5)
Score 400
Code Size 207 Byte
Status AC
Exec Time 43 ms
Memory 8956 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 1 ms 636 KB
0_001.txt AC 2 ms 636 KB
0_002.txt AC 2 ms 636 KB
0_003.txt AC 2 ms 2556 KB
1_004.txt AC 2 ms 636 KB
1_005.txt AC 43 ms 7932 KB
1_006.txt AC 43 ms 7420 KB
1_007.txt AC 41 ms 8572 KB
1_008.txt AC 43 ms 8188 KB
1_009.txt AC 43 ms 8956 KB
1_010.txt AC 41 ms 8572 KB
1_011.txt AC 43 ms 8572 KB
1_012.txt AC 43 ms 8828 KB
1_013.txt AC 43 ms 8700 KB
1_014.txt AC 41 ms 8956 KB