Submission #2240849


Source Code Expand

$n,$m = gets.chomp.split(" ").map(&:to_i)
edge = $m.times.map{gets.chomp.split(" ").map(&:to_i)}
$mtr = Array.new($n).map{Array.new($n,0)}
edge.each do |coo|
  $mtr[coo[0]-1][coo[1]-1] = 1
  $mtr[coo[1]-1][coo[0]-1] = 1
end
list = [0]
depth = 1
def dfs(list,depth)
  if depth == $n
    $count += 1
  end
  for i in 0..$n-1
    if $mtr[list[-1]][i] == 1 && !(list.include?(i))
      depth += 1
      list << i
      #p list,i
      dfs(list,depth)
      depth -= 1
      list.slice!(-1)
    end
  end
end
$count = 0
dfs(list,depth)
puts $count

Submission Info

Submission Time
Task C - One-stroke Path
User koikotya
Language Ruby (2.3.3)
Score 300
Code Size 568 Byte
Status AC
Exec Time 28 ms
Memory 1788 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 15
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt
Case Name Status Exec Time Memory
sample_01.txt AC 7 ms 1788 KB
sample_02.txt AC 7 ms 1788 KB
subtask_1_01.txt AC 7 ms 1788 KB
subtask_1_02.txt AC 7 ms 1788 KB
subtask_1_03.txt AC 7 ms 1788 KB
subtask_1_04.txt AC 28 ms 1788 KB
subtask_1_05.txt AC 7 ms 1788 KB
subtask_1_06.txt AC 7 ms 1788 KB
subtask_1_07.txt AC 7 ms 1788 KB
subtask_1_08.txt AC 7 ms 1788 KB
subtask_1_09.txt AC 7 ms 1788 KB
subtask_1_10.txt AC 9 ms 1788 KB
subtask_1_11.txt AC 8 ms 1788 KB
subtask_1_12.txt AC 16 ms 1788 KB
subtask_1_13.txt AC 23 ms 1788 KB