結果
問題 | 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 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 40 |
ソースコード
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(); } }