結果
問題 | No.1103 Directed Length Sum |
ユーザー | shojin_pro |
提出日時 | 2020-07-03 22:56:05 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
|
実行時間 | - |
コード長 | 4,217 bytes |
コンパイル時間 | 2,532 ms |
コンパイル使用メモリ | 79,344 KB |
実行使用メモリ | 290,928 KB |
最終ジャッジ日時 | 2024-09-17 04:37:18 |
合計ジャッジ時間 | 8,258 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge6 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
57,284 KB |
testcase_01 | AC | 53 ms
50,412 KB |
testcase_02 | TLE | - |
testcase_03 | -- | - |
testcase_04 | -- | - |
testcase_05 | -- | - |
testcase_06 | -- | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
ソースコード
import java.util.*; import java.io.*; public class Main { static long[] cum; public static void main(String[] args) throws Exception { FastScanner sc = new FastScanner(System.in); long mod = (long)Math.pow(10,9)+7; int n = sc.nextInt(); int[] from = new int[n+1]; cum = new long[n+1]; ArrayList<ArrayList<Integer>> map = new ArrayList<>(); for(int i = 0; i <= n; i++){ map.add(new ArrayList<>()); if(i != 0){ cum[i] += cum[i-1]+i; } } for(int i = 0; i < n-1; i++){ int a = sc.nextInt(); int b = sc.nextInt(); from[b] = a; map.get(a).add(b); } int root = 0; for(int i = 1; i <= n; i++){ if(from[i] == 0){ root = i; break; } } //System.out.println(root); boolean[] arrived = new boolean[n+1]; arrived[root] = true; long ans = dfs(map,root,0,arrived); System.out.println(ans); } public static long dfs(ArrayList<ArrayList<Integer>> map, int now, int dist, boolean[] arrived){ long ret = 0; for(int next : map.get(now)){ if(!arrived[next]){ ret += cum[dist+1]; arrived[now] = true; ret += dfs(map,next,dist+1,arrived); arrived[now] = false; } } return ret; } } class Combination { final static long mod = (long)Math.pow(10,9)+ 7; private static long[] fact, ifact; public Combination(int n){ fact = new long[n+1]; ifact = new long[n+1]; fact[0] = 1; long ln = n; for (long i = 1; i <= ln; ++i){ int ii = (int)i; fact[ii] = fact[ii-1]%mod * i % mod; } ifact[n] = pow(fact[n],this.mod-2); for (int i = n; i >= 1; --i){ int ii = (int)i; ifact[ii-1] = ifact[ii]%mod*i%mod; } } public static long comb(int n, int k){ if (k < 0 || k > n) return 0; return fact[n] % mod * ifact[k] % mod * ifact[n-k] % mod; } public static long perm(int n, int k){ return comb(n,k) * fact[k] % mod; } public static long pow(long a,long b) { long ret = 1; long tmp = a; while(b>0) { if((b&1)==1){ ret = (ret * tmp) % mod; } tmp = (tmp * tmp) % mod; b = b>>1; } return ret; } } class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String[] nextArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = next(); return a; } 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; } }