# http://yukicoder.me/problems/17 use strict; use warnings; use 5.010; use Data::Dumper; my $goal = _read_line(); my $money = _read_line(); my $roads = _read_line(); my $map = read_map(); # 前処理終了。 # 解く my $ans = solve($map, $money, $goal); say $ans; sub _read_line { my $line = ; chomp($line); return $line; } sub read_map { my $s = [split(/ /, _read_line())]; my $t = [split(/ /, _read_line())]; my $y = [split(/ /, _read_line())]; my $m = [split(/ /, _read_line())]; my $ret = {}; ## これ同じ街間に別経路が存在する場合があるみたい。 ## なので、コストと距離は配列で持つ。 for (my $i = 0 ; $i < @$s ; $i++) { my $start = $s->[$i]; my $dest = $t->[$i]; $ret->{$start} ||= {}; $ret->{$start}->{$dest} ||= []; push @{ $ret->{$start}->{$dest} }, { cost => $y->[$i], dist => $m->[$i], }; } return $ret; } sub solve { my ($map, $money, $goal) = @_; my $cur = [ { pos => 1, cost => 0, dist => 0, } ]; my $res = []; while (my $state = pop(@$cur)) { while (my ($k, $v_array) = each(%{$map->{ $state->{ pos } }})) { for my $v (@$v_array) { my $cost = $v->{ cost } + $state->{ cost }; my $dist = $v->{ dist } + $state->{ dist }; next if ($cost > $money); if ($k == $goal) { push @$res, { cost => $cost, dist => $dist, } } else { push @$cur, { pos => $k, cost => $cost, dist => $dist, }; } } } } $res = [sort {$a->{dist} <=> $b->{dist}} @$res]; return -1 if @$res == 0; return $res->[0]->{dist}; }