結果

問題 No.1976 Cut then Connect
ユーザー 👑 NachiaNachia
提出日時 2022-06-11 01:44:38
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 31 ms / 2,000 ms
コード長 7,426 bytes
コンパイル時間 1,164 ms
コンパイル使用メモリ 93,804 KB
実行使用メモリ 8,832 KB
最終ジャッジ日時 2024-11-24 12:16:45
合計ジャッジ時間 2,392 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 30 ms
8,320 KB
testcase_03 AC 17 ms
6,816 KB
testcase_04 AC 7 ms
6,816 KB
testcase_05 AC 15 ms
6,820 KB
testcase_06 AC 22 ms
7,296 KB
testcase_07 AC 15 ms
6,820 KB
testcase_08 AC 30 ms
8,704 KB
testcase_09 AC 27 ms
7,808 KB
testcase_10 AC 8 ms
6,816 KB
testcase_11 AC 30 ms
8,448 KB
testcase_12 AC 2 ms
6,816 KB
testcase_13 AC 24 ms
7,296 KB
testcase_14 AC 22 ms
7,040 KB
testcase_15 AC 21 ms
6,816 KB
testcase_16 AC 29 ms
8,192 KB
testcase_17 AC 11 ms
6,820 KB
testcase_18 AC 4 ms
6,816 KB
testcase_19 AC 23 ms
7,168 KB
testcase_20 AC 31 ms
8,832 KB
testcase_21 AC 19 ms
6,816 KB
testcase_22 AC 2 ms
6,816 KB
testcase_23 AC 2 ms
6,816 KB
testcase_24 AC 1 ms
6,820 KB
testcase_25 AC 2 ms
6,816 KB
testcase_26 AC 1 ms
6,816 KB
testcase_27 AC 2 ms
6,816 KB
testcase_28 AC 2 ms
6,816 KB
testcase_29 AC 2 ms
6,816 KB
testcase_30 AC 1 ms
6,820 KB
testcase_31 AC 1 ms
6,816 KB
testcase_32 AC 1 ms
6,820 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 


#include <vector>
#include <utility>

namespace nachia{
    
struct AdjacencyList{
public:
    struct AdjacencyListRange{
        using iterator = typename std::vector<int>::const_iterator;
        iterator begi, endi;
        iterator begin() const { return begi; }
        iterator end() const { return endi; }
        int size() const { return (int)std::distance(begi, endi); }
        const int& operator[](int i) const { return begi[i]; }
    };
private:
    int mn;
    std::vector<int> E;
    std::vector<int> I;
public:
    AdjacencyList(int n, std::vector<std::pair<int,int>> edges, bool rev){
        mn = n;
        std::vector<int> buf(n+1, 0);
        for(auto [u,v] : edges){ ++buf[u]; if(rev) ++buf[v]; }
        for(int i=1; i<=n; i++) buf[i] += buf[i-1];
        E.resize(buf[n]);
        for(int i=(int)edges.size()-1; i>=0; i--){
            auto [u,v] = edges[i];
            E[--buf[u]] = v;
            if(rev) E[--buf[v]] = u;
        }
        I = std::move(buf);
    }
    AdjacencyList(const std::vector<std::vector<int>>& edges = {}){
        int n = mn = edges.size();
        std::vector<int> buf(n+1, 0);
        for(int i=0; i<n; i++) buf[i+1] = buf[i] + edges[i].size();
        E.resize(buf[n]);
        for(int i=0; i<n; i++) for(int j=0; j<(int)edges[i].size(); j++) E[buf[i]+j] = edges[i][j];
        I = std::move(buf);
    }
    static AdjacencyList from_raw(std::vector<int> targets, std::vector<int> bounds){
        AdjacencyList res;
        res.mn = bounds.size() - 1;
        res.E = std::move(targets);
        res.I = std::move(bounds);
        return res;
    }
    AdjacencyListRange operator[](int u) const {
        return AdjacencyListRange{ E.begin() + I[u], E.begin() + I[u+1] };
    }
    int num_vertices() const { return mn; }
    int size() const { return num_vertices(); }
    int num_edges() const { return E.size(); }
    AdjacencyList reversed_edges() const {
        AdjacencyList res;
        int n = res.mn = mn;
        std::vector<int> buf(n+1, 0);
        for(int v : E) ++buf[v];
        for(int i=1; i<=n; i++) buf[i] += buf[i-1];
        res.E.resize(buf[n]);
        for(int u=0; u<n; u++) for(int v : operator[](u)) res.E[--buf[v]] = u;
        res.I = std::move(buf);
        return res;
    }
};

struct AdjacencyListEdgeIndexed{
public:
    struct Edge { int to; int edgeidx; };
    struct AdjacencyListRange{
        using iterator = typename std::vector<Edge>::const_iterator;
        iterator begi, endi;
        iterator begin() const { return begi; }
        iterator end() const { return endi; }
        int size() const { return (int)std::distance(begi, endi); }
        const Edge& operator[](int i) const { return begi[i]; }
    };
private:
    int mn;
    std::vector<Edge> E;
    std::vector<int> I;
public:
    AdjacencyListEdgeIndexed(int n, const std::vector<std::pair<int,int>>& edges, bool rev){
        mn = n;
        std::vector<int> buf(n+1, 0);
        for(auto [u,v] : edges){ ++buf[u]; if(rev) ++buf[v]; }
        for(int i=1; i<=n; i++) buf[i] += buf[i-1];
        E.resize(buf[n]);
        for(int i=(int)edges.size()-1; i>=0; i--){
            auto [u,v] = edges[i];
            E[--buf[u]] = { v, i };
            if(rev) E[--buf[v]] = { u, i };
        }
        I = std::move(buf);
    }
    AdjacencyListEdgeIndexed() : AdjacencyListEdgeIndexed(0, {}, false) {}
    AdjacencyListRange operator[](int u) const {
        return AdjacencyListRange{ E.begin() + I[u], E.begin() + I[u+1] };
    }
    int num_vertices() const { return mn; }
    int size() const { return num_vertices(); }
    int num_edges() const { return E.size(); }
    AdjacencyListEdgeIndexed reversed_edges() const {
        AdjacencyListEdgeIndexed res;
        int n = res.mn = mn;
        std::vector<int> buf(n+1, 0);
        for(auto [v,i] : E) ++buf[v];
        for(int i=1; i<=n; i++) buf[i] += buf[i-1];
        res.E.resize(buf[n]);
        for(int u=0; u<n; u++) for(auto [v,i] : operator[](u)) res.E[--buf[v]] = {u,i};
        res.I = std::move(buf);
        return res;
    }
};

} // namespace nachia

#include <algorithm>

struct S {
    int height;
    int diam;
};

struct Edge {
};


S rake(S l, S r){
    S res;
    res.height = std::max(l.height, r.height);
    res.diam = std::max({ l.diam, r.diam, l.height + r.height });
    return res;
}

S compress(S l, Edge edge){
    S res;
    res.height = l.height + 1;
    res.diam = std::max(l.diam, res.height);
    return res;
}

S e(){ return { 0,0 }; }
S node(int v){ return { 0,0 }; }



struct AnyDirectionTreeDP{
    std::vector<S> low;
    std::vector<S> high;
    std::vector<int> edgei;

    AnyDirectionTreeDP(const nachia::AdjacencyListEdgeIndexed& adj){
        int n = adj.num_vertices();
        std::vector<int> bfs = {0};
        bfs.reserve(n);
        std::vector<int> P(n, -1);
        edgei.assign(n, -1);
        for(int i=0; i<n; i++){
            int p = bfs[i];
            for(auto edge : adj[p]) if(P[p] != edge.to){
                P[edge.to] = p;
                edgei[edge.to] = edge.edgeidx;
                bfs.push_back(edge.to);
            }
        }

        low.assign(n-1, e());
        high.assign(n-1, e());

        for(int i=0; i<n; i++) if(edgei[i] != -1) low[edgei[i]] = node(i);
        for(int i=0; i<n; i++) if(edgei[i] != -1) high[edgei[i]] = node(P[i]);

        for(int i=n-1; i>=1; i--){
            int p = bfs[i];
            if(edgei[P[p]] == -1) continue;
            low[edgei[P[p]]] = rake(low[edgei[P[p]]], compress(low[edgei[p]], {}));
        }

        for(int i=0; i<n; i++){
            int p = bfs[i];
            int pei = edgei[p];
            int C = adj[p].size();
            if(pei != -1) for(int ci=0; ci<C; ci++) if(P[p] != adj[p][ci].to){
                int c = adj[p][ci].edgeidx;
                high[c] = compress(high[pei], {});
            }
            S fold = e();
            for(int ci=C-1; ci>=0; ci--) if(P[p] != adj[p][ci].to){
                int c = adj[p][ci].edgeidx;
                high[c] = rake(high[c], fold);
                fold = rake(fold, compress(low[c], {}));
            }
            fold = e();
            for(int ci=0; ci<C; ci++) if(P[p] != adj[p][ci].to){
                int c = adj[p][ci].edgeidx;
                high[c] = rake(high[c], fold);
                fold = rake(fold, compress(low[c], {}));
            }
        }
    }
};


#include <iostream>
#include <string>
#include <atcoder/modint>


using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i,n) for(int i=0; i<(int)(n); i++)


const i64 INF = 1001001001001001001;
using modint = atcoder::static_modint<1000000007>;


int main(){
    int N; cin >> N;
    vector<pair<int,int>> edges(N-1);
    rep(i,N-1){ int u,v; cin >> u >> v; u--; v--; edges[i] = make_pair(u,v); }
    auto adj = nachia::AdjacencyListEdgeIndexed(N, edges, true);

    auto treedp = AnyDirectionTreeDP(adj);

    int ans = N;
    rep(i,N-1){
        int diam1 = treedp.high[i].diam;
        int diam2 = treedp.low[i].diam;
        int cr_ans = (diam1 + 1) / 2 + (diam2 + 1) / 2 + 1;
        cr_ans = max({ cr_ans, diam1, diam2 });
        ans = min(ans, cr_ans);
    }

    cout << ans << '\n';
    
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;
0