// URL: https://yukicoder.me/problems/no/1 import std.algorithm, std.container, std.math, std.range, std.typecons, std.string; version(unittest) {} else void main() { int N; io.getV(N); int C; io.getV(C); int V; io.getV(V); int[] S; io.getA(V, S); --S[]; int[] T; io.getA(V, T); --T[]; int[] Y; io.getA(V, Y); int[] M; io.getA(V, M); struct E { int v, y, m; } E[][int] g; foreach (Si, Ti, Yi, Mi; lockstep(S, T, Y, M)) { g[Si] ~= E(Ti, Yi, Mi); g[Ti] ~= E(Si, Yi, Mi); } auto dp = new int[][](N, C+1), inf = 10^^9; foreach (dpi; dp) dpi[] = inf; dp[0][0] = 0; struct R { int u, c; } auto q = DList!R(R(0, 0)); while (!q.empty) { auto r = q.front; q.removeFront(); foreach (e; g[r.u]) { auto c = r.c+e.y, m = dp[r.u][r.c]+e.m; if (c <= C && m < dp[e.v][c]) { dp[e.v][c] = m; q.insertBack(R(e.v, c)); } } } io.putB(dp[N-1].minElement < inf, dp[N-1].minElement, -1); } auto io = IO!()(); import std.stdio; struct IO(alias IN = stdin, alias OUT = stdout, string delimiter = " ", string floatFormat = "%.10f") { import std.algorithm, std.conv, std.format, std.meta, std.range, std.stdio, std.traits; alias assignable = hasAssignableElements; dchar[] buf; auto sp = (new dchar[](0)).splitter; void nextLine() { IN.readln(buf); sp = buf.splitter; } auto get(T)(ref T v) { if (sp.empty) nextLine(); v = sp.front.to!T; sp.popFront(); } auto getV(T...)(ref T v) { foreach (ref w; v) get(w); } auto getA(T)(size_t n, ref T v) if (assignable!T) { v = new T(n); foreach (ref w; v) get(w); } auto getC(T...)(size_t n, ref T v) if (allSatisfy!(assignable, T)) { foreach (ref w; v) w = new typeof(w)(n); foreach (i; 0..n) foreach (ref w; v) get(w[i]); } auto getM(T)(size_t r, size_t c, ref T v) if (assignable!T && assignable!(ElementType!T)) { v = new T(r); foreach (ref w; v) getA(c, w); } auto putR(T)(T v) { auto w = v; while (!w.empty) { putA(w.front); w.popFront(); if (!w.empty) OUT.write(delimiter); } } auto putA(T)(T v) { static if (isInputRange!T && !isSomeString!T) putR(v); else if (isFloatingPoint!T) OUT.write(format(floatFormat, v)); else OUT.write(v); } auto put(T...)(T v) { foreach (i, w; v) { putA(w); if (i < v.length-1) OUT.write(delimiter); } OUT.writeln; } auto putB(S, T)(bool c, S t, T f) { if (c) put(t); else put(f); } auto putRaw(T...)(T v) { OUT.write(v); OUT.writeln; } }