|
| 1 | +# frozen_string_literal: true |
| 2 | + |
| 3 | +raise"Arg1"ifARGV[0].nil? |
| 4 | +input=File.readlines(ARGV[0]) |
| 5 | + |
| 6 | +RULE=/^Step ([a-zA-Z]+) .* step ([a-zA-Z]+) can begin.$/.freeze |
| 7 | +input.map!{ |line|line.match(RULE).captures} |
| 8 | + |
| 9 | +dependents=input.group_by(&:first).transform_values{ |it|it.map(&:last)} |
| 10 | +dependencies=input.group_by(&:last).transform_values{ |it|it.map(&:first)} |
| 11 | + |
| 12 | +dependents.default_proc=proc{ |h,k|h[k]=[]} |
| 13 | +dependencies.default_proc=proc{ |h,k|h[k]=[]} |
| 14 | + |
| 15 | +steps_done=[] |
| 16 | +steps_current=dependents.keys.select{ |k|dependencies[k].empty?} |
| 17 | + |
| 18 | +workers=[] |
| 19 | +MAXWORKERS=5 |
| 20 | +elapsed=0 |
| 21 | + |
| 22 | +whilesteps_done.size <dependencies.size |
| 23 | +steps_current.sort! |
| 24 | +steps_current.uniq! |
| 25 | + |
| 26 | +is_ready=lambda{ |task|(dependencies[task] -steps_done).empty?} |
| 27 | +workers +=steps_current |
| 28 | +.select(&is_ready) |
| 29 | +.take(MAXWORKERS -workers.size) |
| 30 | +.map{ |sleight|[sleight,61 +('A'..'Z').find_index(sleight)]} |
| 31 | +.each{ |sleight|steps_current.delete(sleight[0])} |
| 32 | + |
| 33 | +min=workers.map(&:last).min |
| 34 | +workers.map!{ |worker,secs|[worker,secs -min]} |
| 35 | + |
| 36 | +workers.select{ |it|it[1].zero?}.eachdo |worker| |
| 37 | +workers.slice!workers.indexworker |
| 38 | +steps_done <<worker[0] |
| 39 | +steps_current +=dependents[worker[0]] |
| 40 | +end |
| 41 | + |
| 42 | +elapsed +=min |
| 43 | +end |
| 44 | + |
| 45 | +putselapsed |
