結果
| 問題 |
No.2523 Trick Flower
|
| コンテスト | |
| ユーザー |
 tokusakurai
|
| 提出日時 | 2023-10-27 23:45:05 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 369 ms / 4,000 ms |
| コード長 | 6,204 bytes |
| コンパイル時間 | 2,047 ms |
| コンパイル使用メモリ | 210,664 KB |
| 最終ジャッジ日時 | 2025-02-17 16:12:43 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 31 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using maxheap = priority_queue<T>;
template <typename T>
bool chmax(T &x, const T &y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T>
bool chmin(T &x, const T &y) {
return (x > y) ? (x = y, true) : false;
}
template <typename T>
int flg(T x, int i) {
return (x >> i) & 1;
}
int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
template <typename T>
void print(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
if (v.empty()) cout << '\n';
}
template <typename T>
void printn(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}
template <typename T>
int lb(const vector<T> &v, T x) {
return lower_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, T x) {
return upper_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
void rearrange(vector<T> &v) {
sort(begin(v), end(v));
v.erase(unique(begin(v), end(v)), end(v));
}
template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
int n = v.size();
vector<int> ret(n);
iota(begin(ret), end(ret), 0);
sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
return ret;
}
template <typename T>
void reorder(vector<T> &a, const vector<int> &ord) {
int n = a.size();
vector<T> b(n);
for (int i = 0; i < n; i++) b[i] = a[ord[i]];
swap(a, b);
}
template <typename T>
T floor(T x, T y) {
assert(y != 0);
if (y < 0) x = -x, y = -y;
return (x >= 0 ? x / y : (x - y + 1) / y);
}
template <typename T>
T ceil(T x, T y) {
assert(y != 0);
if (y < 0) x = -x, y = -y;
return (x >= 0 ? (x + y - 1) / y : x / y);
}
template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first + q.first, p.second + q.second);
}
template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first - q.first, p.second - q.second);
}
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
S a;
T b;
is >> a >> b;
p = make_pair(a, b);
return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
return os << p.first << ' ' << p.second;
}
struct io_setup {
io_setup() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(15);
}
} io_setup;
constexpr int inf = (1 << 30) - 1;
constexpr ll INF = (1LL << 60) - 1;
// constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;
pair<vector<vector<int>>, vector<vector<int>>> functional_graph_decompose(const vector<int> &a) {
int n = a.size();
vector<vector<int>> cycles;
vector<vector<int>> es(n);
vector<int> c(n, 0);
for (int i = 0; i < n; i++) {
for (int p = i;; p = a[p]) {
if (c[p] == 1) {
int q = p;
vector<int> cycle;
do {
cycle.push_back(q);
c[q] = 3;
q = a[q];
} while (q != p);
cycles.push_back(cycle);
}
if (c[p] >= 2) break;
c[p]++;
}
for (int p = i; c[p] == 1; p = a[p]) c[p] = 2;
}
for (int i = 0; i < n; i++) {
if (c[i] != 3) {
es[i].push_back(a[i]);
es[a[i]].push_back(i);
}
}
return make_pair(cycles, es);
}
void solve() {
int N;
cin >> N;
vector<ll> a(N), b(N);
vector<int> c(N);
rep(i, N) cin >> a[i];
rep(i, N) cin >> b[i];
rep(i, N) cin >> c[i], c[i]--;
ll sa = accumulate(all(a), 0LL);
ll sb = accumulate(all(b), 0LL);
vector<vector<int>> cycles, es;
tie(cycles, es) = functional_graph_decompose(c);
auto judge = [&](ll M) {
vector<ll> d(N);
rep(i, N) d[i] = b[i] * M;
bool ok = true;
auto dfs = [&](auto &&dfs, int now, int pre = -1) -> ll {
ll sum = 0;
each(e, es[now]) {
if (e == pre) continue;
ll t = dfs(dfs, e, now);
sum += t;
}
// if (a[now] + sum < d[now]) {
// ok = false;
// return 0;
// }
// return a[now] + sum - d[now];
sum += d[now] - a[now];
if (pre != -1) chmax(sum, 0LL);
return sum;
};
each(cycle, cycles) {
ll sum = 0;
each(e, cycle) {
// d[e] -= dfs(dfs, e);
// sum += a[e] - d[e];
sum += dfs(dfs, e);
}
if (sum > 0) return false;
}
return ok;
};
ll ok = 0, ng = ceil(sa, sb) + 3;
while (abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2;
(judge(mid) ? ok : ng) = mid;
}
cout << ok << '\n';
}
int main() {
int T = 1;
// cin >> T;
while (T--) solve();
}