結果
| 問題 | No.468 役に立つ競技プログラミング実践編 |
| ユーザー |
 tanzaku
|
| 提出日時 | 2016-12-18 00:18:44 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 276 ms / 2,000 ms |
| コード長 | 7,308 bytes |
| コンパイル時間 | 4,373 ms |
| コンパイル使用メモリ | 87,592 KB |
| 実行使用メモリ | 55,936 KB |
| 最終ジャッジ日時 | 2024-12-14 04:45:23 |
| 合計ジャッジ時間 | 11,759 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 31 |
| other | AC * 6 |
ソースコード
import java.io.*;import java.math.*;import java.util.*;import static java.util.Arrays.*;public class _468 {private static final int mod = (int)1e9+7;final Random random = new Random(0);final IOFast io = new IOFast();/// MAIN CODEpublic void run() throws IOException {// int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());int TEST_CASE = 1;while(TEST_CASE-- != 0) {int n = io.nextInt();int m = io.nextInt();WeightedAdjListGraph g = new WeightedAdjListGraph(n, m);WeightedAdjListGraph rg = new WeightedAdjListGraph(n, m);for (int i = 0; i < m; i++) {int a = io.nextInt();int b = io.nextInt();int c = io.nextInt();g.addEdge(a, b, c);rg.addEdge(b, a, c);}int[] time = g.doit();int ans = rg.undoit(time);io.out.println(time[n-1] + " " + ans + "/" + n);}}staticclass WeightedAdjListGraph {int m, V, E;int[] head, next, cost, to, in;public WeightedAdjListGraph(int V, int E) {head = new int[V];next = new int[E];cost = new int[E];to = new int[E];in = new int[V];this.V = V;this.E = E;clear();}public void clear() {m = 0;Arrays.fill(head, -1);}public void addEdge(int s, int t, int c) {next[m] = head[s];cost[m] = c;head[s] = m;to[m++] = t;in[t]++;}int[] doit() {int[] q = new int[V];int[] time = new int[V];int t = 0;q[t++] = 0;for (int i = 0; i < V; i++) {int v = q[i];for (int e = head[v]; e != -1; e = next[e]) {time[to[e]] = Math.max(time[to[e]], time[v] + cost[e]);if (--in[to[e]] == 0) {q[t++] = to[e];}// dump(i, v, to[e], in[to[e]]);}}return time;}int undoit(int[] time) {boolean[] vis = new boolean[V];int[] q = new int[V];int t = 0;q[t++] = V-1;for (int i = 0; i < t; i++) {int v = q[i];for (int e = head[v]; e != -1; e = next[e]) {if (time[to[e]] + cost[e] == time[v] && !vis[to[e]]) {q[t++] = to[e];vis[to[e]] = true;// dump(v, to[e], time[to[e]], cost[e], time[v]);}}}return V - t;}}/// TEMPLATEstatic int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); }void main() throws IOException {// IOFast.setFileIO("rle-size.in", "rle-size.out");try { run(); }catch (EndOfFileRuntimeException e) { }io.out.flush();}public static void main(String[] args) throws IOException { new _468().main(); }static class EndOfFileRuntimeException extends RuntimeException {private static final long serialVersionUID = -8565341110209207657L; }staticpublic class IOFast {private InputStream in = System.in;private PrintWriter out = new PrintWriter(System.out);private static int pos, readLen;private static final byte[] buffer = new byte[1024 * 8];private static char[] str = new char[500*8*2];private static boolean[] isDigit = new boolean[256];private static boolean[] isSpace = new boolean[256];private static boolean[] isLineSep = new boolean[256];static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] =isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }public byte read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw newEndOfFileRuntimeException(); } } return buffer[pos++]; }public int nextInt() throws IOException {byte first = (byte)nextChar();boolean minus = false;int res = 0;if (first == '-') {minus = true;} else {res = first - '0';}while (true) {byte b = read();if (isSpace[b]) break;res = res * 10 + b - '0';}return minus ? -res : res;}public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length ==len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } }catch(EndOfFileRuntimeException e) { ; } return len; }int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; }cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r'){ len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }public String nextString() throws IOException { return new String(next()); }public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }// public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }// public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }public double nextDouble() throws IOException {double res = nextChar() - '0';while (true) {byte c = read();if (isSpace[c]) return res;if (c == '.') break;res = res * 10 + c - '0';}double d = 1;while (true) {byte c = read();// dump(c);if (!isDigit[c]) break;res = res * 10 + c - '0';d *= 10;}// dump(1);return res / d;}public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); }return res; }public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) {res[i] = nextIntArray(k); } return res; }public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i <n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] =nextDouble(); } return res; }}}