#6635 (Java) No.1 道のショートカット

提出ソース

結果

問題	No.1 道のショートカット
ユーザー	ぴろず
提出日時	2014-12-17 21:14:45
言語	Java (openjdk 23)
結果	AC
実行時間	173 ms / 5,000 ms
コード長	6,454 bytes
コンパイル時間	4,082 ms
コンパイル使用メモリ	80,340 KB
実行使用メモリ	50,536 KB
最終ジャッジ日時	2024-07-20 16:08:11
合計ジャッジ時間	7,989 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	55 ms 37,244 KB
testcase_01	AC	55 ms 36,944 KB
testcase_02	AC	55 ms 37,076 KB
testcase_03	AC	55 ms 37,024 KB
testcase_04	AC	55 ms 36,736 KB
testcase_05	AC	53 ms 36,632 KB
testcase_06	AC	54 ms 36,732 KB
testcase_07	AC	54 ms 36,632 KB
testcase_08	AC	128 ms 46,504 KB
testcase_09	AC	98 ms 42,248 KB
testcase_10	AC	94 ms 40,460 KB
testcase_11	AC	126 ms 45,208 KB
testcase_12	AC	173 ms 50,536 KB
testcase_13	AC	170 ms 50,044 KB
testcase_14	AC	60 ms 37,444 KB
testcase_15	AC	54 ms 37,316 KB
testcase_16	AC	86 ms 39,320 KB
testcase_17	AC	57 ms 36,912 KB
testcase_18	AC	62 ms 37,252 KB
testcase_19	AC	82 ms 38,844 KB
testcase_20	AC	96 ms 39,784 KB
testcase_21	AC	81 ms 39,956 KB
testcase_22	AC	68 ms 38,164 KB
testcase_23	AC	163 ms 49,288 KB
testcase_24	AC	163 ms 49,700 KB
testcase_25	AC	104 ms 41,236 KB
testcase_26	AC	85 ms 40,524 KB
testcase_27	AC	156 ms 46,968 KB
testcase_28	AC	56 ms 36,748 KB
testcase_29	AC	97 ms 39,272 KB
testcase_30	AC	58 ms 37,224 KB
testcase_31	AC	74 ms 38,368 KB
testcase_32	AC	119 ms 46,144 KB
testcase_33	AC	107 ms 41,624 KB
testcase_34	AC	146 ms 46,472 KB
testcase_35	AC	57 ms 36,772 KB
testcase_36	AC	88 ms 39,444 KB
testcase_37	AC	58 ms 36,932 KB
testcase_38	AC	57 ms 37,112 KB
testcase_39	AC	84 ms 39,120 KB
testcase_40	AC	58 ms 37,176 KB
testcase_41	AC	56 ms 36,916 KB
testcase_42	AC	54 ms 37,212 KB
testcase_43	AC	57 ms 37,396 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package no001;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;

public class Main {

	public static void main(String[] args) {
		IO io = new IO();
		int n = io.nextInt();
		int money = io.nextInt();
		int e = io.nextInt();
		int[] a = io.arrayInt(e);
		int[] b = io.arrayInt(e);
		int[] c = io.arrayInt(e);
		int[] d = io.arrayInt(e);
		Graph g = new Graph(n*(money+1));
		for(int i=0;i<e;i++) {
			for(int j=0;j<money;j++) {
				if (j + c[i] <= money) {
					g.addEdge((a[i]-1) + j * n, (b[i]-1) + (j + c[i]) * n, d[i]);
				}
			}
		}
		int[] dist = g.minDistDijkstra(0);
		int ans = Graph.INF;
		for(int i=0;i<=money;i++) {
			ans = Math.min(ans, dist[n - 1 + i * n]);
		}
		if (ans == Graph.INF) {
			System.out.println(-1);
		}else{
			System.out.println(ans);
		}
	}

}
class Graph {
	public static final int INF = 1<<29;
	int n;
	ArrayList<Edge>[] graph;

	@SuppressWarnings("unchecked")
	public Graph(int n) {
		this.n = n;
		this.graph = new ArrayList[n];
		for(int i=0;i<n;i++) {
			graph[i] = new ArrayList<Edge>();
		}
	}

	public void addBidirectionalEdge(int from,int to,int cost) {
		addEdge(from,to,cost);
		addEdge(to,from,cost);
	}
	public void addEdge(int from,int to,int cost) {
		graph[from].add(new Edge(to, cost));
	}

	//dijkstra O(ElogV)
	public int[] minDistDijkstra(int s) {
		int[] dist = new int[n];
		Arrays.fill(dist, INF);
		dist[s] = 0;
		PriorityQueue<Node> q = new PriorityQueue<Node>();
		q.offer(new Node(0, s));
		while(!q.isEmpty()) {
			Node node = q.poll();
			int v = node.id;
			if (dist[v] < node.dist) {
				continue;
			}
			for(Edge e:graph[v]) {
				if (dist[e.to] > dist[v] + e.cost) {
					dist[e.to] = dist[v] + e.cost;
					q.add(new Node(dist[e.to], e.to));
				}
			}
		}
		return dist;
	}

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

	class Node implements Comparable<Node>{
		int dist;
		int id;
		public Node(int dist,int i) {
			this.dist = dist;
			this.id = i;
		}
		public int compareTo(Node o) {
			return (this.dist < o.dist) ? -1 : ((this.dist == o.dist) ? 0 : 1);
		}
	}
}
class IO {
	private final InputStream in;
	private final PrintWriter out = new PrintWriter(System.out);
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() { this(System.in);}
	public IO(InputStream source) { this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
	private void skipNewLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++;}
	public boolean hasNext() { skipUnprintable(); return hasNextByte();}
	public boolean hasNextLine() { skipNewLine(); return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		char[] s = new char[len];
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] arrayInt(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] arrayLong(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] arrayDouble(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void arrayInt(int[]... a) {for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] matrixInt(int n,int m) { int[][] a = new int[n][m]; for(int i=0;i<n;i++) a[i] = arrayInt(m); return a;}
	public char[][] charMap(int n,int m) { char[][] a = new char[n][m]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void println(long x) { out.println(x);}
	public void println(double x) { out.println(x);}
	public void println(String s) { out.println(s);}
	public void println() { out.println(); }
	public void print(long x) { out.print(x); }
	public void print(double x) { out.print(x); }
	public void print(String s) { out.print(s); }
	public void print(char c) {out.print(c);}
	public void flush() {out.flush(); }
}

yukicoder

結果

テストケース

ソースコード