結果
問題 | No.1103 Directed Length Sum |
ユーザー | shojin_pro |
提出日時 | 2020-07-04 00:09:57 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 958 ms / 3,000 ms |
コード長 | 3,091 bytes |
コンパイル時間 | 2,550 ms |
コンパイル使用メモリ | 78,988 KB |
実行使用メモリ | 87,740 KB |
最終ジャッジ日時 | 2023-10-17 06:35:38 |
合計ジャッジ時間 | 16,529 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
53,488 KB |
testcase_01 | AC | 52 ms
53,488 KB |
testcase_02 | AC | 598 ms
85,088 KB |
testcase_03 | AC | 642 ms
85,144 KB |
testcase_04 | AC | 511 ms
72,880 KB |
testcase_05 | AC | 751 ms
84,280 KB |
testcase_06 | AC | 556 ms
67,808 KB |
testcase_07 | AC | 260 ms
59,232 KB |
testcase_08 | AC | 320 ms
61,228 KB |
testcase_09 | AC | 208 ms
58,920 KB |
testcase_10 | AC | 401 ms
67,208 KB |
testcase_11 | AC | 872 ms
83,896 KB |
testcase_12 | AC | 699 ms
77,216 KB |
testcase_13 | AC | 378 ms
66,596 KB |
testcase_14 | AC | 194 ms
58,320 KB |
testcase_15 | AC | 584 ms
74,976 KB |
testcase_16 | AC | 905 ms
87,440 KB |
testcase_17 | AC | 912 ms
87,740 KB |
testcase_18 | AC | 396 ms
66,020 KB |
testcase_19 | AC | 958 ms
83,816 KB |
testcase_20 | AC | 245 ms
58,792 KB |
testcase_21 | AC | 307 ms
61,216 KB |
testcase_22 | AC | 562 ms
72,620 KB |
testcase_23 | AC | 595 ms
69,640 KB |
ソースコード
import java.util.*; import java.io.*; public class Main { static boolean[] arrived; static long[] cum; public static void main(String[] args) throws Exception { long mod = (long)Math.pow(10,9)+7; FastScanner sc = new FastScanner(System.in); int n = sc.nextInt(); int[] from = new int[n+1]; cum = new long[n+1]; for(int i = 1; i <= n; i++){ 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; } long ans = 0; int[] step = new int[n+1]; boolean[] arrived = new boolean[n+1]; Deque<Integer> q = new ArrayDeque<>(); for(int i = 1; i <= n; i++){ int cnt = 0; if(arrived[i]){ continue; } int now = i; while(from[now] != 0){ if(arrived[now]){ cnt = step[now]; break; }else{ arrived[now] = true; q.add(now); } now = from[now]; } while(q.size() != 0){ long tmp = cum[q.size()+cnt]; ans += tmp; ans %= mod; int prev = q.pollFirst(); step[prev] = q.size()+1+cnt; } } System.out.println(ans); } } 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; } }