Submission #3051333

---

Source Code Expand

#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<complex>
#include<bitset>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll MOD = 998244353;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#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++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-11;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
int n; vector<int> G[20]; int x[20];
bool used[1 << 20]; int memo[1 << 20];
int bfs(int t) {
	int k = t;
	if (used[k])return memo[k];
	int res = (int)MOD;
	rep(i, n) {
		if ((k&(1 << i))&&G[i].size()==0) {
			k ^= (1 << i);
		}
	}
	if (k == 0)res = 0;
	int sum = 0;
	rep(i, n) {
		if (k&(1 << i)) {
			sum += x[i];
		}
	}
	rep(i, n) {
		if (k&(1 << i)) {
			int len = G[i].size();
			int csum = sum; int nex = k;
			rep(j, len) {
				int v = G[i][j];
				csum += x[v];
				nex |= (1 << v);
			}
			nex ^= (1 << i);
			res = min(res, max(csum, bfs(nex)));
		}
	}
	used[t] = true; memo[t] = res;
	return res;
}
int main() {
	cin >> n;
	rep(i, n) {
		cin >> x[i];
	}
	Rep(i, 1, n) {
		int a; cin >> a; a--;
		G[a].push_back(i);
	}
	fill(used, used + (1 << n), false);
	if (n > 1) {
		cout << bfs(1) << endl;
	}
	else {
		cout << x[0] << endl;
	}
	return 0;
}

Submission Info

Judge Result