結果
| 問題 | No.1038 TreeAddQuery |
| ユーザー |
 uwi
|
| 提出日時 | 2020-06-25 04:36:20 |
| 言語 | Java (openjdk 23) |
| 結果 |
MLE
|
| 実行時間 | - |
| コード長 | 13,622 bytes |
| コンパイル時間 | 4,645 ms |
| コンパイル使用メモリ | 89,948 KB |
| 実行使用メモリ | 746,632 KB |
| 最終ジャッジ日時 | 2024-07-03 20:35:13 |
| 合計ジャッジ時間 | 37,564 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 23 MLE * 1 |
ソースコード
package contest200424;import java.io.ByteArrayInputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.Arrays;import java.util.InputMismatchException;// 重心分解する// add: 重心木のxの先祖のノードsに対して、y-d(x,s)の位置にzを加算。下の除く処理のために各ネックでも加算// sum: 重心木のxの先祖のノードsに対して、d(x,s)以上の位置の値の合計を計算。ただしsのx側のネックは除く//public class F2 {InputStream is;PrintWriter out;String INPUT = "";void solve(){int n = ni(), Q = ni();int[] from = new int[n - 1];int[] to = new int[n - 1];for (int i = 0; i < n - 1; i++) {from[i] = ni() - 1;to[i] = ni() - 1;}int[][] g = packU(n, from, to);int[][] pars = parents3(g, 0);int[] par = pars[0], ord = pars[1], dep = pars[2];int[] cpar = buildCentroidTree(g);maxds = new int[n];ctneck = new int[n];Context cx = dfsTopCT(cpar, g);long[][] plus = new long[n][];long[] plusall = new long[n];for(int i = 0;i < n;i++){plus[i] = new long[maxds[i]+1+3];}long[][][] minus = new long[n][][];long[][] minusall = new long[n][];for(int i = 0;i < n;i++){minus[i] = new long[ctneck[i]][maxds[i]+1+3];minusall[i] = new long[ctneck[i]];}HeavyLightDecomposition hld = new HeavyLightDecomposition(g, par, ord, dep);for(int z = 0;z < Q;z++){int x = ni()-1, D = ni(), Z = ni();long val = 0;for(int u = x;u != -1;u = cpar[u]){int d = d(u, x, hld, dep);// tr(x, D, Z, u, d);// tr(plusall[u], restoreFenwick(plus[u]));val += plusall[u] - sumFenwick(plus[u], d-1);// tr(val);if(d <= D){addFenwick(plus[u], Math.min(maxds[u], D-d), Z);plusall[u] += Z;}int neckind = cx.neckind[u];int pu = cpar[u];if(pu != -1){int pd = d(pu, x, hld, dep);val -= minusall[pu][neckind] - sumFenwick(minus[pu][neckind], Math.min(pd-1, maxds[pu]));if(D-pd >= 0){addFenwick(minus[pu][neckind], Math.min(maxds[pu], D-pd), Z);minusall[pu][neckind] += Z;}}}out.println(val);}}public static long[] restoreFenwick(long[] ft){int n = ft.length-1;long[] ret = new long[n];for(int i = 0;i < n;i++)ret[i] = sumFenwick(ft, i);for(int i = n-1;i >= 1;i--)ret[i] -= ret[i-1];return ret;}public static long sumFenwick(long[] ft, int i){long sum = 0;for(i++;i > 0;i -= i&-i)sum += ft[i];return sum;}public static void addFenwick(long[] ft, int l, int r, long v){addFenwick(ft, l, v);addFenwick(ft, r, -v);}public static void addFenwick(long[] ft, int i, long v){if(v == 0)return;int n = ft.length;for(i++;i < n;i += i&-i)ft[i] += v;}static int d(int x, int y, HeavyLightDecomposition hld, int[] dep){int lca = hld.lca(x, y);return dep[x] + dep[y] - 2*dep[lca];}public static int[] buildCentroidTree(int[][] g) {int n = g.length;int[] ctpar = new int[n];Arrays.fill(ctpar, -1);buildCentroidTree(g, 0, new boolean[n], new int[n], new int[n], new int[n], ctpar);return ctpar;}private static int buildCentroidTree(int[][] g, int root, boolean[] sed, int[] par, int[] ord, int[] des, int[] ctpar){// parent and level-orderord[0] = root;par[root] = -1;int r = 1;for(int p = 0;p < r;p++) {int cur = ord[p];for(int nex : g[cur]){if(par[cur] != nex && !sed[nex]){ord[r++] = nex;par[nex] = cur;}}}// if(r == 1)return;// DP and find a separatorint sep = -1; // always existsouter:for(int i = r-1;i >= 0;i--){int cur = ord[i];des[cur] = 1;for(int e : g[cur]){if(par[cur] != e && !sed[e])des[cur] += des[e];}if(r-des[cur] <= r/2){for(int e : g[cur]){if(par[cur] != e && !sed[e] && des[e] >= r/2+1)continue outer;}sep = cur;break;}}sed[sep] = true;for(int e : g[sep]){if(!sed[e])ctpar[buildCentroidTree(g, e, sed, par, ord, des, ctpar)] = sep;}return sep;}/*** w: 頂点重み* wt: weight table. wt[i] = (頂点iのsepからの重み合計。sepは含まない)* dt: distance table. dt[i] = (頂点iのsepからの距離)* vs: vertices. vssのテンポラリ* vss: vertices. vss[j] = (j番目のneckにある頂点のpreorder)* ctch: children of centroid tree* stack, inds: テンポラリ* @author uwi**/static class Context{boolean[] seps; // is separator?long[] wt; // [ind] = w between sep and indint[] dt;int[] vs;int[][] vss; // [neckind][vertices]int[][] ctch;int[][] g;int[] stack;int[] inds;int[] neckind;int[] cpar;}int[] maxds;int[] ctneck;public Context dfsTopCT(int[] cpar, int[][] g) {int n = g.length;int ctroot = -1;for(int i = 0;i < n;i++)if(cpar[i] == -1)ctroot = i;Context cx = new Context();cx.cpar = cpar;cx.seps = new boolean[n];cx.wt = new long[n];cx.dt = new int[n];cx.vs = new int[n];cx.vss = new int[n][];cx.ctch = parentToChildren(cpar);cx.g = g;cx.stack = new int[n];cx.inds = new int[n];cx.neckind = new int[n];dfs(ctroot, cx);return cx;}private void dfs(int sep, Context cx){cx.seps[sep] = true;int neckp = 0;for(int neck : cx.g[sep]){if(cx.seps[neck])continue;int sp = 0;cx.inds[sp] = 0;// cx.wt[neck] = w[neck];cx.dt[neck] = 1;int vsp = 0;cx.stack[sp++] = neck;while(sp > 0){int cur = cx.stack[sp-1];if(cx.inds[sp-1] == 0){cx.vs[vsp++] = cur;if(cx.cpar[cur] == sep)cx.neckind[cur] = neckp;}if(cx.inds[sp-1] == cx.g[cur].length){sp--;continue;}int e = cx.g[cur][cx.inds[sp-1]++];if(!cx.seps[e] && !(sp-2 >= 0 && e == cx.stack[sp-2])){// cx.wt[e] = cx.wt[cur] + w[e];cx.dt[e] = sp + 1;cx.stack[sp] = e;cx.inds[sp] = 0;sp++;}}cx.vss[neckp] = Arrays.copyOf(cx.vs, vsp);neckp++;}ctneck[sep] = neckp;process(sep, cx, Arrays.copyOf(cx.vss, neckp));for(int e : cx.ctch[sep])dfs(e, cx);}public static int[][] parentToChildren(int[] par){int n = par.length;int[] ct = new int[n];for(int i = 0;i < n;i++){if(par[i] >= 0){ct[par[i]]++;}}int[][] g = new int[n][];for(int i = 0;i < n;i++){g[i] = new int[ct[i]];}for(int i = 0;i < n;i++){if(par[i] >= 0){g[par[i]][--ct[par[i]]] = i;}}return g;}private void process(int sep, Context cx, int[][] vss){for(int[] vs : vss){for(int v : vs){maxds[sep] = Math.max(maxds[sep], cx.dt[v]);}}}public static class HeavyLightDecomposition {public int[][] g;public int[] clus;public int[][] cluspath;public int[] clusiind;public int[] par, dep;public int m;public HeavyLightDecomposition(int[][] g, int[] par, int[] ord, int[] dep){init(g, par, ord, dep);}public void init(int[][] g, int[] par, int[] ord, int[] dep){clus = decomposeToHeavyLight(g, par, ord);cluspath = clusPaths(clus, ord);clusiind = clusIInd(cluspath, g.length);this.m = cluspath.length;this.par = par;this.dep = dep;this.g = g;}public static int[] decomposeToHeavyLight(int[][] g, int[] par, int[] ord){int n = g.length;int[] size = new int[n];Arrays.fill(size, 1);for(int i = n-1;i > 0;i--)size[par[ord[i]]] += size[ord[i]];int[] clus = new int[n];Arrays.fill(clus, -1);int p = 0;for(int i = 0;i < n;i++){int u = ord[i];if(clus[u] == -1)clus[u] = p++;// centroid path (not heavy path)int argmax = -1;for(int v : g[u]){if(par[u] != v && (argmax == -1 || size[v] > size[argmax]))argmax = v;}if(argmax != -1)clus[argmax] = clus[u];}return clus;}public static int[][] clusPaths(int[] clus, int[] ord){int n = clus.length;int[] rp = new int[n];int sup = 0;for(int i = 0;i < n;i++){rp[clus[i]]++;sup = Math.max(sup, clus[i]);}sup++;int[][] row = new int[sup][];for(int i = 0;i < sup;i++)row[i] = new int[rp[i]];for(int i = n-1;i >= 0;i--){row[clus[ord[i]]][--rp[clus[ord[i]]]] = ord[i];}return row;}public static int[] clusIInd(int[][] clusPath, int n){int[] iind = new int[n];for(int[] path : clusPath){for(int i = 0;i < path.length;i++){iind[path[i]] = i;}}return iind;}public int lca(int x, int y){int rx = cluspath[clus[x]][0];int ry = cluspath[clus[y]][0];while(clus[x] != clus[y]){if(dep[rx] > dep[ry]){x = par[rx];rx = cluspath[clus[x]][0];}else{y = par[ry];ry = cluspath[clus[y]][0];}}return clusiind[x] > clusiind[y] ? y : x;}public int ancestor(int x, int v){while(x != -1){if(v <= clusiind[x])return cluspath[clus[x]][clusiind[x]-v];v -= clusiind[x]+1;x = par[cluspath[clus[x]][0]];}return x;}// [iord[x], right[x])public int[][] makeRights(){int root = -1;int n = g.length;for(int i = 0;i < n;i++)if(par[i] == -1)root = i;int[] ord = new int[n];int[] right = new int[n];int[] curs = new int[n];int[] inds = new int[n];int sp = 0, p = 0;curs[sp++] = root;while(sp > 0){int cur = curs[sp-1];int ind = inds[sp-1];inds[sp-1]++;if(ind == 0){ord[p++] = cur;for(int e : g[cur]){if(par[cur] == e)continue;if(clus[cur] == clus[e]){curs[sp] = e;inds[sp] = 0;sp++;break;}}}else if(ind-1 < g[cur].length){int e = g[cur][ind-1];if(e == par[cur])continue;if(clus[cur] == clus[e])continue;curs[sp] = e;inds[sp] = 0;sp++;}else{right[cur] = p;sp--;}}int[] iord = new int[n];for(int i = 0;i < n;i++)iord[ord[i]] = i;return new int[][]{ord, iord, right};}}public static int[][] parents3(int[][] g, int root) {int n = g.length;int[] par = new int[n];Arrays.fill(par, -1);int[] depth = new int[n];depth[0] = 0;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) {q[r++] = nex;par[nex] = cur;depth[nex] = depth[cur] + 1;}}}return new int[][] { par, q, depth };}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 F2().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)); }}