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

• 問題: No.196 典型DP (1)
• ユーザー: threepipes_s
• 提出日時: 2016-07-02 20:34:44
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 507 ms / 2,000 ms
• コード長: 7,306 bytes
• コンパイル時間: 2,928 ms
• コンパイル使用メモリ: 97,624 KB
• 実行使用メモリ: 78,792 KB
• 最終ジャッジ日時: 2024-10-12 01:14:42
• 合計ジャッジ時間: 11,956 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	56 ms; 36,992 KB
testcase_01	AC	54 ms; 36,672 KB
testcase_02	AC	52 ms; 36,724 KB
testcase_03	AC	52 ms; 36,880 KB
testcase_04	AC	52 ms; 36,608 KB
testcase_05	AC	52 ms; 36,824 KB
testcase_06	AC	51 ms; 36,584 KB
testcase_07	AC	54 ms; 36,724 KB
testcase_08	AC	54 ms; 37,000 KB
testcase_09	AC	55 ms; 36,660 KB
testcase_10	AC	53 ms; 36,852 KB
testcase_11	AC	53 ms; 36,884 KB
testcase_12	AC	53 ms; 36,508 KB
testcase_13	AC	54 ms; 36,744 KB
testcase_14	AC	55 ms; 36,872 KB
testcase_15	AC	90 ms; 39,220 KB
testcase_16	AC	138 ms; 43,612 KB
testcase_17	AC	175 ms; 48,480 KB
testcase_18	AC	252 ms; 54,260 KB
testcase_19	AC	220 ms; 52,624 KB
testcase_20	AC	126 ms; 40,928 KB
testcase_21	AC	142 ms; 43,320 KB
testcase_22	AC	123 ms; 40,164 KB
testcase_23	AC	250 ms; 49,188 KB
testcase_24	AC	151 ms; 43,336 KB
testcase_25	AC	363 ms; 60,844 KB
testcase_26	AC	112 ms; 39,368 KB
testcase_27	AC	200 ms; 48,964 KB
testcase_28	AC	368 ms; 59,224 KB
testcase_29	AC	473 ms; 78,748 KB
testcase_30	AC	407 ms; 78,792 KB
testcase_31	AC	239 ms; 43,044 KB
testcase_32	AC	321 ms; 55,172 KB
testcase_33	AC	352 ms; 60,636 KB
testcase_34	AC	315 ms; 77,720 KB
testcase_35	AC	244 ms; 76,552 KB
testcase_36	AC	151 ms; 41,004 KB
testcase_37	AC	301 ms; 54,208 KB
testcase_38	AC	507 ms; 60,200 KB
testcase_39	AC	484 ms; 70,088 KB
testcase_40	AC	256 ms; 76,596 KB
testcase_41	AC	53 ms; 37,000 KB
testcase_42	AC	54 ms; 36,992 KB
testcase_43	AC	53 ms; 36,872 KB

ソースコード

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.HashMap;
import java.util.List;
import java.util.Random;
import java.util.TreeMap;

public class Main {
	static ContestScanner in;static Writer out;public static void main(String[] args)
	{try{in=new ContestScanner();out=new Writer();Main solve=new Main();solve.solve();
	in.close();out.flush();out.close();}catch(IOException e){e.printStackTrace();}}
	static void dump(int[]a){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();}
	static void dump(int[]a,int n){for(int i=0;i<a.length;i++)out.printf("%"+n+"d ",a[i]);out.println();}
	static void dump(long[]a){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();}
	static void dump(char[]a){for(int i=0;i<a.length;i++)out.print(a[i]);out.println();}
	static long pow(long a,int n){long r=1;while(n>0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;}
	static String itob(int a,int l){return String.format("%"+l+"s",Integer.toBinaryString(a)).replace(' ','0');}
	static void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);}
	static void sort(int[]a,int l){m_sort(a,0,l,new int[l]);}
	static void sort(int[]a,int l,int[]buf){m_sort(a,0,l,buf);}
	static void sort(int[]a,int s,int l,int[]buf){m_sort(a,s,l,buf);}
	static void m_sort(int[]a,int s,int sz,int[]b)
	{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
	m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
	while(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];}
	while(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];
	} /* qsort(3.5s)<<msort(9.5s)<<<shuffle+qsort(17s)<Arrays.sort(Integer)(20s) */
	static void sort(long[]a){m_sort(a,0,a.length,new long[a.length]);}
	static void sort(long[]a,int l){m_sort(a,0,l,new long[l]);}
	static void sort(long[]a,int l,long[]buf){m_sort(a,0,l,buf);}
	static void sort(long[]a,int s,int l,long[]buf){m_sort(a,s,l,buf);}
	static void m_sort(long[]a,int s,int sz,long[]b)
	{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
	m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
	while(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];}
	while(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];}
	static void swap(long[] a,int i,int j){final long t=a[i];a[i]=a[j];a[j]=t;}
	static void swap(int[] a,int i,int j){final int t=a[i];a[i]=a[j];a[j]=t;}
	static int binarySearchSmallerMax(int[]a,int v)// get maximum index which a[idx]<=v
	{int l=-1,r=a.length-1,s=0;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}
	static int binarySearchSmallerMax(int[]a,int v,int l,int r)
	{int s=-1;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}
	static List<Integer>[]createGraph(int n)
    {List<Integer>[]g=new List[n];for(int i=0;i<n;i++)g[i]=new ArrayList<>();return g;}
	void solve() throws NumberFormatException, IOException{
		n = in.nextInt();
		k = in.nextInt();
		node = createGraph(n);
		for(int i=0; i<n-1; i++){
			int a = in.nextInt();
			int b = in.nextInt();
			node[a].add(b);
			node[b].add(a);
		}
		dp = new long[n][k+1];
		size = new int[n];
		buf = new long[k+1];
		dfs(0, 0);
		System.out.println(dp[0][k]);
	}
	int n, k;
	List<Integer>[] node;
	long[][] dp;
	int[] size;
	long[] buf;
	final int mod = 1000000007;
	void dfs(int cur, int par){
		size[cur] = 1;
		dp[cur][0] = 1;
		for(int v: node[cur]){
			if(v==par) continue;
			dfs(v, cur);
			final int len = Math.min(size[cur]+size[v]+1, k+1);
			Arrays.fill(buf, 0, len, 0);
			for(int i=0; i<=size[cur]; i++){
				for(int j=0; j<=size[v]; j++){
					if(j+i>k) break;
					buf[j+i] = ((buf[j+i]+dp[cur][i]*dp[v][j]%mod)%mod);
				}
			}
			for(int i=0; i<len; i++) dp[cur][i] = buf[i];
			size[cur] += size[v];
		}
		if(size[cur]<=k) dp[cur][size[cur]] = (dp[cur][size[cur]]+1)%mod;
	}
}



class MultiSet<T> extends HashMap<T, Integer>{
	@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
	public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
	public MultiSet<T> merge(MultiSet<T> set)
	{MultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
	for(Entry<T,Integer>e:s.entrySet())l.add(e.getKey(),e.getValue());return l;}
}
class OrderedMultiSet<T> extends TreeMap<T, Integer>{
	@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
	public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
	public OrderedMultiSet<T> merge(OrderedMultiSet<T> set)
	{OrderedMultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
	while(!s.isEmpty()){l.add(s.firstEntry().getKey(),s.pollFirstEntry().getValue());}return l;}
}
class Pair implements Comparable<Pair>{
	int a,b;final int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;}
	public boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;}
	public int hashCode(){return hash;}
	public int compareTo(Pair o){if(a!=o.a)return a<o.a?-1:1;else if(b!=o.b)return b<o.b?-1:1;return 0;}
}
class Timer{
	long time;public void set(){time=System.currentTimeMillis();}
	public long stop(){return time=System.currentTimeMillis()-time;}
	public void print(){System.out.println("Time: "+(System.currentTimeMillis()-time)+"ms");}
	@Override public String toString(){return"Time: "+time+"ms";}
}
class Writer extends PrintWriter{
	public Writer(String filename)throws IOException
	{super(new BufferedWriter(new FileWriter(filename)));}
	public Writer()throws IOException{super(System.out);}
}
class ContestScanner implements Closeable{
	private BufferedReader in;private int c=-2;
	public ContestScanner()throws IOException 
	{in=new BufferedReader(new InputStreamReader(System.in));}
	public ContestScanner(String filename)throws IOException
	{in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
	public String nextToken()throws IOException {
		StringBuilder sb=new StringBuilder();
		while((c=in.read())!=-1&&Character.isWhitespace(c));
		while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}
		return sb.toString();
	}
	public String readLine()throws IOException{
		StringBuilder sb=new StringBuilder();if(c==-2)c=in.read();
		while(c!=-1&&c!='\n'&&c!='\r'){sb.append((char)c);c=in.read();}
		return sb.toString();
	}
	public long nextLong()throws IOException,NumberFormatException
	{return Long.parseLong(nextToken());}
	public int nextInt()throws NumberFormatException,IOException
	{return(int)nextLong();}
	public double nextDouble()throws NumberFormatException,IOException 
	{return Double.parseDouble(nextToken());}
	public void close() throws IOException {in.close();}
}