#961134 (C++17) No.2677 Minmax Independent Set

提出ソース

結果

問題	No.2677 Minmax Independent Set
ユーザー	dyktr_06
提出日時	2024-03-16 00:41:43
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,429 bytes
コンパイル時間	5,152 ms
コンパイル使用メモリ	283,604 KB
実行使用メモリ	199,772 KB
最終ジャッジ日時	2024-09-30 03:37:21
合計ジャッジ時間	25,567 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,816 KB
testcase_03	AC	2 ms 6,816 KB
testcase_04	AC	2 ms 6,820 KB
testcase_05	AC	578 ms 78,040 KB
testcase_06	AC	577 ms 79,352 KB
testcase_07	AC	570 ms 81,744 KB
testcase_08	AC	571 ms 82,520 KB
testcase_09	AC	568 ms 87,020 KB
testcase_10	WA	-
testcase_11	WA	-
testcase_12	AC	582 ms 199,772 KB
testcase_13	AC	723 ms 113,908 KB
testcase_14	AC	636 ms 111,496 KB
testcase_15	AC	791 ms 138,700 KB
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	AC	496 ms 77,620 KB
testcase_29	AC	722 ms 144,172 KB
testcase_30	AC	2 ms 6,816 KB
testcase_31	AC	2 ms 6,816 KB
testcase_32	AC	2 ms 6,820 KB
testcase_33	WA	-
testcase_34	AC	2 ms 6,820 KB
testcase_35	WA	-
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	WA	-
testcase_42	WA	-
testcase_43	WA	-
testcase_44	WA	-
testcase_45	WA	-
testcase_46	WA	-
testcase_47	WA	-
testcase_48	WA	-
testcase_49	WA	-
testcase_50	AC	161 ms 31,320 KB
testcase_51	AC	11 ms 6,816 KB
testcase_52	AC	400 ms 65,820 KB
testcase_53	AC	348 ms 61,772 KB
testcase_54	AC	9 ms 6,820 KB
testcase_55	WA	-
testcase_56	WA	-
testcase_57	WA	-
testcase_58	WA	-
testcase_59	WA	-
testcase_60	AC	292 ms 68,192 KB
testcase_61	WA	-
testcase_62	AC	351 ms 93,536 KB
testcase_63	AC	440 ms 138,384 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

template<typename E, typename V>
struct Rerooting{
    struct edge{
        int from, to, idx, rev_idx;
    };
    int n, root;
    vector<vector<edge>> edges;
    vector<int> visited;
    vector<vector<E>> out;
    vector<E> reverse_edge;
    vector<V> ans;
    function<E(E, E)> merge;
    E e;
    function<E(V, int)> put_edge;
    function<V(E, int)> put_vertex;
    Rerooting(int _n, const function<E(E, E)> &_merge, const E &_e, const function<E(V, int)> &_put_edge, const function<V(E, int)> &_put_vertex) : n(_n), merge(_merge), e(_e), put_edge(_put_edge), put_vertex(_put_vertex){
        edges.resize(n);
    }

private:
    V dfs(int v){
        visited[v]++;
        E val = e;
        for(auto &p : edges[v]){
            if(visited[p.to] > 0 && p.to != edges[v].back().to){
                swap(p, edges[v].back());
            }
            if(visited[p.to] > 0) continue;
            E nval = put_edge(dfs(p.to), p.idx);
            out[v].emplace_back(nval);
            val = merge(val, nval);
        }
        return put_vertex(val, v);
    }

    void bfs(int v){
        int siz = out[v].size();
        vector<E> left(siz + 1), right(siz + 1);
        left[0] = e, right[siz] = e;
        for(int i = 0; i < siz; i++){
            left[i + 1] = merge(left[i], out[v][i]);
        }
        for(int i = siz - 1; i >= 0; i--){
            right[i] = merge(out[v][i], right[i + 1]);
        }
        for(int i = 0; i < siz; i++){
            reverse_edge[edges[v][i].to] = put_edge(put_vertex(merge(merge(left[i], right[i + 1]), reverse_edge[v]), v), edges[v][i].rev_idx);
            bfs(edges[v][i].to);
        }
        ans[v] = put_vertex(merge(left[siz], reverse_edge[v]), v);
    }

public:
    void add_edge(int u, int v, int idx1, int idx2){
        edges[u].push_back({u, v, idx1, idx2});
        edges[v].push_back({v, u, idx2, idx1});
    }

    V build(int v = 0){
        root = v;
        out.resize(n);
        visited.assign(n, 0);
        return dfs(root);
    }

    vector<V> reroot(){
        reverse_edge.resize(n);
        reverse_edge[root] = e;
        ans.resize(n);
        bfs(root);
        return ans;
    }
};

ll n;

void input(){
    in(n);
}

// ll solve_sub(ll x){
//     auto dfs = [&](auto &self, ll curr, ll prev) -> vll {
//         vll dp(2);
//         dp[1] = 1;
//         for(auto x : G[curr]){
//             if(x == prev) continue;
//             vll ndp = self(self, x, curr);
//             dp[0] += max(ndp[0], ndp[1]);
//             dp[1] += ndp[0];
//         }
//         return dp;
//     };
//     vll dp = dfs(dfs, x, -1);
//     return dp[1];
// }

void solve(){
    using T = vll;
    auto merge = [&](T x, T y){
        T res = {x[0] + y[0], x[1] + y[1]};
        return res;
    };
    auto put_edge = [&](T x, int i){
        return x;
    };
    auto put_vertex = [&](T e, int v){
        T res = {max(e[0], e[1]), e[0] + 1LL};
        return res;
    };
    T e = {0LL, 0LL};
    Rerooting<T, T> G(n, merge, e, put_edge, put_vertex);
    rep(i, n - 1){
        ll a, b; in(a, b); a--, b--;
        G.add_edge(a, b, i, i);
    }
    G.build();
    ll ans = INF;
    for(auto x : G.reroot()){
        chmin(ans, x[1]);
    }
    out(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}

yukicoder

結果

テストケース

ソースコード