#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #ifdef LOCAL # include "debug_print.hpp" # define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else # define debug(...) (static_cast(0)) #endif using namespace std; #define rep(i,n) for(int i=0; i<(n); i++) #define rrep(i,n) for(int i=(n)-1; i>=0; i--) #define FOR(i,a,b) for(int i=(a); i<(b); i++) #define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--) #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() #define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() ); #define pb push_back using ll = long long; using D = double; using LD = long double; using P = pair; template using PQ = priority_queue>; template using minPQ = priority_queue, greater>; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b ostream &operator<<(ostream &os, const pair &p) { os << p.first << " " << p.second; return os; } template istream &operator>>(istream &is, pair &p) { is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const vector &v) { int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template istream &operator>>(istream &is, vector &v) { for (auto &x : v) is >> x; return is; } void in() {} template void in(T &t, U &...u) { cin >> t; in(u...); } void out() { cout << "\n"; } template void out(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; out(u...); } void outr() {} template void outr(const T &t, const U &...u) { cout << t; outr(u...); } int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; in(n); vector a(n), b(n), c(n); in(a,b,c); rep(i,n) c[i]--; vector seen(n,false); vector loop(n,-1); vector ord; vector ind(n); vector par(n); rep(i,n) par[i] = i; vector sa_lp(n); vector sb_lp(n); rep(i,n) ind[c[i]]++; rep(i,n){ if(seen[i]) continue; int now = i; do{ seen[now] = true; now = c[now]; }while(!seen[now]); int piv = now; while(loop[now] == -1){ sa_lp[piv] += a[now]; sb_lp[piv] += b[now]; par[now] = piv; loop[now] = 1; now = c[now]; } now = i; while(loop[now] == -1){ loop[now] = 0; now = c[now]; } } rep(i,n) if(loop[i] == 0) sa_lp[i] = a[i], sb_lp[i] = b[i]; queue q; rep(i,n) if(ind[i] == 0) q.push(i); while(q.size()){ int x = q.front(); q.pop(); ord.pb(x); int y = c[x]; if(loop[y]){ ord.pb(par[y]); } else{ ind[y]--; if(ind[y] == 0) q.push(y); } } // out(loop); // out(ord); ll ok = 0, ng = 1e15; vector f(n); while(ng-ok > 1){ ll mid = (ok+ng)/2; f = sa_lp; int chk = 1; for(int x : ord){ if(!chk) break; if(loop[x] == 1) continue; if(f[x]/mid < sb_lp[x]){ int y = par[c[x]]; if((f[x]+f[y])/mid < sb_lp[x]) { chk = 0; break; } f[y] -= mid*sb_lp[x]-f[x]; if(f[y] < 0) { chk = 0; break; } } } rep(i,n) if(loop[i] == 1){ if(f[par[i]]/mid < sb_lp[par[i]]) chk = 0; } if(chk) ok = mid; else ng = mid; } out(ok); }