#1100325 (C++23) No.3189 Semifinal Stage

提出ソース
結果

問題	No.3189 Semifinal Stage
ユーザー	noya2
提出日時	2025-06-20 23:27:23
言語	C++23 (gcc 13.3.0 + boost 1.87.0)
結果	AC
実行時間	1,094 ms / 4,000 ms
コード長	12,665 bytes
コンパイル時間	4,621 ms
コンパイル使用メモリ	301,232 KB
実行使用メモリ	12,540 KB
最終ジャッジ日時	2025-06-20 23:27:48
合計ジャッジ時間	22,605 ms
ジャッジサーバーID （参考情報）	judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン	結果
sample	AC * 2
other	AC * 30
権限があれば一括ダウンロードができます
ソースコード

raw source code
#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

#line 2 "/Users/noya2/Desktop/Noya2_library/tree/simple_tree.hpp"

#line 2 "/Users/noya2/Desktop/Noya2_library/data_structure/csr.hpp"

#line 4 "/Users/noya2/Desktop/Noya2_library/data_structure/csr.hpp"
#include<ranges>
#line 7 "/Users/noya2/Desktop/Noya2_library/data_structure/csr.hpp"

namespace noya2::internal {

template<class E>
struct csr {
    csr () {}
    csr (int _n) : n(_n) {}
    csr (int _n, int m) : n(_n){
        start.reserve(m);
        elist.reserve(m);
    }
    // ACL style constructor (do not have to call build)
    csr (int _n, const std::vector<std::pair<int,E>> &idx_elem) : n(_n), start(_n + 2), elist(idx_elem.size()) {
        for (auto &[i, e] : idx_elem){
            start[i + 2]++;
        }
        for (int i = 1; i < n; i++){
            start[i + 2] += start[i + 1];
        }
        for (auto &[i, e] : idx_elem){
            elist[start[i + 1]++] = e;
        }
        prepared = true;
    }
    int add(int idx, E elem){
        int eid = start.size();
        start.emplace_back(idx);
        elist.emplace_back(elem);
        return eid;
    }
    void build(){
        if (prepared) return ;
        int m = start.size();
        std::vector<E> nelist(m);
        std::vector<int> nstart(n + 2, 0);
        for (int i = 0; i < m; i++){
            nstart[start[i] + 2]++;
        }
        for (int i = 1; i < n; i++){
            nstart[i + 2] += nstart[i + 1];
        }
        for (int i = 0; i < m; i++){
            nelist[nstart[start[i] + 1]++] = elist[i];
        }
        swap(elist,nelist);
        swap(start,nstart);
        prepared = true;
    }
    const auto operator[](int idx) const {
        return std::ranges::subrange(elist.begin()+start[idx],elist.begin()+start[idx+1]);
    }
    auto operator[](int idx){
        return std::ranges::subrange(elist.begin()+start[idx],elist.begin()+start[idx+1]);
    }
    const auto operator()(int idx, int l, int r) const {
        return std::ranges::subrange(elist.begin()+start[idx]+l,elist.begin()+start[idx]+r);
    }
    auto operator()(int idx, int l, int r){
        return std::ranges::subrange(elist.begin()+start[idx]+l,elist.begin()+start[idx]+r);
    }
    size_t size() const {
        return n;
    }
    int n;
    std::vector<int> start;
    std::vector<E> elist;
    bool prepared = false;
};

} // namespace noya2::internal
#line 5 "/Users/noya2/Desktop/Noya2_library/tree/simple_tree.hpp"

namespace noya2 {

struct simple_tree {
    internal::csr<int> g;
    simple_tree () {}
    simple_tree (int _n) : g(_n, (_n - 1)*2) {
        if (_n == 1){
            g.build();
        }
    }
    void add_edge(int u, int v){
        g.add(u, v);
        int id = g.add(v, u);
        if (id + 1 == (g.n - 1)*2) g.build();
    }
    void input(int indexed = 1){
        for (int i = 0; i < g.n - 1; i++){
            int u, v; cin >> u >> v;
            u -= indexed, v -= indexed;
            add_edge(u, v);
        }
    }
    void input_parents(int indexed = 1){
        for (int i = 0; i < g.n - 1; i++){
            int v; cin >> v;
            v -= indexed;
            add_edge(i + 1, v);
        }
    }
    const auto operator[](int v) const {
        return g[v];
    }
    auto operator[](int v){
        return g[v];
    }
    size_t size() const {
        return g.size();
    }
};

} // namespace noya2
#line 4 "c.cpp"

struct fast_lca {
    int n;
    std::vector<int> down, dep;
    std::vector<int> a, pre, suf;
    std::vector<std::vector<int>> st;
    static constexpr int LG = 4;
    static constexpr int MASK = (1 << LG) - 1;
    fast_lca () {}
    fast_lca (const std::vector<int> &par) : n(par.size()), down(n), dep(n), a(n) {
        assert(n >= 1);
        // subtree size - 1
        for (int i = n - 1; i >= 1; i--){
            down[par[i]] += down[i] + 1;
        }
        // euler tour time
        for (int i = 1; i < n; i++){
            down[i] = std::exchange(down[par[i]], down[par[i]] - down[i] - 1);
            dep[i] = dep[par[i]] + 1;
        }
        // build a, pre, suf
        for (int i = 1; i < n; i++){
            a[down[i] - 1] = par[i];
        }
        pre = suf = a;
        for (int i = 1; i < n; i++){
            if (i & MASK){
                if (pre[i] > pre[i - 1]){
                    pre[i] = pre[i - 1];
                }
            }
        }
        for (int i = n - 1; i >= 1; i--){
            if (i & MASK){
                if (suf[i - 1] > suf[i]){
                    suf[i - 1] = suf[i];
                }
            }
        }
        // build st
        int n2 = n >> LG;
        int lg = (n2 <= 1 ? 1 : std::bit_width<uint32_t>(n2 - 1));
        st.resize(lg);
        st[0].resize(n2);
        for (int i = 0; i < n2; i++){
            st[0][i] = suf[i << LG];
        }
        for (int d = 0; d < lg - 1; d++){
            int nsz = (int)(st[d].size()) - (1 << d);
            st[d + 1].resize(nsz);
            for (int i = 0; i < nsz; i++){
                int x = st[d][i];
                int y = st[d][i + (1 << d)];
                st[d + 1][i] = (x < y ? x : y);
            }
        }
    }
    int st_prod(int l, int r) const {
        if (l == r){
            return std::numeric_limits<int>::max();
        }
        int k = std::bit_width<uint32_t>(r - l) - 1;
        int x = st[k][l];
        int y = st[k][r - (1 << k)];
        return (x < y ? x : y);
    }
    int prod(int l, int r) const {
        assert(l < r);
        r--;
        int x = l >> LG, y = r >> LG;
        if (x < y){
            int p1 = suf[l];
            int p2 = st_prod(x + 1, y);
            int p3 = pre[r];
            return (p1 < p2 ? (p1 < p3 ? p1 : p3) : (p2 < p3 ? p2 : p3));
        }
        int ret = a[l];
        for (int i = l + 1; i <= r; i++){
            if (ret > a[i]){
                ret = a[i];
            }
        }
        return ret;
    }
    int lca(int u, int v) const {
        if (u == v) return u;
        u = down[u], v = down[v];
        if (u > v) std::swap(u, v);
        return prod(u, v);
    }
    int dist(int u, int v) const {
        int l = lca(u, v);
        return dep[u] + dep[v] - 2 * dep[l];
    }
};



void solve(){
    int n; in(n);
    simple_tree g(n);
    g.input();
    vector<int> down(n);
    fast_lca fl([&]{
        int t = 0;
        vector<int> par(n);
        auto dfs = [&](auto sfs, int v, int f) -> void {
            down[v] = t++;
            for (int u : g[v]){
                if (u == f) continue;
                sfs(sfs,u,v);
                par[down[u]] = down[v];
            }
        };
        dfs(dfs,0,-1);
        return par;
    }());
    int q; in(q);
    vector<int> ts(q), vs(q);
    rep(i,q){
        in(ts[i]);
        int v; in(v); v--;
        vs[i] = v;
    }
    vector<bool> on(n,false);
    vector<int> dist(n);
    vector<int> see;
    auto rebuild = [&](int l, int r){
        vector<int> type(n);
        rep(i,n){
            type[i] = int(on[i]);
        }
        repp(i,l,r){
            if (ts[i] == 2) continue;
            int v = vs[i];
            type[v] = 2;
        }
        see.clear();
        queue<int> que;
        rep(i,n){
            if (type[i] == 1){
                dist[i] = 0;
                que.push(i);
            }
            else {
                if (type[i] == 2){
                    see.emplace_back(i);
                }
                dist[i] = iinf;
            }
        }
        while (!que.empty()){
            int v = que.front(); que.pop();
            for (int u : g[v]){
                if (chmin(dist[u],dist[v]+1)){
                    que.push(u);
                }
            }
        }
    };
    auto query = [&](int v){
        int ret = dist[v];
        for (int u : see){
            if (!on[u]) continue;
            chmin(ret,fl.dist(down[u],down[v]));
        }
        return ret;
    };
    int sq = 500;
    for (int l = 0; l < q; l += sq){
        int r = min(l+sq,q);
        rebuild(l,r);
        repp(i,l,r){
            int v = vs[i];
            if (ts[i] == 1){
                if (on[v]){
                    on[v] = false;
                }
                else {
                    on[v] = true;
                }
            }
            else {
                out(query(v));
            }
        }
    }
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
yukicoder

結果

ソースコード
