結果

問題 No.2523 Trick Flower
ユーザー stoqstoq
提出日時 2023-10-28 00:11:07
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 739 ms / 4,000 ms
コード長 7,132 bytes
コンパイル時間 5,739 ms
コンパイル使用メモリ 279,976 KB
実行使用メモリ 27,588 KB
最終ジャッジ日時 2023-10-28 00:11:20
合計ジャッジ時間 11,621 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 17 ms
8,988 KB
testcase_01 AC 17 ms
8,988 KB
testcase_02 AC 17 ms
8,988 KB
testcase_03 AC 17 ms
8,988 KB
testcase_04 AC 17 ms
8,988 KB
testcase_05 AC 17 ms
8,988 KB
testcase_06 AC 17 ms
8,988 KB
testcase_07 AC 16 ms
8,988 KB
testcase_08 AC 17 ms
9,308 KB
testcase_09 AC 17 ms
9,308 KB
testcase_10 AC 17 ms
8,988 KB
testcase_11 AC 17 ms
9,368 KB
testcase_12 AC 17 ms
8,988 KB
testcase_13 AC 17 ms
9,308 KB
testcase_14 AC 17 ms
9,308 KB
testcase_15 AC 739 ms
27,588 KB
testcase_16 AC 739 ms
27,588 KB
testcase_17 AC 91 ms
19,212 KB
testcase_18 AC 63 ms
21,508 KB
testcase_19 AC 335 ms
21,716 KB
testcase_20 AC 178 ms
21,716 KB
testcase_21 AC 171 ms
21,716 KB
testcase_22 AC 214 ms
21,716 KB
testcase_23 AC 282 ms
21,716 KB
testcase_24 AC 190 ms
16,436 KB
testcase_25 AC 235 ms
20,396 KB
testcase_26 AC 106 ms
19,972 KB
testcase_27 AC 192 ms
21,188 KB
testcase_28 AC 100 ms
18,940 KB
testcase_29 AC 36 ms
11,420 KB
testcase_30 AC 226 ms
17,756 KB
testcase_31 AC 21 ms
9,836 KB
testcase_32 AC 131 ms
14,324 KB
testcase_33 AC 149 ms
21,516 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 2

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
// #include <atcoder/lazysegtree>
// #include <atcoder/modint>
// #include <atcoder/segtree>
using namespace atcoder;
#if 0
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 0
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <typename T>
using extset =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif
#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#pragma region Macros
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;
#if MOD_TYPE == 1
constexpr ll MOD = ll(1e9 + 7);
#else
#if MOD_TYPE == 2
constexpr ll MOD = 998244353;
#else
constexpr ll MOD = 1000003;
#endif
#endif
using mint = static_modint<MOD>;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
const double PI = acos(-1.0);
constexpr ld EPS = 1e-10;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};
#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define RREP(i, m, n) for (ll i = n - 1; i >= m; i--)
#define rrep(i, n) RREP(i, 0, n)
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";
#define UNIQUE(v) v.erase(unique(all(v)), v.end())
struct io_init {
  io_init() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(20) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline ll floor(ll a, ll b) {
  if (b < 0) a *= -1, b *= -1;
  if (a >= 0) return a / b;
  return -((-a + b - 1) / b);
}
inline ll ceil(ll a, ll b) { return floor(a + b - 1, b); }
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}
template <typename T>
vector<T> compress(vector<T> &v) {
  vector<T> val = v;
  sort(all(val)), val.erase(unique(all(val)), val.end());
  for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();
  return val;
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {
  os << p.first << " " << p.second;
  return os;
}
ostream &operator<<(ostream &os, mint m) {
  os << m.val();
  return os;
}
ostream &operator<<(ostream &os, modint m) {
  os << m.val();
  return os;
}
template <typename T>
constexpr istream &operator>>(istream &is, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++) is >> v[i];
  return is;
}
template <typename T>
constexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++)
    os << v[i] << (i + 1 == v.size() ? "" : " ");
  return os;
}
template <typename T>
constexpr void operator--(vector<T> &v, int) noexcept {
  for (int i = 0; i < v.size(); i++) v[i]--;
}
random_device seed_gen;
mt19937_64 engine(seed_gen());
inline ll randInt(ll l, ll r) { return engine() % (r - l + 1) + l; }
struct BiCoef {
  vector<mint> fact_, inv_, finv_;
  BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
    fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
    for (int i = 2; i < n; i++) {
      fact_[i] = fact_[i - 1] * i;
      inv_[i] = -inv_[MOD % i] * (MOD / i);
      finv_[i] = finv_[i - 1] * inv_[i];
    }
  }
  mint C(ll n, ll k) const noexcept {
    if (n < k || n < 0 || k < 0) return 0;
    return fact_[n] * finv_[k] * finv_[n - k];
  }
  mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }
  mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }
  mint Ch1(ll n, ll k) const noexcept {
    if (n < 0 || k < 0) return 0;
    mint res = 0;
    for (int i = 0; i < n; i++)
      res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);
    return res;
  }
  mint fact(ll n) const noexcept {
    if (n < 0) return 0;
    return fact_[n];
  }
  mint inv(ll n) const noexcept {
    if (n < 0) return 0;
    return inv_[n];
  }
  mint finv(ll n) const noexcept {
    if (n < 0) return 0;
    return finv_[n];
  }
};
BiCoef bc(500010);
#pragma endregion

// -------------------------------

int n;
vector<ll> a, b;
vector<int> c;

vector<int> par;
vector<vector<int>> ch;
vector<int> roots;

void precalc() {
  // ループを一つに圧縮する
  // 葉から順に削る
  vector<vector<int>> G(n);
  vector<int> rev(n);
  vector<int> d(n);
  rep(i, n) {
    G[c[i]].push_back(i);
    rev[i] = c[i];
    d[c[i]]++;
  }
  queue<int> que;
  rep(i, n) {
    if (G[i].empty()) que.push(i);
  }
  vector<int> used(n);
  while (not que.empty()) {
    int v = que.front();
    que.pop();
    used[v] = 1;
    d[rev[v]]--;
    if (d[rev[v]] == 0) {
      que.push(rev[v]);
    }
  }
  vector<int> root_num(n, -1);
  rep(si, n) {
    if (used[si]) continue;
    int v = si;
    // si にマージ
    while (not used[v]) {
      used[v] = 1;
      root_num[v] = si;
      v = rev[v];
    }
  }

  par.assign(n, -1);
  ch.resize(n);
  rep(i, n) {
    for (auto t : G[i]) {
      int from = (root_num[i] == -1 ? i : root_num[i]);
      int to = (root_num[t] == -1 ? t : root_num[t]);
      if (from == to) continue;
      ch[from].push_back(to);
      par[to] = from;
    }

    if (root_num[i] != -1 and root_num[i] != i) {
      a[root_num[i]] += a[i];
      b[root_num[i]] += b[i];
      a[i] = 0;
      b[i] = 0;
    }
  }
  rep(i, n) {
    if (root_num[i] == i) roots.push_back(i);
  }
}

__int128 dp(int v, __int128 x) {
  __int128 require = 0;
  for (auto c : ch[v]) {
    require += dp(c, x);
  }
  require += x * b[v] - a[v];
  chmax(require, __int128(0));
  return require;
}

bool f(ll x) {
  for (auto r : roots) {
    if (dp(r, x) != 0) return false;
  }
  return true;
}

void solve() {
  cin >> n;
  a.resize(n);
  b.resize(n);
  c.resize(n);
  cin >> a >> b >> c;
  c--;
  precalc();
  auto binary_search = [&]() {
    ll lo = -1, hi = 1e15;
    while (hi - lo > 1) {
      ll mi = (lo + hi) / 2;
      if (f(mi))
        lo = mi;
      else
        hi = mi;
    }
    return lo;
  };
  cout << binary_search() << "\n";
}

int main() { solve(); }
0