#line 1 "template/template.hpp" #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 #include #include #include #include #include #include #define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++) #define rrep(i, a, n) for (int i = ((int)(n)-1); i >= (int)(a); i--) #define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++) #define RRep(i, a, n) for (i64 i = ((i64)(n)-i64(1)); i >= (i64)(a); i--) #define all(v) (v).begin(), (v).end() #define rall(v) (v).rbegin(), (v).rend() #line 2 "template/debug_template.hpp" #line 4 "template/debug_template.hpp" namespace ebi { #ifdef LOCAL #define debug(...) \ std::cerr << "LINE: " << __LINE__ << " [" << #__VA_ARGS__ << "]:", \ debug_out(__VA_ARGS__) #else #define debug(...) #endif void debug_out() { std::cerr << std::endl; } template void debug_out(Head h, Tail... t) { std::cerr << " " << h; if (sizeof...(t) > 0) std::cerr << " :"; debug_out(t...); } } // namespace ebi #line 2 "template/int_alias.hpp" #line 4 "template/int_alias.hpp" namespace ebi { using std::size_t; using i8 = std::int8_t; using u8 = std::uint8_t; using i16 = std::int16_t; using u16 = std::uint16_t; using i32 = std::int32_t; using u32 = std::uint32_t; using i64 = std::int64_t; using u64 = std::uint64_t; using i128 = __int128_t; using u128 = __uint128_t; } // namespace ebi #line 2 "template/io.hpp" #line 7 "template/io.hpp" namespace ebi { template std::ostream &operator<<(std::ostream &os, const std::pair &pa) { return os << pa.first << " " << pa.second; } template std::istream &operator>>(std::istream &os, std::pair &pa) { return os >> pa.first >> pa.second; } template std::ostream &operator<<(std::ostream &os, const std::vector &vec) { for (std::size_t i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : " "); return os; } template std::istream &operator>>(std::istream &os, std::vector &vec) { for (T &e : vec) std::cin >> e; return os; } template std::ostream &operator<<(std::ostream &os, const std::optional &opt) { if (opt) { os << opt.value(); } else { os << "invalid value"; } return os; } void fast_io() { std::cout << std::fixed << std::setprecision(15); std::cin.tie(nullptr); std::ios::sync_with_stdio(false); } } // namespace ebi #line 2 "template/utility.hpp" #line 5 "template/utility.hpp" #line 7 "template/utility.hpp" namespace ebi { template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } template T safe_ceil(T a, T b) { if (a % b == 0) return a / b; else if (a >= 0) return (a / b) + 1; else return -((-a) / b); } template T safe_floor(T a, T b) { if (a % b == 0) return a / b; else if (a >= 0) return a / b; else return -((-a) / b) - 1; } constexpr i64 LNF = std::numeric_limits::max() / 4; constexpr int INF = std::numeric_limits::max() / 2; const std::vector dy = {1, 0, -1, 0, 1, 1, -1, -1}; const std::vector dx = {0, 1, 0, -1, 1, -1, 1, -1}; } // namespace ebi #line 2 "graph/template.hpp" #line 4 "graph/template.hpp" namespace ebi { template struct Edge { int to; T cost; Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {} }; template struct Graph : std::vector>> { using std::vector>>::vector; void add_edge(int u, int v, T w, bool directed = false) { (*this)[u].emplace_back(v, w); if (directed) return; (*this)[v].emplace_back(u, w); } }; struct graph : std::vector> { using std::vector>::vector; void add_edge(int u, int v, bool directed = false) { (*this)[u].emplace_back(v); if (directed) return; (*this)[v].emplace_back(u); } }; } // namespace ebi #line 3 "a.cpp" namespace ebi { void main_() { int n; std::cin >> n; std::vector a(n), b(n); std::vector c(n); std::cin >> a >> b >> c; std::vector order; { std::vector deg(n, 0); rep(i,0,n) { c[i]--; deg[c[i]]++; } std::stack stack; rep(i,0,n) if(deg[i] == 0) stack.push(i); while(!stack.empty()) { int v = stack.top(); stack.pop(); order.emplace_back(v); if(--deg[c[v]] == 0) { stack.push(c[v]); } } } i64 ok = 0, ng = 2'000'000'000'000'000; while(std::abs(ok - ng) > 1) { i64 mid = (ok + ng) / 2; std::vector s(n); rep(i,0,n) { s[i] = i128(a[i]) - i128(mid) * i128(b[i]); } std::vector seen(n, -1); for(auto v: order) { seen[v] = 1; chmin(s[v], i128(0)); s[c[v]] += s[v]; } bool is_ok = true; rep(i,0,n) { if(seen[i] > 0) continue; int now = i; i128 sum = 0; while(seen[now] < 0) { seen[now] = 1; sum += s[now]; now = c[now]; } if(sum >= 0) continue; else { is_ok = false; break; } } if(is_ok) ok = mid; else ng = mid; } std::cout << ok << '\n'; } } // namespace ebi int main() { ebi::fast_io(); int t = 1; // std::cin >> t; while (t--) { ebi::main_(); } return 0; }