結果
問題 | No.1103 Directed Length Sum |
ユーザー | 37zigen |
提出日時 | 2020-08-07 18:54:12 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 2,920 ms / 3,000 ms |
コード長 | 3,401 bytes |
コンパイル時間 | 2,661 ms |
コンパイル使用メモリ | 79,732 KB |
実行使用メモリ | 273,904 KB |
最終ジャッジ日時 | 2024-09-24 16:01:44 |
合計ジャッジ時間 | 30,643 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
49,908 KB |
testcase_01 | AC | 52 ms
50,112 KB |
testcase_02 | AC | 1,406 ms
273,904 KB |
testcase_03 | AC | 1,187 ms
230,944 KB |
testcase_04 | AC | 1,594 ms
174,832 KB |
testcase_05 | AC | 2,920 ms
265,544 KB |
testcase_06 | AC | 1,191 ms
120,964 KB |
testcase_07 | AC | 399 ms
72,660 KB |
testcase_08 | AC | 532 ms
79,940 KB |
testcase_09 | AC | 242 ms
63,228 KB |
testcase_10 | AC | 669 ms
98,116 KB |
testcase_11 | AC | 1,673 ms
177,216 KB |
testcase_12 | AC | 1,069 ms
123,408 KB |
testcase_13 | AC | 696 ms
98,808 KB |
testcase_14 | AC | 193 ms
60,088 KB |
testcase_15 | AC | 860 ms
115,488 KB |
testcase_16 | AC | 1,914 ms
195,344 KB |
testcase_17 | AC | 1,931 ms
199,268 KB |
testcase_18 | AC | 640 ms
87,096 KB |
testcase_19 | AC | 1,757 ms
189,684 KB |
testcase_20 | AC | 310 ms
65,856 KB |
testcase_21 | AC | 483 ms
80,056 KB |
testcase_22 | AC | 1,528 ms
167,616 KB |
testcase_23 | AC | 877 ms
117,680 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.NoSuchElementException; 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;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); 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 class Main { public static void main(String[] args) { long curtime=System.currentTimeMillis(); new Main().run(); System.err.println(System.currentTimeMillis()-curtime); } final long MOD=(long)1e9+7; void run() { FastScanner sc=new FastScanner(); int N=(int)sc.nextLong(); ArrayList<Integer>[] g=new ArrayList[N]; for (int i=0;i<N;++i) g[i]=new ArrayList<>(); boolean[] isroot=new boolean[N]; Arrays.fill(isroot, true); for (int i=0;i<N-1;++i) { int a=(int)sc.nextLong(); int b=(int)sc.nextLong(); --a;--b; g[a].add(b); g[b].add(a); isroot[b]=false; } int root=-1; for (int i=0;i<N;++i) if (isroot[i]) root=i; ArrayList<Integer> order=new ArrayList<>(); ArrayDeque<Integer> stack=new ArrayDeque<>(); int[] d=new int[N]; int[] sz=new int[N]; stack.addFirst(root); while (!stack.isEmpty()) { int v=stack.pollFirst(); order.add(v); for (int dst:g[v]) { g[dst].remove((Integer)v); d[dst]=d[v]+1; stack.addFirst(dst); } } long ans=0; for (int i=order.size()-1;i>=0;--i) { int v=order.get(i); sz[v]=1; for (int dst:g[v]) sz[v]+=sz[dst]; ans+=(long)d[v]*sz[v]%MOD; if (ans>=MOD) ans-=MOD; } System.out.println(ans); } void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));} }