結果

問題 No.1103 Directed Length Sum
ユーザー shojin_proshojin_pro
提出日時 2020-07-04 00:12:07
言語 Java21
(openjdk 21)
結果
AC  
実行時間 961 ms / 3,000 ms
コード長 3,086 bytes
コンパイル時間 2,655 ms
コンパイル使用メモリ 78,672 KB
実行使用メモリ 86,964 KB
最終ジャッジ日時 2023-10-17 06:36:28
合計ジャッジ時間 17,009 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
53,456 KB
testcase_01 AC 55 ms
53,396 KB
testcase_02 AC 660 ms
85,268 KB
testcase_03 AC 615 ms
85,116 KB
testcase_04 AC 573 ms
73,224 KB
testcase_05 AC 815 ms
84,340 KB
testcase_06 AC 578 ms
67,868 KB
testcase_07 AC 269 ms
59,072 KB
testcase_08 AC 339 ms
63,584 KB
testcase_09 AC 230 ms
58,392 KB
testcase_10 AC 434 ms
70,652 KB
testcase_11 AC 883 ms
83,600 KB
testcase_12 AC 710 ms
77,264 KB
testcase_13 AC 409 ms
64,916 KB
testcase_14 AC 203 ms
58,392 KB
testcase_15 AC 589 ms
74,588 KB
testcase_16 AC 944 ms
85,108 KB
testcase_17 AC 939 ms
86,964 KB
testcase_18 AC 408 ms
65,828 KB
testcase_19 AC 961 ms
84,164 KB
testcase_20 AC 245 ms
59,204 KB
testcase_21 AC 329 ms
63,164 KB
testcase_22 AC 562 ms
71,428 KB
testcase_23 AC 662 ms
69,472 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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.poll();
                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;
    } 
}
0