結果
問題 | No.386 貪欲な領主 |
ユーザー |
![]() |
提出日時 | 2016-07-02 00:21:42 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 586 ms / 2,000 ms |
コード長 | 5,901 bytes |
コンパイル時間 | 2,565 ms |
コンパイル使用メモリ | 80,708 KB |
実行使用メモリ | 103,192 KB |
最終ジャッジ日時 | 2024-10-12 19:35:18 |
合計ジャッジ時間 | 6,917 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 16 |
ソースコード
package no386;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.ArrayList;import java.util.InputMismatchException;import java.util.NoSuchElementException;public class Main implements Runnable {public static void main(String[] args) {new Thread(null, new Main(), "", 1024L * 1024L * 64).start(); //64MB}@SuppressWarnings("unchecked")@Overridepublic void run() {IO io = new IO();int n = io.nextInt();ArrayList<Integer>[] edge = new ArrayList[n];for(int i=0;i<n;i++) {edge[i] = new ArrayList<>();}for(int i=0;i<n-1;i++) {int a = io.nextInt();int b = io.nextInt();edge[a].add(b);edge[b].add(a);}int logn = 32 - Integer.numberOfLeadingZeros(n);int[][] parent = new int[logn+1][n];int[] depth = new int[n];dfs(-1, 0, 0, edge, parent[0], depth);for(int i=1;i<=logn;i++) {for(int j=0;j<n;j++) {parent[i][j] = parent[i-1][j] < 0 ? -1 : parent[i-1][parent[i-1][j]];}}int[] c = io.nextIntArray(n);long[][] sum = new long[logn+1][n];for(int i=0;i<n;i++) {sum[0][i] = parent[0][i] < 0 ? 0 : c[parent[0][i]];}for(int i=1;i<=logn;i++) {for(int j=0;j<n;j++) {sum[i][j] = parent[i][j] < 0 ? 0 : sum[i-1][j] + sum[i-1][parent[i-1][j]];}}// System.out.println(Arrays.deepToString(parent));// System.out.println(Arrays.deepToString(sum));long ans = 0;int q = io.nextInt();for(int qq=0;qq<q;qq++) {int u = io.nextInt();int v = io.nextInt();long mult = io.nextLong();long psum = c[u] + c[v];if (depth[u] > depth[v]) {int temp = u;u = v;v = temp;}for(int k=0;k<=logn;k++) {if ((depth[v] - depth[u] >> k & 1) == 1) {psum += sum[k][v];v = parent[k][v];}}if (u != v) {for(int k=logn;k>=0;k--) {if (parent[k][u] != parent[k][v]) {psum += sum[k][u] + sum[k][v];u = parent[k][u];v = parent[k][v];}}u = parent[0][u];v = parent[0][v];psum += c[u] + c[v];}psum -= c[u];// System.out.println("lca:" + u);// System.out.println(psum);ans += psum * mult;}System.out.println(ans);}public void dfs(int p,int v,int d,ArrayList<Integer>[] edge,int[] parent,int[] depth) {parent[v] = p;depth[v] = d;for(int u: edge[v]) {if (u == p) continue;dfs(v, u, d+1, edge, parent, depth);}}}class IO extends PrintWriter {private final InputStream in;private final byte[] buffer = new byte[1024];private int ptr = 0;private int buflen = 0;public IO() { this(System.in);}public IO(InputStream source) { super(System.out); 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';}public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; 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) {if (!hasNext()) {throw new NoSuchElementException();}char[] s = new char[len];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[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}public void nextIntArrays(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[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}public void close() { super.close(); try {in.close();} catch (IOException e) {}}}