結果

問題 No.1 道のショートカット
コンテスト
ユーザー fujisu
提出日時 2015-01-30 05:21:24
言語 Java
(openjdk 23)
結果
AC  
実行時間 112 ms / 5,000 ms
コード長 3,718 bytes
コンパイル時間 2,546 ms
コンパイル使用メモリ 83,468 KB
実行使用メモリ 39,300 KB
最終ジャッジ日時 2024-07-20 16:08:19
合計ジャッジ時間 6,940 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.util.InputMismatchException;
import java.util.LinkedList;
import java.util.List;
import java.util.PriorityQueue;

public class Main {
	int n;
	List<Edge>[] e;

	class Edge {
		int to;
		int cost, dist;

		Edge(int to, int cost, int dist) {
			this.to = to;
			this.cost = cost;
			this.dist = dist;
		}
	}

	class D implements Comparable<D> {
		int pos;
		int rem;
		int len;

		D(int pos, int rem, int len) {
			this.pos = pos;
			this.rem = rem;
			this.len = len;
		}

		@Override
		public int compareTo(D o) {
			if (this.len != o.len)
				return this.len - o.len;
			if (this.rem != o.rem)
				return this.rem - o.rem;
			return this.pos - o.pos;
		}

		@Override
		public String toString() {
			return "(" + pos + ", " + rem + ", " + len + ")";
		}
	}

	int dijkstra(int c) {
		PriorityQueue<D> queue = new PriorityQueue<D>();
		queue.add(new D(0, c, 0));

		while (!queue.isEmpty()) {
			D d = queue.poll();
			int pos = d.pos;
			int rem = d.rem;
			int len = d.len;

			if (pos == n - 1) {
				return len;
			}

			for (Edge e : e[pos]) {
				int npos = e.to;
				int nrem = rem - e.cost;
				int nlen = len + e.dist;
				if (nrem < 0)
					continue;
				queue.add(new D(npos, nrem, nlen));
			}
		}

		return -1;
	}

	void run() {
		MyScanner sc = new MyScanner();

		n = sc.nextInt();
		int c = sc.nextInt();
		int m = sc.nextInt();
		int[] u = sc.nextIntArray(m);
		int[] v = sc.nextIntArray(m);
		int[] y = sc.nextIntArray(m);
		int[] t = sc.nextIntArray(m);
		e = new LinkedList[n];
		for (int i = 0; i < n; i++) {
			e[i] = new LinkedList<Edge>();
		}
		for (int i = 0; i < m; i++) {
			int a = u[i] - 1;
			int b = v[i] - 1;
			e[a].add(new Edge(b, y[i], t[i]));
		}

		System.out.println(dijkstra(c));
	}

	public static void main(String[] args) {
		new Main().run();
	}

	public void mapDebug(int[][] a) {
		System.out.println("--------map display---------");
		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[i].length; j++) {
				System.out.printf("%3d ", a[i][j]);
			}
			System.out.println();
		}
		System.out.println("----------------------------" + '\n');
	}

	class MyScanner {
		int read() {
			try {
				return System.in.read();
			} catch (IOException e) {
				throw new InputMismatchException();
			}
		}

		boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		boolean isEndline(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		int[] nextIntArray(int n) {
			int[] array = new int[n];
			for (int i = 0; i < n; i++)
				array[i] = nextInt();
			return array;
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		long[] nextLongArray(int n) {
			long[] array = new long[n];
			for (int i = 0; i < n; i++)
				array[i] = nextLong();
			return array;
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		double[] nextDoubleArray(int n) {
			double[] array = new double[n];
			for (int i = 0; i < n; i++)
				array[i] = nextDouble();
			return array;
		}

		String next() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		String[] nextStringArray(int n) {
			String[] array = new String[n];
			for (int i = 0; i < n; i++)
				array[i] = next();

			return array;
		}

		String nextLine() {
			int c = read();
			while (isEndline(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndline(c));
			return res.toString();
		}
	}
}
0