結果

問題 No.2677 Minmax Independent Set
ユーザー siganai
提出日時 2024-03-15 23:17:55
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 254 ms / 2,000 ms
コード長 6,582 bytes
コンパイル時間 2,436 ms
コンパイル使用メモリ 205,660 KB
最終ジャッジ日時 2025-02-20 06:04:27
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 61
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "test.cpp"
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vul = vector<ull>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
void Yes() {cout << "Yes\n";return;}
void No() {cout << "No\n";return;}
void YES() {cout << "YES\n";return;}
void NO() {cout << "NO\n";return;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} 
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }

#undef unpack
static const double PI = 3.1415926535897932;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};

constexpr int mod = 998244353;
//constexpr int mod = 1000000007;
#line 2 "library/tree/Rerooting.hpp"
template <typename T, typename G, typename F1, typename F2>
struct Rerooting {
    const G &g;
    const F1 f1;
    const F2 f2;
    vector<T> memo,memo2,dp;
    T I;

    Rerooting(const G &_g, const F1 _f1, const F2 _f2, const T &I_)
        : g(_g), f1(_f1), f2(_f2), memo(g.size(), I_), memo2(g.size(),I_),dp(g.size(), I_), I(I_) {
        dfs(0, -1);
        efs(0, -1, I);
    }
    const T &operator[](int i) const { return dp[i]; }
    void dfs(int cur, int par) {
        for (auto &dst : g[cur]) {
            if (dst == par) continue;
            dfs(dst, cur);
            memo[cur] = f1(memo[cur], f2(memo[dst], dst, cur));
        }
    }
    void efs(int cur, int par, const T &pval) {
        // get cumulative sum
        vector<T> buf;
        for (auto dst : g[cur]) {
            if (dst == par) continue;
            buf.push_back(f2(memo[dst], dst, cur));
        }
        vector<T> head(buf.size() + 1), tail(buf.size() + 1);
        head[0] = tail[buf.size()] = I;
        for (int i = 0; i < (int)buf.size(); i++) head[i + 1] = f1(head[i], buf[i]);
        for (int i = (int)buf.size() - 1; i >= 0; i--) tail[i] = f1(tail[i + 1], buf[i]);
        memo2[cur] = pval;
        // update
        dp[cur] = par == -1 ? head.back() : f1(pval, head.back());
        // propagate
        int idx = 0;
        for (auto &dst : g[cur]) {
            if (dst == par) continue;
            efs(dst, cur, f2(f1(pval, f1(head[idx], tail[idx + 1])), cur, dst));
            idx++;
        }
    }
};
#line 90 "test.cpp"
int main() {
    INT(n);
    vvi g(n);
    rep(i,n-1) {
        INT(u,v);
        u--,v--;
        g[u].emplace_back(v);
        g[v].emplace_back(u);
    }
    using T = pii;
    // identify element of f1, and answer of leaf
    T I = {0,0};
    
    // merge value of child node
    auto f1 = [&](T x, T y) -> T {
        T ret;
        ret.first = x.first + y.first;
        ret.second = max(x.first,x.second) + max(y.first,y.second);
        return ret;
    };
    
    // return value from child node to parent node
    auto f2 = [&](T x, int chd, int par) -> T {
        T ret;
        ret.first = max(x.first,x.second);
        ret.second = max(x.second,x.first + 1);
        return ret;
    };
    
    Rerooting<T, decltype(g), decltype(f1), decltype(f2)> dp(g, f1, f2, I);
    debug(dp.dp,dp.memo,dp.memo2);
    int ans = n;
    rep(i,n) chmin(ans,dp.dp[i].first + 1);
    cout << ans << '\n';
}
0