#22706 (Java21) No.196 典型DP (1)

提出ソース

結果

問題	No.196 典型DP (1)
ユーザー	ぴろず
提出日時	2015-04-27 00:26:25
言語	Java21 (openjdk 21)
結果	AC
実行時間	231 ms / 2,000 ms
コード長	5,005 bytes
コンパイル時間	2,393 ms
コンパイル使用メモリ	76,516 KB
実行使用メモリ	88,284 KB
最終ジャッジ日時	2023-09-18 12:27:12
合計ジャッジ時間	9,777 ms
ジャッジサーバーID （参考情報）	judge12 / judge13

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	45 ms 47,412 KB
testcase_01	AC	46 ms 49,416 KB
testcase_02	AC	45 ms 47,388 KB
testcase_03	AC	47 ms 49,332 KB
testcase_04	AC	44 ms 49,344 KB
testcase_05	AC	44 ms 49,268 KB
testcase_06	AC	44 ms 49,344 KB
testcase_07	AC	44 ms 49,336 KB
testcase_08	AC	44 ms 49,528 KB
testcase_09	AC	43 ms 49,172 KB
testcase_10	AC	44 ms 49,332 KB
testcase_11	AC	45 ms 49,236 KB
testcase_12	AC	45 ms 49,420 KB
testcase_13	AC	47 ms 49,168 KB
testcase_14	AC	48 ms 49,392 KB
testcase_15	AC	59 ms 52,048 KB
testcase_16	AC	99 ms 57,304 KB
testcase_17	AC	136 ms 62,864 KB
testcase_18	AC	165 ms 70,684 KB
testcase_19	AC	167 ms 78,216 KB
testcase_20	AC	184 ms 87,648 KB
testcase_21	AC	189 ms 87,200 KB
testcase_22	AC	193 ms 87,256 KB
testcase_23	AC	212 ms 87,960 KB
testcase_24	AC	207 ms 88,040 KB
testcase_25	AC	203 ms 88,052 KB
testcase_26	AC	217 ms 88,268 KB
testcase_27	AC	228 ms 88,284 KB
testcase_28	AC	223 ms 88,196 KB
testcase_29	AC	221 ms 88,052 KB
testcase_30	AC	222 ms 87,624 KB
testcase_31	AC	172 ms 85,972 KB
testcase_32	AC	171 ms 85,620 KB
testcase_33	AC	172 ms 85,896 KB
testcase_34	AC	174 ms 85,160 KB
testcase_35	AC	176 ms 85,904 KB
testcase_36	AC	231 ms 87,732 KB
testcase_37	AC	219 ms 87,836 KB
testcase_38	AC	225 ms 87,636 KB
testcase_39	AC	226 ms 87,836 KB
testcase_40	AC	176 ms 85,636 KB
testcase_41	AC	43 ms 49,328 KB
testcase_42	AC	45 ms 49,680 KB
testcase_43	AC	43 ms 49,456 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package no195;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {
	public static long MOD = 1000000007;
	public static void main(String[] args) {
		new Main().solve();
	}

	IO io = new IO();
	int n;
	int k;
	ArrayList<Integer>[] tree;
	ArrayList<Integer>[] child;
	long[][] dp;

	@SuppressWarnings("unchecked")
	void solve() {
		n = io.nextInt();
		k = io.nextInt();
		tree = new ArrayList[n];
		child = new ArrayList[n];
		for(int i=0;i<n;i++) {
			tree[i] = new ArrayList<>();
			child[i] = new ArrayList<>();
		}
		for(int i=0;i<n-1;i++) {
			int a = io.nextInt();
			int b = io.nextInt();
			tree[a].add(b);
			tree[b].add(a);
		}
		dfs(-1,0);
		dp = new long[n][n+1];
		dfs2(0);

		System.out.println(dp[0][k]);
//		System.out.println(Arrays.deepToString(dp));
	}

	void dfs(int parent,int v) {
		for(int c:tree[v]) {
			if (c != parent) {
				child[v].add(c);
				dfs(v,c);
			}
		}
	}

	int dfs2(int v) {
		int vnum = 1;
		dp[v][0] = 1;
		for(int c:child[v]) {
			int right = dfs2(c);
			vnum += right;
			for(int i=vnum;i>=0;i--) {
				if (dp[v][i] == 0) {
					continue;
				}
				for(int j=Math.min(vnum-i, right);j>=1;j--) {
					dp[v][i+j] = (dp[v][i+j] + dp[v][i] * dp[c][j]) % MOD;
				}
				dp[v][i] = (dp[v][i] * dp[c][0]) % MOD;
//				System.out.println(v + ":" + Arrays.toString(dp[v]));
			}
		}
		dp[v][vnum] += 1;
		return vnum;
	}



}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	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;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}

yukicoder

結果

テストケース

ソースコード