結果
問題 | No.872 All Tree Path |
ユーザー |
|
提出日時 | 2019-08-30 21:25:45 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 447 ms / 3,000 ms |
コード長 | 4,989 bytes |
コンパイル時間 | 4,242 ms |
コンパイル使用メモリ | 91,960 KB |
実行使用メモリ | 78,140 KB |
最終ジャッジ日時 | 2024-11-21 21:53:16 |
合計ジャッジ時間 | 10,428 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
package contest190830;import java.io.ByteArrayInputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.Arrays;import java.util.InputMismatchException;public class C {InputStream is;PrintWriter out;String INPUT = "";void solve(){int n = ni();int[] from = new int[n - 1];int[] to = new int[n - 1];int[] w = new int[n-1];for (int i = 0; i < n - 1; i++) {from[i] = ni() - 1;to[i] = ni() - 1;w[i] = ni();}int[][][] g = packWU(n, from, to, w);int[][] pars = parents(g, 0);int[] par = pars[0], ord = pars[1], dep = pars[2], pw = pars[4];int[] des = new int[n];Arrays.fill(des, 1);long ans = 0;for(int i = n-1;i > 0;i--) {des[par[ord[i]]] += des[ord[i]];ans += (long)des[ord[i]] * (n-des[ord[i]]) * pw[ord[i]];}out.println(ans*2);}public static int[][][] packWU(int n, int[] from, int[] to, int[] w) {int[][][] g = new int[n][][];int[] p = new int[n];for (int f : from)p[f]++;for (int t : to)p[t]++;for (int i = 0; i < n; i++)g[i] = new int[p[i]][2];for (int i = 0; i < from.length; i++) {--p[from[i]];g[from[i]][p[from[i]]][0] = to[i];g[from[i]][p[from[i]]][1] = w[i];--p[to[i]];g[to[i]][p[to[i]]][0] = from[i];g[to[i]][p[to[i]]][1] = w[i];}return g;}public static int[][] parents(int[][][] g, int root) {int n = g.length;int[] par = new int[n];Arrays.fill(par, -1);int[] dw = new int[n];int[] pw = new int[n];int[] dep = new int[n];int[] q = new int[n];q[0] = root;for (int p = 0, r = 1; p < r; p++) {int cur = q[p];for (int[] nex : g[cur]) {if (par[cur] != nex[0]) {q[r++] = nex[0];par[nex[0]] = cur;dep[nex[0]] = dep[cur] + 1;dw[nex[0]] = dw[cur] + nex[1];pw[nex[0]] = nex[1];}}}return new int[][] { par, q, dep, dw, pw };}static int[][] packU(int n, int[] from, int[] to) {int[][] g = new int[n][];int[] p = new int[n];for (int f : from)p[f]++;for (int t : to)p[t]++;for (int i = 0; i < n; i++)g[i] = new int[p[i]];for (int i = 0; i < from.length; i++) {g[from[i]][--p[from[i]]] = to[i];g[to[i]][--p[to[i]]] = from[i];}return g;}void run() throws Exception{is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());out = new PrintWriter(System.out);long s = System.currentTimeMillis();solve();out.flush();if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");// Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){// @Override// public void run() {// long s = System.currentTimeMillis();// solve();// out.flush();// if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");// }// };// t.start();// t.join();}public static void main(String[] args) throws Exception { new C().run(); }private byte[] inbuf = new byte[1024];public int lenbuf = 0, ptrbuf = 0;private int readByte(){if(lenbuf == -1)throw new InputMismatchException();if(ptrbuf >= lenbuf){ptrbuf = 0;try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }if(lenbuf <= 0)return -1;}return inbuf[ptrbuf++];}private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }private double nd() { return Double.parseDouble(ns()); }private char nc() { return (char)skip(); }private String ns(){int b = skip();StringBuilder sb = new StringBuilder();while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')sb.appendCodePoint(b);b = readByte();}return sb.toString();}private char[] ns(int n){char[] buf = new char[n];int b = skip(), p = 0;while(p < n && !(isSpaceChar(b))){buf[p++] = (char)b;b = readByte();}return n == p ? buf : Arrays.copyOf(buf, p);}private int[] na(int n){int[] a = new int[n];for(int i = 0;i < n;i++)a[i] = ni();return a;}private long[] nal(int n){long[] a = new long[n];for(int i = 0;i < n;i++)a[i] = nl();return a;}private char[][] nm(int n, int m) {char[][] map = new char[n][];for(int i = 0;i < n;i++)map[i] = ns(m);return map;}private int[][] nmi(int n, int m) {int[][] map = new int[n][];for(int i = 0;i < n;i++)map[i] = na(m);return map;}private int ni() { return (int)nl(); }private long nl(){long num = 0;int b;boolean minus = false;while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));if(b == '-'){minus = true;b = readByte();}while(true){if(b >= '0' && b <= '9'){num = num * 10 + (b - '0');}else{return minus ? -num : num;}b = readByte();}}private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }}