結果

問題 No.1789 Tree Growing
ユーザー heno239heno239
提出日時 2021-12-13 16:57:26
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 10,775 bytes
コンパイル時間 4,220 ms
コンパイル使用メモリ 201,924 KB
実行使用メモリ 18,924 KB
最終ジャッジ日時 2023-10-13 02:49:11
合計ジャッジ時間 13,677 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 9 ms
18,808 KB
testcase_01 AC 9 ms
18,524 KB
testcase_02 AC 9 ms
18,648 KB
testcase_03 AC 9 ms
18,648 KB
testcase_04 AC 9 ms
18,584 KB
testcase_05 AC 9 ms
18,552 KB
testcase_06 AC 9 ms
18,532 KB
testcase_07 AC 9 ms
18,708 KB
testcase_08 AC 9 ms
18,568 KB
testcase_09 AC 9 ms
18,568 KB
testcase_10 AC 9 ms
18,576 KB
testcase_11 AC 9 ms
18,544 KB
testcase_12 AC 9 ms
18,712 KB
testcase_13 AC 9 ms
18,836 KB
testcase_14 AC 9 ms
18,536 KB
testcase_15 AC 9 ms
18,828 KB
testcase_16 AC 9 ms
18,568 KB
testcase_17 AC 9 ms
18,616 KB
testcase_18 AC 9 ms
18,536 KB
testcase_19 AC 9 ms
18,560 KB
testcase_20 AC 9 ms
18,580 KB
testcase_21 AC 10 ms
18,568 KB
testcase_22 AC 9 ms
18,556 KB
testcase_23 AC 9 ms
18,712 KB
testcase_24 AC 9 ms
18,572 KB
testcase_25 AC 10 ms
18,572 KB
testcase_26 AC 10 ms
18,552 KB
testcase_27 AC 10 ms
18,724 KB
testcase_28 AC 10 ms
18,552 KB
testcase_29 AC 9 ms
18,552 KB
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 WA -
testcase_57 WA -
testcase_58 WA -
testcase_59 WA -
testcase_60 WA -
testcase_61 WA -
testcase_62 WA -
testcase_63 WA -
testcase_64 WA -
testcase_65 WA -
testcase_66 AC 10 ms
18,580 KB
testcase_67 AC 9 ms
18,568 KB
testcase_68 AC 9 ms
18,668 KB
testcase_69 AC 9 ms
18,580 KB
testcase_70 AC 9 ms
18,592 KB
testcase_71 AC 10 ms
18,596 KB
testcase_72 AC 9 ms
18,652 KB
testcase_73 AC 10 ms
18,592 KB
testcase_74 WA -
testcase_75 AC 9 ms
18,652 KB
testcase_76 AC 9 ms
18,532 KB
testcase_77 AC 9 ms
18,552 KB
testcase_78 AC 9 ms
18,564 KB
testcase_79 AC 9 ms
18,592 KB
testcase_80 WA -
testcase_81 WA -
testcase_82 WA -
testcase_83 TLE -
testcase_84 -- -
testcase_85 -- -
testcase_86 -- -
testcase_87 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-4;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}


int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

void expr() {
	vector<int> v = { 1,2,3,3,4,4,4,5 };
	ll pro = 1;
	ll ma = 0;
	int sum = 0;
	function<void(int)>dfs = [&](int dep) {
		if (dep == v.size()) {
			chmax(ma, pro);
			return;
		}

		ll mempro = pro;
		int memsum = sum;

		for (int c = 0;; c++) {
			if (sum + c * v[dep] > 19)break;
			sum += c * v[dep];
			pro *= (c + 1);
			dfs(dep + 1);
			sum = memsum;
			pro = mempro;
		}
	};
	dfs(0);
	cout << ma << "\n";
	//<=144
}

int xroot;
vector<string> trees;
vector<vector<P>> chs;
vector<vector<vector<int>>> nexs;

const int mn = 1 << 14;

int dp[mn][20];
int pardp[mn][20];
vector<int> G[mn];
vector<int> ids[mn];
int root;

void dfs(int id, int fr) {
	rep(i, trees.size()) {
		dp[id][i] = -mod;
	}
	for (int to : G[id]) {
		if (to == fr)continue;
		dfs(to, id);
		ids[id].push_back(to);
	}
	//idになんかおく
	rep(j, trees.size()) {
		//const int sz = chs[j].size();
		int sz = nexs[j].size();
		vector<int> ndp(sz, -mod); ndp[0] = 0;
		vector<int> cop(sz, -mod);
		for (int to : ids[id]) {
			rep(i, ndp.size()) {
				if (ndp[i] < 0)continue;
				chmax(cop[i], ndp[i]);
				rep(a, nexs[j][i].size()) {
					int nex = nexs[j][i][a];
					int uid = chs[j][a].first;
					/*if (id == 4 && j == 1 && i == 0) {
						cout << "? " << nex << " " << uid << "\n";
						cout << ndp[i] << " " << dp[to][uid] << "\n";
					}*/
					if (nex >= 0) {
						chmax(cop[nex], ndp[i] + 1 + dp[to][uid]);
					}
				}
			}
			rep(i, cop.size()) {
				ndp[i] = cop[i]; cop[i] = -mod;
			}
			/*if (id == 4 && j == 1) {
				cout << "?\n";
				cout << nexs[j][0][0] << "\n";
				coutarray(ndp);
			}*/
		}
		chmax(dp[id][j], ndp.back());
	}
	//idになにも置かない
	for (int to : ids[id]) {
		rep(j, trees.size()) {
			chmax(dp[id][j], dp[to][j] + 1);
		}
	}
}

int ledp[10005][150];
int ridp[10005][150];
int ans = -mod;
void invdfs(int id, int fr) {
	vector<int> v;
	for (int to : ids[id])v.push_back(to);
	if (fr >= 0)v.push_back(-1);
	int len = v.size();
	//
	//calcurate id's ans
	vector<int> ndp(nexs[xroot].size(), -mod);
	vector<int> cop = ndp;
	ndp[0] = 0;
	for (int to : ids[id]) {
		rep(i, ndp.size()) {
			chmax(cop[i], ndp[i]);
			rep(a, nexs[xroot][i].size()) {
				int nex = nexs[xroot][i][a];
				int uid = chs[xroot][a].first;
				if (nex >= 0) {
					chmax(cop[nex], ndp[i] + 1 + dp[to][uid]);
				}
			}
		}
		rep(i, ndp.size()) {
			ndp[i] = cop[i]; cop[i] = -mod;
		}
	}
	if (fr >= 0) {
		rep(i, ndp.size()) {
			chmax(cop[i], ndp[i]);
			rep(a, nexs[xroot][i].size()) {
				int nex = nexs[xroot][i][a];
				int uid = chs[xroot][a].first;
				if (nex >= 0) {
					chmax(cop[nex], ndp[i] + 1 + pardp[id][uid]);
				}
			}
		}
		rep(i, ndp.size()) {
			ndp[i] = cop[i]; cop[i] = -mod;
		}
	}
	/*if (ndp.back() >= 0) {
		cout << "?? " << id << "\n";
	}*/
	chmax(ans, ndp.back());
	//cout << "?? " << id << " " << ndp.back() << "\n";
	//rep(j, trees.size())cout << dp[id][j] << " "; cout << "\n";
	//rep(j, trees.size())cout << pardp[id][j] << " "; cout << "\n";

	for (int to : ids[id]) {
		rep(j, trees.size()) {
			pardp[to][j] = -mod;
		}
	}
	//
	rep(j, trees.size()) {
		rep(b, len + 1) {
			rep(i, nexs[j].size()) {
				ledp[b][i] = ridp[b][i] = -mod;
			}
		}
		ledp[0][0] = 0;
		rep(b, len) {
			rep(i, nexs[j].size()) {
				chmax(ledp[b + 1][i], ledp[b][i]);
				rep(a, nexs[j][i].size()) {
					int nex = nexs[j][i][a];
					int uid = chs[j][a].first;
					if (nex >= 0) {
						int val = ledp[b][i] + 1;
						if (v[b] >= 0)val += dp[v[b]][uid];
						else val += pardp[id][uid];
						chmax(ledp[b + 1][nex], val);
					}
				}
			}
		}
		ridp[len][0] = 0;
		per(b, len) {
			rep(i, nexs[j].size()) {
				chmax(ridp[b][i], ridp[b + 1][i]);
				rep(a, nexs[j][i].size()) {
					int nex = nexs[j][i][a];
					int uid = chs[j][a].first;
					if (nex >= 0) {
						int val = ridp[b+1][i] + 1;
						if (v[b] >= 0)val += dp[v[b]][uid];
						else val += pardp[id][uid];
						chmax(ridp[b][nex], val);
					}
				}
			}
		}
		vector<int> sle(len+1,-mod), sri(len + 1,-mod);
		//sle[0] = 0;
		rep(b, len) {
			int val = 1;
			if (v[b] >= 0)val += dp[v[b]][j];
			else val += pardp[id][j];
			sle[b + 1] = max(sle[b], val);
		}
		//sri[len] = 0;
		per(b, len) {
			int val = 1;
			if (v[b] >= 0)val += dp[v[b]][j];
			else val += pardp[id][j];
			sri[b] = max(sri[b+1], val);
		}

		rep(b, ids[id].size()) {
			int to = ids[id][b];
			chmax(pardp[to][j], sle[b]);
			chmax(pardp[to][j], sri[b + 1]);
			rep(i, nexs[j].size()) {
				int val = ledp[b][i] + ridp[b + 1][nexs[j].size() - 1 - i];
				chmax(pardp[to][j], val);
			}
		}
	}
	rep(i, ids[id].size()) {
		int to = ids[id][i];

		//
		//update for return
		//
		invdfs(to, id);
	}
}
void yaru() {
	dfs(root, -1);
	invdfs(root, -1);
}

void solve() {
	int k; cin >> k;
	vector<vector<int>> g(k);
	rep(i, k - 1) {
		int a, b; cin >> a >> b; a--; b--;
		g[a].push_back(b);
		g[b].push_back(a);
	}
	vector<string> memstr(k);
	vector<int> park(k);
	function<string(int, int)> dfsstr = [&](int id, int fr) {
		vector<string> tos;
		for(int to : g[id])if (to != fr) {
			string nex = dfsstr(to, id);
			tos.push_back(nex);
		}
		sort(all(tos));
		string ans = "(";
		for (auto s : tos)ans += s;
		ans.push_back(')');
		memstr[id] = ans;
		park[id] = fr;
		return ans;
	};
	dfsstr(0, -1);
	trees = memstr;
	sort(all(trees));
	trees.erase(unique(all(trees)), trees.end());
	vector<vector<int>> nex(trees.size());
	rep(i, trees.size()) {
		int chk = -1;
		rep(j, memstr.size())if (memstr[j] == trees[i]) {
			chk = j;
		}
		assert(chk >= 0);
		for (int to : g[chk]) {
			if (to == park[chk])continue;
			int loc = lower_bound(all(trees), memstr[to]) - trees.begin();
			nex[i].push_back(loc);
		}
	}
	/*rep1(i, k - 1) {
		int p = park[i];
		p = lower_bound(all(trees), memstr[p]) - trees.begin();
		int cur = lower_bound(all(trees), memstr[i]) - trees.begin();
		nex[p].push_back(cur);
	}*/
	chs.resize(trees.size());
	nexs.resize(trees.size());
	rep(i, trees.size()) {
		sort(all(nex[i]));
		vector<int> szs;
		rep(j, nex[i].size()) {
			int cnt = 1;
			while (j + 1 < nex[i].size() && nex[i][j] == nex[i][j + 1]) {
				cnt++; j++;
			}
			szs.push_back(cnt+1);
			chs[i].push_back({ nex[i][j],cnt });
		}
		vector<int> p(szs.size() + 1);
		p[0] = 1;
		rep(j, szs.size()) {
			p[j + 1] = p[j] * szs[j];
		}
		nexs[i].resize(p[szs.size()]);
		rep(j, nexs[i].size()) {
			vector<int> cur(szs.size());
			int cop = j;
			per(k, szs.size()) {
				cur[k] = cop / p[k];
				cop %= p[k];
			}
			rep(k, szs.size()) {
				if (cur[k] + 1 == szs[k]) {
					nexs[i][j].push_back(-1);
				}
				else {
					nexs[i][j].push_back(j + p[k]);
				}
			}
		}
	}
	int n; cin >> n;
	rep(i, n - 1) {
		int a, b; cin >> a >> b; a--; b--;
		G[a].push_back(b);
		G[b].push_back(a);
	}
	xroot = lower_bound(all(trees), memstr[0]) - trees.begin();
	yaru();
	if (ans < 0)ans = -1;
	cout << ans << "\n";

	//for (auto s : trees)cout << s << "\n";
	/*rep(i, nexs[1].size()) {
		coutarray(nexs[1][i]);
	}*/
	/*for (P p : chs[1]) {
		cout << p.first << " " << p.second << "\n";
	}*/
	//cout << dp[4][1] << " " << dp[5][1] << "\n";
	//cout << dp[4][1] << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(8);
	//init_f();
	//init();
	//while(true)
	//expr();
	//init();
	//int t; cin >> t; rep(i, t)
		solve();
	return 0;
}
0