Bandit in a City Codeforces Round #678 SOLUTON

D. Bandit in a City Codeforces Round #678 SOLUTON

Bandits appeared in the city! One of them is trying to catch as many citizens as he can.
The city consists of n squares connected by n−1 roads in such a way that it is possible to reach any square from any other square. The square number 1 is the main square.
After Sunday walk all the roads were changed to one-way roads in such a way that it is possible to reach any square from the main square.
At the moment when the bandit appeared on the main square there were ai citizens on the i-th square. Now the following process will begin. First, each citizen that is currently on a square with some outgoing one-way roads chooses one of such roads and moves along it to another square. Then the bandit chooses one of the one-way roads outgoing from the square he is located and moves along it. The process is repeated until the bandit is located on a square with no outgoing roads. The bandit catches all the citizens on that square.
The bandit wants to catch as many citizens as possible; the citizens want to minimize the number of caught people. The bandit and the citizens know positions of all citizens at any time, the citizens can cooperate. If both sides act optimally, how many citizens will be caught?
The first line contains a single integer n — the number of squares in the city (2≤n≤2⋅105).
The second line contains n−1 integers p2,p3…pn meaning that there is a one-way road from the square pi to the square i (1≤pi<i).
The third line contains n integers a1,a2,…,an — the number of citizens on each square initially (0≤ai≤109).
Print a single integer — the number of citizens the bandit will catch if both sides act optimally.
1 1
3 1 2
1 1
3 1 3
In the first example the citizens on the square 1 can split into two groups 2+1, so that the second and on the third squares will have 3 citizens each.
In the second example no matter how citizens act the bandit can catch at least 4 citizens.
#define forn(i, n) for (int i = 0; i < (n); i++)
#define forab(i, a, b) for (int i = (a); i <= (b); i++)
#define forba(i, b, a) for (int i = (b); i >= (a); i–)
#define mset(a, x, n) memset(a, x, sizeof(a[0]) * (n))
#define updiv(x, y) (((x) + (y) – 1) / (y)) // y > 0
#define pb push_back
#define mp(x, y) make_pair(x, y)
#define fi first
#define se second
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
#define endl ‘n’
#ifdef hat
#define fast
#define de(x) cout  << #x << ‘=’ << x << ‘ ‘
#define dee(x) cout  << #x << ‘=’ << x << endl
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define de(x) ((void) 0)
#define dee(x) ((void) 0)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef pair<int, int> pii;
typedef vector<int> VI;
const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const ll llINF = 0x3f3f3f3f3f3f3f3f;
ll make_compiler_happy() {return INF & maxn & mod & llINF;}
ll fpow(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll inv(ll x) {return fpow(x, mod-2);}
VI g[maxn];
ll sum[maxn], mx[maxn];
int numl[maxn];
ll a[maxn];
void dfs(int u)
    if(sz(g[u]) == 0) {
        numl[u] = 1;
        sum[u] = mx[u] = a[u];
    sum[u] = a[u];
    for(int v : g[u])
        mx[u] = max(mx[v], mx[u]);
        numl[u] += numl[v];
        sum[u] += sum[v];
    for(int v : g[u])
        ll t = mx[u] * numl[v] – sum[v];
        a[u] -= min(a[u], t);
    if(a[u]) mx[u] += updiv(a[u], numl[u]);
int main()
    int n;
    cin >> n;
    forab(u, 2, n)
        int v;
        cin >> v;
    forab(i, 1, n)
        cin >> a[i];
    cout << mx[1] << endl;

Leave a Comment

error: Content is protected !!