Submission #1091055

#	Time	Username	Problem	Language	Result	Execution time	Memory
1091055		underwaterkillerwhale	Tourism (JOI23_tourism)	C++17	100 / 100	3670 ms	69628 KiB

tourism

#include <bits/stdc++.h>
#define ll              long long
#define pii             pair<int,int>
#define pll             pair<ll,ll>
#define rep(i,m,n)      for(int i=(m); i<=(n); i++)
#define reb(i,m,n)      for(int i=(m); i>=(n); i--)
#define iter(id, v)     for(auto id : v)
#define fs              first
#define se              second
#define MP              make_pair
#define pb              push_back
#define bit(msk, i)     ((msk >> i) & 1)
#define SZ(v)           (ll)v.size()
#define ALL(v)          v.begin(),v.end()

using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now ().time_since_epoch().count());
ll Rand (ll l, ll r) { return uniform_int_distribution<ll> (l, r) (rd); }

const int N = 1e5 + 7;
const int Mod = 1e9 + 2022; ///loonf mod sai
const int INF = 1e9;
const ll BASE = 137;
const int szBL = 320;

struct FastSet {
    using uint = unsigned int ; using ull = unsigned long long ; template < class T > using V = vector <T>; template < class T > using VV = V <V<T>>;

    int popcnt ( uint x ) { return __builtin_popcount(x); } int popcnt ( ull x ) { return __builtin_popcountll(x); } int bsr ( uint x ) { return 31 - __builtin_clz(x); } int bsr ( ull x ) { return 63 - __builtin_clzll(x); } int bsf ( uint x ) { return __builtin_ctz(x); } int bsf ( ull x ) { return __builtin_ctzll(x); }
    static constexpr uint B = 64 ;

    int n, lg;
    int idx[(int)1e5 + 7]; ///size
    VV<ull> seg;
    FastSet( int _n) : n(_n) {
        do {
            seg.push_back(V<ull>((_n + B - 1 ) / B));
            _n = (_n + B - 1 ) / B;
        }while (_n > 1 );
        lg = seg.size();

    }
    bool operator []( int i) const {
        return (seg[ 0 ][i / B] >> (i % B) & 1 ) != 0 ;
    }
    void set ( int i) {
        for ( int h = 0 ; h < lg; h++) {
            seg[h][i / B] |= 1ULL << (i % B); i /= B;
        }
    }
    void reset ( int i) {
        for ( int h = 0 ; h < lg; h++) {
            seg[h][i / B] &= ~( 1ULL << (i % B));
            if (seg[h][i / B]) break ;
            i /= B;
        }
    }
    int next ( int i) {
        if (i < 0) i = 0;
        if (i > n) i = n;
        for ( int h = 0 ; h < lg; h++) {
            if (i / B == seg[h].size()) break ;
            ull d = seg[h][i / B] >> (i % B);
            if (!d) {
                i = i / B + 1 ;
                continue ;
            }
            i += bsf(d);
            for ( int g = h - 1 ; g >= 0 ; g--) {
                i *= B; i += bsf(seg[g][i / B]);
            }
            return i;
        }
        return n;
    }
    int prev ( int i) {
        if (i < 0) i = 0;
        if (i > n) i = n;
        i--;
        for ( int h = 0 ; h < lg; h++) {
            if (i == -1 ) break ;
            ull d = seg[h][i / B] << ( 63 - i % 64 );
            if (!d) {
                i = i / B - 1 ;
                continue ;
            }
            i += bsr(d) - (B - 1 );
            for ( int g = h - 1 ; g >= 0 ; g--) {
                i *= B;
                i += bsr(seg[g][i / B]);
            }
            return i;
        }
        return -1 ;
    }
};



struct Query {
    int fs, se, id;
};

int n, m, Q;
vector<int> ke[N];
Query qr[N];
int C[N];

int high[N], szC[N], euler[2 * N], posin[N], pa[N], ein[N], eout[N], Ver[N];
pii flca[2 * N][25];

void pdfs (int u, int p) {
    static int sz = 0, time_dfs = 0;
    high[u] = high[p] + 1;
    pa[u] = p;
    szC[u] = 1;

    flca[++sz][0] = MP(high[u], u);
    posin[u] = sz;
    ein[u] = ++time_dfs;
    Ver[time_dfs] = u;
    iter (&v, ke[u]) {
        if (v != p) {
            pdfs(v, u);
            szC[u] += szC[v];
            flca[++sz][0] = MP(high[u], u);
        }
    }
    eout[u] = time_dfs;
}

void init_LCA () {
    for (int j = 1; (1 << j) <= 2 * n; ++j)
        for (int i = 1; i + (1 << j) - 1 <= 2 * n; ++i)
            flca[i][j] = min(flca[i][j - 1], flca[i + (1 << j - 1)][j - 1]);
}

int LCA (int u, int v) {
    u = posin[u];
    v = posin[v];
    if (u > v) swap(u, v);
    int K = 31 - __builtin_clz(v - u + 1);
    return min(flca[u][K], flca[v - (1 << K) + 1][K]).se;
}

namespace sub2 {

    int pre[N];

    void dfs (int u, int p, int &res) {
        iter (&v, ke[u]) {
            if (v != p) {
                dfs(v, u, res);
                pre[u] += pre[v];
            }
        }
        if (pre[u] > 0) ++res;
    }

    void solution () {
        rep (q, 1, Q) {
            rep (i, 1, n) pre[i] = 0;
            int L = qr[q].fs, R = qr[q].se;
            int Lca = C[L];
            rep (i, L, R) {
                Lca = LCA(Lca, C[i]);
            }
            rep (i, L, R) {
                pre[C[i]]++;
                pre[pa[Lca]]--;
            }
            int res = 0;
            dfs(1, 0, res);
            cout << res <<"\n";
        }

    }

}

namespace sub6 {

    int sptLCA[N][25];
    int res = 0;
    int ptrL = 1, ptrR = 0;
    int cnt[N];

    FastSet S(1e5 + 1);

    void update (int u, int val) {
        cnt[ein[u]] += val;
        if (val == -1) {
            if (cnt[ein[u]] == 0) S.reset(ein[u]);
        }
        int lc = -1, rc = -1;
        int nxt = S.next(ein[u]), prv = S.prev(ein[u]);
//        cout << u <<" "<<ein[u]<<" "<<nxt <<" "<<prv<<"\n";
        if (nxt != 1e5 + 1) rc = Ver[nxt];
        if (prv != -1) lc = Ver[prv];
        if (rc == -1 && lc == -1) res += val * high[u];
        else {
            int nearest = 1;
            if (rc != -1) {
                nearest = LCA(u, rc);
            }
            if (lc != -1) {
                int v = LCA(u, lc);
                if (high[nearest] < high[v]) nearest = v;
            }
            res += val * (high[u] - high[nearest]);
        }

        if (val == 1) S.set(ein[u]);
    }

    void shifting (int L, int R) {
        while (ptrL > L) {
            --ptrL;
            update(C[ptrL], 1);
        }
        while (ptrR < R) {
            ++ptrR;
            update (C[ptrR], 1);
        }
        while (ptrL < L) {
            update(C[ptrL], -1);
            ++ptrL;
        }
        while (ptrR > R) {
           update (C[ptrR], -1);
           --ptrR;
        }
    }

    void solution () {
        sort (qr + 1, qr + 1 + Q, [] (Query A, Query B) {
            if (A.fs / szBL != B.fs / szBL) return A.fs < B.fs;
            else return A.se < B.se;
        });
        rep (i, 1, m) sptLCA[i][0] = C[i];

        for (int j = 1; (1 << j) <= m; ++j)
        for (int i = 1; i + (1 << j) - 1 <= m; ++i)
            sptLCA[i][j] = LCA(sptLCA[i][j - 1], sptLCA[i + (1 << j - 1)][j - 1]);

        auto get_LCA = [] (int L, int R) {
            int K = 31 - __builtin_clz(R - L + 1);
            return LCA(sptLCA[L][K], sptLCA[R - (1 << K) + 1][K]);
        };

        vector<int> Ans(Q + 1);
        rep (q, 1, Q) {
            int L = qr[q].fs, R = qr[q].se, id = qr[q].id;
            shifting(L, R);
            Ans[id] = res - high[get_LCA(L, R)] + 1;
        }
        rep (i, 1, Q) cout << Ans[i] <<"\n";
    }
}


void solution() {
    cin >> n >> m >> Q;
    rep (i, 1, n - 1) {
        int u, v;
        cin >> u >> v;
        ke[u].pb(v);
        ke[v].pb(u);
    }
    rep (i, 1, m) cin >> C[i];
    rep (i, 1, Q) cin >> qr[i].fs >> qr[i].se, qr[i].id = i;
    pdfs(1, 0);
    init_LCA();
//    if (n <= 2000 && m <= 2000 && Q <= 2000) sub2 :: solution();
//    else
        sub6 :: solution();

}

#define file(name) freopen(name".inp","r",stdin); \
freopen(name".out","w",stdout);
int main () {
//    file("c");
    ios_base :: sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int num_Test = 1;
//    cin >> num_Test;
    while (num_Test--)
        solution();
}
/*
no bug +8
chu y break hay return se lam hong logic
xet transition cua i va i + 1
construct ket qua
chu y truong hop : KHONG CO GI

ko làm được

hướng 1: đổi hướng làm
hướng 2: đưa ra nhận xét

tim mo hinh bai toan sau khi doc de

trung ten bien trong ham gan nhat co the dan den sai

10 7 3
6 5
3 6
9 3
8 3
7 8
7 1
2 5
7 10
8 4
9 4 10 1 10 7 6
4 4
1 3
6 7



*/

Compilation message (stderr)

tourism.cpp: In function 'void init_LCA()':
tourism.cpp:136:63: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  136 |             flca[i][j] = min(flca[i][j - 1], flca[i + (1 << j - 1)][j - 1]);
      |                                                             ~~^~~
tourism.cpp: In function 'void sub6::solution()':
tourism.cpp:245:69: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  245 |             sptLCA[i][j] = LCA(sptLCA[i][j - 1], sptLCA[i + (1 << j - 1)][j - 1]);
      |                                                                   ~~^~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 7 / 7
• Subtask 4: 18 / 18
• Subtask 5: 24 / 24
• Subtask 6: 41 / 41