#22666 (C++11) No.196 典型DP (1)

提出ソース

結果

問題	No.196 典型DP (1)
ユーザー	shimomire
提出日時	2015-04-26 23:56:51
言語	C++11 (gcc 11.4.0)
結果	AC
実行時間	177 ms / 2,000 ms
コード長	5,696 bytes
コンパイル時間	1,191 ms
コンパイル使用メモリ	119,836 KB
実行使用メモリ	65,816 KB
最終ジャッジ日時	2023-09-18 12:06:26
合計ジャッジ時間	4,319 ms
ジャッジサーバーID （参考情報）	judge11 / judge14

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,380 KB
testcase_01	AC	2 ms 4,380 KB
testcase_02	AC	1 ms 4,376 KB
testcase_03	AC	1 ms 4,380 KB
testcase_04	AC	2 ms 4,376 KB
testcase_05	AC	2 ms 4,376 KB
testcase_06	AC	2 ms 4,376 KB
testcase_07	AC	1 ms 4,376 KB
testcase_08	AC	2 ms 4,384 KB
testcase_09	AC	2 ms 4,380 KB
testcase_10	AC	2 ms 4,376 KB
testcase_11	AC	1 ms 4,376 KB
testcase_12	AC	2 ms 4,380 KB
testcase_13	AC	2 ms 4,380 KB
testcase_14	AC	2 ms 4,380 KB
testcase_15	AC	6 ms 4,384 KB
testcase_16	AC	17 ms 8,760 KB
testcase_17	AC	29 ms 12,808 KB
testcase_18	AC	56 ms 22,596 KB
testcase_19	AC	43 ms 17,532 KB
testcase_20	AC	8 ms 5,152 KB
testcase_21	AC	15 ms 7,796 KB
testcase_22	AC	5 ms 4,380 KB
testcase_23	AC	33 ms 15,748 KB
testcase_24	AC	10 ms 6,116 KB
testcase_25	AC	93 ms 37,268 KB
testcase_26	AC	3 ms 4,384 KB
testcase_27	AC	20 ms 10,996 KB
testcase_28	AC	75 ms 34,900 KB
testcase_29	AC	131 ms 56,140 KB
testcase_30	AC	157 ms 65,812 KB
testcase_31	AC	2 ms 4,380 KB
testcase_32	AC	55 ms 22,220 KB
testcase_33	AC	90 ms 34,820 KB
testcase_34	AC	149 ms 56,544 KB
testcase_35	AC	177 ms 65,816 KB
testcase_36	AC	3 ms 4,376 KB
testcase_37	AC	55 ms 22,080 KB
testcase_38	AC	90 ms 34,660 KB
testcase_39	AC	104 ms 39,652 KB
testcase_40	AC	177 ms 65,796 KB
testcase_41	AC	1 ms 4,384 KB
testcase_42	AC	2 ms 4,380 KB
testcase_43	AC	2 ms 4,380 KB

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

ソースコード

raw source code

#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;

typedef long long ll;typedef unsigned long long ull;typedef long double ld;

#define ALL(c) c.begin(),c.end()
#define IN(l,v,r) (l<=v && v < r)
template<class T> void UNIQUE(T v){v.erase(unique(ALL(v)),v.end());}
//debug
#define DUMP(x) cerr << #x <<" = " << (x)
#define LINE() cerr<< " (L" << __LINE__ << ")"

#define BR "\n"
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define FOR(i,l,r) for(int i=(int)l;i<(int)(r);++i)
#define EACH(it,o) for(auto it = (o).begin(); it != (o).end(); ++it)

struct range{
	struct Iter{
		int v,step;
		Iter& operator++(){v+=step;return *this;}
		bool operator!=(Iter& itr){return v<itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	range(int i, int n,int step):i({i,step}), n({n,step}){}
	range(int i, int n):range(i,n,1){}
	range(int n):range(0,n){}
	Iter& begin(){return i;}
	Iter& end(){return n;}
};
struct rrange{
	struct Iter{
		int v,step;
		Iter& operator++(){v-=step;return *this;}
		bool operator!=(Iter& itr){return v>itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	rrange(int i, int n,int step):i({i-1,step}), n({n-1,step}){}
	rrange(int i, int n):rrange(i,n,1){}
	rrange(int n) :rrange(0,n){}
	Iter& begin(){return n;}
	Iter& end(){return i;}
};

//input
template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}
template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}
template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}
template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}
template<typename T> istream& operator >> (istream& is,vector<T>& as){for(int i:range(as.size()))is >>as[i];return is;}
//output
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<" "<<p.second;}
template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<" "<<get<1>(t);}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);}
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){for(int i:range(as.size())){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){for(int i:range(as.size())){if(i!=0)os<<endl; os<<as[i];}return os;}

// values
template<typename T> inline T INF(){assert(false);};
template<> inline int INF<int>(){return 1<<28;};
template<> inline ll INF<ll>(){return 1LL<<58;};
template<> inline double INF<double>(){return 1e16;};
template<> inline long double INF<long double>(){return 1e16;};

template<class T> inline T EPS(){assert(false);};
template<> inline int EPS<int>(){return 1;};
template<> inline ll EPS<ll>(){return 1LL;};
template<> inline double EPS<double>(){return 1e-8;};
template<> inline long double EPS<long double>(){return 1e-8;};

// min{2^r | n < 2^r}
template<typename T> T upper_pow2(T n){ T res=1;while(res<n)res<<=1;return res;}
// max{d | 2^d  <= n}
template<typename T> T msb(T n){ int d=62;while((1LL<<d)>n)d--;return d;}

template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}


ll gcd_positive(ll a,ll b) { return b == 0 ? a : gcd_positive(b,a%b); }
ll gcd(ll a,ll b) { return gcd_positive(abs(a), abs(b)); }
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}


ll MOD=1e9+7;

class Main{
	public:


	int N,K;
	vector<vector<int>> g;

	vector<vector<ll>> dp;

	vector<int> et;
	vector<int> nt;

	void subdfs(int v,int p){
		et.push_back(v);
		for(int t:g[v])if(t!=p)subdfs(t,v);
		et.push_back(v);
		nt[v]=et.size();
		return;
	}

	void run(){
		cin >> N >> K;
		g=vector<vector<int>>(N);

		for(int i:range(N-1)){
			int a,b;cin >> a >> b;
			g[a].push_back(b);
			g[b].push_back(a);
		}
		nt=vector<int>(N);
		subdfs(0,-1);
		vector<vector<ll>> dp(2*N+1,vector<ll>(K+1));
		dp[0][0]=1;
		for(int i:range(2*N)){
			for(int k:range(K+1)){
				int v =et[i];int nk =k+(nt[v]-i)/2;
				if(nk<=K && nt[v] != i+1){
					// cerr <<"up:"<< nt[v] <<" " << nk <<endl;
					dp[nt[v]][nk]+=dp[i][k];
					dp[nt[v]][nk]%=MOD;
				}
				// cerr << "low:"<<nt[v] <<" " << nk <<endl;

				dp[i+1][k]+=dp[i][k];
				dp[i+1][k]%=MOD;
			}
		}
		// cerr << dp <<endl;
		cout << dp[2*N][K] <<endl;
	}
};

int main(){
	cout <<fixed<<setprecision(20);
	cin.tie(0);
	ios::sync_with_stdio(false);
	Main().run();
	return 0;
}

yukicoder

結果

テストケース

ソースコード