結果

問題 No.196 典型DP (1)
ユーザー EmKjpEmKjp
提出日時 2015-04-30 00:07:22
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 180 ms / 2,000 ms
コード長 3,840 bytes
コンパイル時間 2,540 ms
コンパイル使用メモリ 111,760 KB
実行使用メモリ 57,948 KB
最終ジャッジ日時 2023-09-19 04:16:06
合計ジャッジ時間 9,159 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
23,776 KB
testcase_01 AC 66 ms
21,832 KB
testcase_02 AC 66 ms
21,808 KB
testcase_03 AC 66 ms
23,672 KB
testcase_04 AC 66 ms
21,644 KB
testcase_05 AC 65 ms
21,724 KB
testcase_06 AC 64 ms
21,672 KB
testcase_07 AC 66 ms
23,764 KB
testcase_08 AC 65 ms
21,712 KB
testcase_09 AC 64 ms
19,712 KB
testcase_10 AC 65 ms
21,692 KB
testcase_11 AC 65 ms
21,764 KB
testcase_12 AC 66 ms
21,760 KB
testcase_13 AC 68 ms
23,760 KB
testcase_14 AC 65 ms
21,708 KB
testcase_15 AC 69 ms
21,752 KB
testcase_16 AC 77 ms
30,236 KB
testcase_17 AC 88 ms
30,396 KB
testcase_18 AC 106 ms
38,116 KB
testcase_19 AC 115 ms
39,288 KB
testcase_20 AC 131 ms
47,572 KB
testcase_21 AC 133 ms
49,840 KB
testcase_22 AC 132 ms
49,796 KB
testcase_23 AC 141 ms
49,488 KB
testcase_24 AC 137 ms
48,244 KB
testcase_25 AC 139 ms
48,684 KB
testcase_26 AC 147 ms
57,948 KB
testcase_27 AC 145 ms
55,800 KB
testcase_28 AC 146 ms
55,728 KB
testcase_29 AC 145 ms
55,804 KB
testcase_30 AC 143 ms
55,668 KB
testcase_31 AC 179 ms
47,484 KB
testcase_32 AC 177 ms
45,628 KB
testcase_33 AC 180 ms
49,564 KB
testcase_34 AC 178 ms
47,540 KB
testcase_35 AC 178 ms
49,584 KB
testcase_36 AC 177 ms
47,496 KB
testcase_37 AC 136 ms
47,536 KB
testcase_38 AC 176 ms
47,556 KB
testcase_39 AC 166 ms
47,604 KB
testcase_40 AC 178 ms
49,636 KB
testcase_41 AC 66 ms
23,760 KB
testcase_42 AC 65 ms
21,704 KB
testcase_43 AC 65 ms
21,836 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;

partial class Solver {
    const int mod = 1000000007;

    int[][] memo = new int[2001][];
    int[] size = new int[2001];

    int[] dfs(List<List<int>> adj, int pos, int parent = -1) {
        int n = adj.Count;
        if (memo[pos] != null)
            return memo[pos];
        int[] ret = new int[n + 1];
        ret[0] = 1;
        size[pos] = 1;
        foreach (var child in adj[pos]) {
            if (child == parent) continue;
            var sub = dfs(adj, child, pos);
            size[pos] += size[child];
            int[] next = new int[n + 1];
            for (int i = 0; i <= size[pos]; i++) {
                if (ret[i] == 0) continue;
                for (int j = 0; j <= size[child]; j++) {
                    next[i + j] += (int)(1L * ret[i] * sub[j] % mod);
                    next[i + j] %= mod;
                }
            }
            ret = next;
        }
        ret[size[pos]] = 1;

        return memo[pos] = ret;
    }

    public void Run() {
        int N = ni();
        int K = ni();
        var adj = Enumerable.Range(0, N).Select(_ => new List<int>()).ToList();

        for (int i = 0; i < N - 1; i++) {
            int a = ni();
            int b = ni();
            adj[a].Add(b);
            adj[b].Add(a);
        }
        var result = dfs(adj, 0);
        cout.WriteLine(result[K]);
    }
}

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner {
    public static void Main(string[] args) {
        new Solver(Console.In, Console.Out).Run();
    }

    TextReader cin;
    TextWriter cout;

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

    public int ni() {
        return NextInt();
    }
    public long nl() {
        return NextLong();
    }
    public string ns() {
        return Next();
    }
}

public class Scanner {
    private TextReader Reader;
    private Queue<String> TokenQueue = new Queue<string>();
    private CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        this.Reader = reader;
    }

    public int NextInt() { return Int32.Parse(Next(), ci); }
    public long NextLong() { return Int64.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size) {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size) {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public String Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }

    private bool StockTokens() {
        while (true) {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}
0