結果

問題 No.1103 Directed Length Sum
ユーザー shojin_proshojin_pro
提出日時 2020-07-04 00:08:15
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,090 bytes
コンパイル時間 2,342 ms
コンパイル使用メモリ 79,184 KB
実行使用メモリ 90,752 KB
最終ジャッジ日時 2024-09-17 05:12:09
合計ジャッジ時間 15,461 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
50,208 KB
testcase_01 AC 50 ms
50,488 KB
testcase_02 AC 560 ms
82,132 KB
testcase_03 AC 725 ms
83,312 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
権限があれば一括ダウンロードができます

ソースコード

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.pollLast();
                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