結果

問題 No.2677 Minmax Independent Set
ユーザー stoqstoq
提出日時 2024-03-15 23:01:16
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 289 ms / 2,000 ms
コード長 7,680 bytes
コンパイル時間 4,852 ms
コンパイル使用メモリ 280,944 KB
実行使用メモリ 77,952 KB
最終ジャッジ日時 2024-09-30 02:35:38
合計ジャッジ時間 14,815 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 17 ms
9,088 KB
testcase_01 AC 17 ms
9,216 KB
testcase_02 AC 16 ms
9,088 KB
testcase_03 AC 17 ms
9,088 KB
testcase_04 AC 17 ms
9,216 KB
testcase_05 AC 222 ms
36,736 KB
testcase_06 AC 224 ms
37,276 KB
testcase_07 AC 221 ms
37,888 KB
testcase_08 AC 228 ms
38,912 KB
testcase_09 AC 229 ms
41,216 KB
testcase_10 AC 184 ms
34,484 KB
testcase_11 AC 179 ms
34,484 KB
testcase_12 AC 254 ms
77,952 KB
testcase_13 AC 263 ms
48,816 KB
testcase_14 AC 245 ms
49,040 KB
testcase_15 AC 281 ms
58,184 KB
testcase_16 AC 233 ms
31,784 KB
testcase_17 AC 241 ms
31,744 KB
testcase_18 AC 144 ms
23,548 KB
testcase_19 AC 171 ms
26,160 KB
testcase_20 AC 55 ms
15,104 KB
testcase_21 AC 195 ms
28,020 KB
testcase_22 AC 26 ms
10,752 KB
testcase_23 AC 17 ms
9,216 KB
testcase_24 AC 17 ms
9,216 KB
testcase_25 AC 17 ms
9,088 KB
testcase_26 AC 17 ms
9,088 KB
testcase_27 AC 17 ms
9,344 KB
testcase_28 AC 174 ms
34,804 KB
testcase_29 AC 289 ms
60,596 KB
testcase_30 AC 17 ms
9,216 KB
testcase_31 AC 17 ms
9,088 KB
testcase_32 AC 17 ms
9,216 KB
testcase_33 AC 17 ms
9,216 KB
testcase_34 AC 17 ms
9,216 KB
testcase_35 AC 17 ms
9,088 KB
testcase_36 AC 17 ms
9,088 KB
testcase_37 AC 17 ms
9,216 KB
testcase_38 AC 17 ms
9,344 KB
testcase_39 AC 18 ms
9,344 KB
testcase_40 AC 18 ms
9,472 KB
testcase_41 AC 20 ms
9,856 KB
testcase_42 AC 25 ms
10,624 KB
testcase_43 AC 32 ms
12,032 KB
testcase_44 AC 51 ms
14,720 KB
testcase_45 AC 111 ms
20,224 KB
testcase_46 AC 236 ms
31,176 KB
testcase_47 AC 243 ms
31,436 KB
testcase_48 AC 234 ms
31,496 KB
testcase_49 AC 237 ms
31,616 KB
testcase_50 AC 70 ms
18,740 KB
testcase_51 AC 20 ms
9,856 KB
testcase_52 AC 152 ms
30,516 KB
testcase_53 AC 138 ms
28,756 KB
testcase_54 AC 20 ms
9,728 KB
testcase_55 AC 190 ms
34,536 KB
testcase_56 AC 190 ms
34,592 KB
testcase_57 AC 199 ms
34,572 KB
testcase_58 AC 193 ms
34,800 KB
testcase_59 AC 189 ms
34,548 KB
testcase_60 AC 114 ms
31,476 KB
testcase_61 AC 119 ms
32,124 KB
testcase_62 AC 125 ms
41,592 KB
testcase_63 AC 137 ms
56,560 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

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

template <typename T>
struct ReRooting {
  using F_f = function<T(T, int, int)>;
  using F_g = function<T(T, int)>;
  using F_merge = function<T(T, T)>;
  int V;
  vector<vector<int>> G;
  vector<vector<T>> dp;
  // dp_v = g(merge(f(dp_c1,c1,v), f(dp_c2,c2,v), ..., f(dp_ck,ck,v)), v)
  F_f f;
  F_g g;
  F_merge merge;
  T mi;  // identity of merge

  ReRooting() {}
  ReRooting(int V, F_f f, F_merge merge, T mi, F_g g)
      : V(V), f(f), merge(merge), mi(mi), g(g) {
    G.resize(V);
    dp.resize(V);
  }

  void read(int idx = 1) {
    int a, b;
    for (int i = 0; i < V - 1; ++i) {
      cin >> a >> b;
      a -= idx, b -= idx;
      G[a].emplace_back(b);
      G[b].emplace_back(a);
    }
  }

  void add_edge(int a, int b) {
    G[a].emplace_back(b);
    G[b].emplace_back(a);
  }

  T dfs1(int p, int v) {
    T res = mi;
    for (int i = 0; i < G[v].size(); ++i) {
      if (G[v][i] == p) continue;
      dp[v][i] = dfs1(v, G[v][i]);
      res = merge(res, f(dp[v][i], G[v][i], v));
    }
    return g(res, v);
  }

  void dfs2(int p, int v, T from_par) {
    for (int i = 0; i < G[v].size(); ++i) {
      if (G[v][i] == p) {
        dp[v][i] = from_par;
        break;
      }
    }
    vector<T> pR(G[v].size() + 1);
    pR[G[v].size()] = mi;
    for (int i = G[v].size(); i > 0; --i)
      pR[i - 1] = merge(pR[i], f(dp[v][i - 1], G[v][i - 1], v));
    T pL = mi, val;
    for (int i = 0; i < G[v].size(); ++i) {
      if (G[v][i] != p) {
        val = merge(pL, pR[i + 1]);
        dfs2(v, G[v][i], g(val, v));
      }
      pL = merge(pL, f(dp[v][i], G[v][i], v));
    }
  }

  void calc(int root = 0) {
    for (int i = 0; i < V; ++i) dp[i].resize(G[i].size());
    dfs1(-1, root);
    dfs2(-1, root, mi);
  }

  T solve(int v) {
    T ans = mi;
    for (int i = 0; i < G[v].size(); ++i)
      ans = merge(ans, f(dp[v][i], G[v][i], v));
    return g(ans, v);
  }
};

void solve() {
  auto f = [&](pii p, int _, int __) {
    pii q;
    q.first = p.second;
    q.second = max(p.first, p.second);
    return q;
  };
  auto merge = [&](pii p, pii q) {
    pii r;
    r.first = p.first + q.first;
    r.second = p.second + q.second;
    return r;
  };
  auto g = [&](pii p, int _) {
    p.first++;
    return p;
  };
  int n;
  cin >> n;
  ReRooting<pii> re(n, f, merge, pii{0, 0}, g);
  re.read();
  re.calc();
  int Min = INF;
  rep(i, n) {
    int sum = 0;
    rep(j, re.dp[i].size()) { sum += re.dp[i][j].second; }
    chmin(Min, sum + 1);
  }
  cout << Min << "\n";
}

int main() { solve(); }
0