結果
| 問題 |
No.900 aδδitivee
|
| コンテスト | |
| ユーザー |
 uwi
|
| 提出日時 | 2019-10-04 21:53:01 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 493 ms / 2,000 ms |
| コード長 | 9,926 bytes |
| コンパイル時間 | 4,633 ms |
| コンパイル使用メモリ | 92,400 KB |
| 実行使用メモリ | 84,580 KB |
| 最終ジャッジ日時 | 2024-10-03 07:31:00 |
| 合計ジャッジ時間 | 14,943 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 27 |
ソースコード
package contest191004;
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 D {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni();
int[] from = new int[n - 1];
int[] to = new int[n - 1];
int[] ws = new int[n-1];
for (int i = 0; i < n - 1; i++) {
from[i] = ni();
to[i] = ni();
ws[i] = ni();
}
int[][] g = packU(n, from, to);
int[][] pars = parents3(g, 0);
int[] par = pars[0], ord = pars[1], dep = pars[2];
HeavyLightDecomposition hld = new HeavyLightDecomposition(g, par, ord, dep);
long[][][] fts = new long[hld.m][2][];
long[][] pluss = new long[hld.m][];
for(int i = 0;i < hld.m;i++) {
fts[i][0] = new long[hld.cluspath[i].length+5];
fts[i][1] = new long[hld.cluspath[i].length+5];
pluss[i] = new long[hld.cluspath[i].length+5];
}
int[][] rights = makeRights(g, par, 0);
int[] iord = rights[1], right = rights[2];
long[] ft = new long[n+5];
for(int i = 0;i < n-1;i++) {
int base = to[i];
if(par[from[i]] == to[i]) {
base = from[i];
}
addFenwick(ft, iord[base], ws[i]);
addFenwick(ft, right[iord[base]] + 1, -ws[i]);
}
for(int Q = ni();Q > 0;Q--) {
int t = ni();
if(t == 1) {
int a = ni(), x = ni();
int base = a;
int clus = hld.clus[base];
addFenwick(pluss[clus], hld.clusiind[base], x);
addRangeFenwick(fts[hld.clus[base]][0], fts[hld.clus[base]][1], hld.clusiind[base], hld.cluspath[clus].length, x);
}else {
int b = ni();
long ans = sumFenwick(ft, iord[b]);
long des = 0;
for(int x = b;x != -1;){
int cx = hld.clus[x];
int r = hld.clusiind[x];
ans += sumRangeFenwick(fts[cx][0], fts[cx][1], r-1);
ans += sumFenwick(pluss[cx], r) * des;
des += r+1;
x = par[hld.cluspath[cx][0]];
}
out.println(ans);
}
}
}
public static void addRangeFenwick(long[] ft0, long[] ft1, int i, long v)
{
addFenwick(ft1, i+1, -v);
addFenwick(ft1, 0, v);
addFenwick(ft0, i+1, v*(i+1));
}
public static void addRangeFenwick(long[] ft0, long[] ft1, int a, int b, long v)
{
if(a <= b){
addFenwick(ft1, b+1, -v);
addFenwick(ft0, b+1, v*(b+1));
addFenwick(ft1, a, v);
addFenwick(ft0, a, -v*a);
}
}
public static long sumRangeFenwick(long[] ft0, long[] ft1, int i)
{
return sumFenwick(ft1, i) * (i+1) + sumFenwick(ft0, i);
}
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 i, long v)
{
if(v == 0)return;
int n = ft.length;
for(i++;i < n;i += i&-i)ft[i] += v;
}
public static int[] sortByPreorder(int[][] g, int root){
int n = g.length;
int[] stack = new int[n];
int[] ord = new int[n];
boolean[] ved = new boolean[n];
stack[0] = root;
int p = 1;
int r = 0;
ved[root] = true;
while(p > 0){
int cur = stack[p-1];
ord[r++] = cur;
p--;
for(int e : g[cur]){
if(!ved[e]){
ved[e] = true;
stack[p++] = e;
}
}
}
return ord;
}
/**
* ルートrootの木gに対し、行きがけ順で訪れたときの各ノードの子孫を表す範囲の終端を計算する。
* 格納はソート順で行われている。ルートが[0]に対応する。
* [ord, iord, right]
*
* @usage ノード番号xに対して対応する範囲は[iord[x], right[iord[x]]].
* @param g
* @param par
* @param root
* @return
*/
public static int[][] makeRights(int[][] g, int[] par, int root)
{
int n = g.length;
int[] ord = sortByPreorder(g, root);
int[] iord = new int[n];
for(int i = 0;i < n;i++)iord[ord[i]] = i;
int[] right = new int[n];
for(int i = n-1;i >= 1;i--){
if(right[i] == 0)right[i] = i;
int p = iord[par[ord[i]]];
right[p] = Math.max(right[p], right[i]);
}
return new int[][]{ord, iord, right};
}
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;
}
}
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 D().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)); }
}