結果
問題 | No.900 aδδitivee |
ユーザー | 37zigen |
提出日時 | 2020-04-06 18:14:54 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 451 ms / 2,000 ms |
コード長 | 4,262 bytes |
コンパイル時間 | 2,306 ms |
コンパイル使用メモリ | 76,620 KB |
実行使用メモリ | 93,740 KB |
最終ジャッジ日時 | 2023-09-20 20:09:30 |
合計ジャッジ時間 | 14,457 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
51,224 KB |
testcase_01 | AC | 43 ms
51,232 KB |
testcase_02 | AC | 47 ms
51,300 KB |
testcase_03 | AC | 47 ms
51,700 KB |
testcase_04 | AC | 46 ms
51,284 KB |
testcase_05 | AC | 46 ms
51,236 KB |
testcase_06 | AC | 45 ms
51,296 KB |
testcase_07 | AC | 433 ms
82,316 KB |
testcase_08 | AC | 431 ms
82,668 KB |
testcase_09 | AC | 420 ms
82,112 KB |
testcase_10 | AC | 448 ms
84,764 KB |
testcase_11 | AC | 434 ms
83,056 KB |
testcase_12 | AC | 419 ms
82,072 KB |
testcase_13 | AC | 451 ms
82,420 KB |
testcase_14 | AC | 447 ms
82,868 KB |
testcase_15 | AC | 416 ms
82,476 KB |
testcase_16 | AC | 421 ms
81,712 KB |
testcase_17 | AC | 432 ms
80,604 KB |
testcase_18 | AC | 445 ms
82,332 KB |
testcase_19 | AC | 443 ms
82,564 KB |
testcase_20 | AC | 448 ms
82,716 KB |
testcase_21 | AC | 436 ms
82,296 KB |
testcase_22 | AC | 410 ms
92,268 KB |
testcase_23 | AC | 417 ms
93,740 KB |
testcase_24 | AC | 418 ms
92,260 KB |
testcase_25 | AC | 373 ms
92,384 KB |
testcase_26 | AC | 422 ms
92,956 KB |
testcase_27 | AC | 366 ms
92,356 KB |
testcase_28 | AC | 414 ms
92,324 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.NoSuchElementException; class Edge{ int src,dst; long cost; public Edge(int src_,int dst_,long cost_) { src=src_; dst=dst_; cost=cost_; } } class BIT{ int n; long[] a; public BIT(int n) { this.n=n; a=new long[n+1]; } void add(int k,long v) { for(++k;k<=n;k+=k&-k) { a[k]+=v; } } //[0...k] long sum(int k) { long ret=0; for(++k;k>0;k-=k&-k) { ret+=a[k]; } return ret; } // (l...r] long sum(int l,int r) { return sum(r-1)-sum(l-1); } } public class Main implements Runnable{ public static void main(String[] args) { new Thread(null,new Main(), "" ,Runtime.getRuntime().maxMemory()).start(); } int pointer=0; void dfs(int cur,int par,ArrayList<Edge>[] g,long[] base,int[] depth,int[] in,int[] out) { in[cur]=pointer++; for(Edge e:g[cur]) { if(e.dst==par)continue; base[e.dst]=base[cur]+e.cost; depth[e.dst]=depth[cur]+1; dfs(e.dst,cur,g,base,depth,in,out); } out[cur]=pointer; } public void run() { FastScanner sc=new FastScanner(); PrintWriter pw=new PrintWriter(System.out); int N=sc.nextInt(); ArrayList<Edge>[] g=new ArrayList[N]; long[] base=new long[N]; int[] depth=new int[N]; long[] A=new long[N]; int[] in=new int[N]; int[] out=new int[N]; BIT bit0=new BIT(N); BIT bit1=new BIT(N); for(int i=0;i<N;++i)g[i]=new ArrayList<>(); for(int i=0;i<N-1;++i) { int u=sc.nextInt(); int v=sc.nextInt(); int w=sc.nextInt(); g[u].add(new Edge(u,v,w)); g[v].add(new Edge(v,u,w)); } dfs(0,-1,g,base,depth,in,out); int Q=sc.nextInt(); for(int q=0;q<Q;++q) { int type=sc.nextInt(); if(type==1) { int a=sc.nextInt(); int x=sc.nextInt(); bit0.add(in[a], -x*depth[a]); bit0.add(out[a], x*depth[a]); bit1.add(in[a], x); bit1.add(out[a], -x); }else { int b=sc.nextInt(); pw.println(bit0.sum(0,in[b]+1)+bit1.sum(0,in[b]+1)*depth[b]+base[b]); } } pw.close(); } void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));} } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; 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;} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(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 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 double nextDouble() { return Double.parseDouble(next());} }