oj.uz

Submission #1091042

# Submission time Handle Problem Language Result Execution time Memory
1091042 2024-09-19T15:16:14 Z underwaterkillerwhale Tourism (JOI23_tourism) C++17
28 / 100
 5000 ms 64084 KB 
#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 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];
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;
    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;

    multiset<pii> S;

    void update (int u, int val) {
        pii cur = MP(ein[u], u);
        if (val == -1) {
//            assert(S.find(cur) != S.end());
            S.erase(S.find(cur));
        }
        int lc = -1, rc = -1;
        auto it = S.lower_bound(cur);
        if (it != S.end()) rc = it->se;
        if (it != S.begin()) lc = prev(it)->se;
        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]);
//            cout << u <<" "<<lc <<","<<rc<<" "<<res<<","<<val<<"\n";
        }

        if (val == 1) S.insert(cur);
//        cout << ptrL <<" "<<ptrR<<" "<<val<<":\n";
//        iter (&id, S) cout << id.se<<" ";
//        cout<<"\n";
    }

    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 if (!((A.fs / szBL) &1)) return A.se < B.se;
            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;
//            cout << id<<":"<<Ans[id] <<","<<get_LCA(L, R)<<"\n";
        }
        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

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2808 KB Output is correct
4 Correct 4 ms 2908 KB Output is correct
5 Correct 3 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 3 ms 2904 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 4 ms 2908 KB Output is correct
10 Correct 4 ms 3032 KB Output is correct
11 Correct 4 ms 2908 KB Output is correct
12 Correct 2 ms 2904 KB Output is correct
13 Correct 2 ms 2904 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 4 ms 3036 KB Output is correct
16 Correct 5 ms 3052 KB Output is correct
17 Correct 4 ms 2908 KB Output is correct
18 Correct 4 ms 3044 KB Output is correct
19 Correct 5 ms 2904 KB Output is correct
20 Correct 6 ms 2908 KB Output is correct
21 Correct 4 ms 3036 KB Output is correct
22 Correct 4 ms 2908 KB Output is correct
23 Correct 4 ms 2908 KB Output is correct
24 Correct 4 ms 3032 KB Output is correct
25 Correct 5 ms 2904 KB Output is correct
26 Correct 4 ms 2908 KB Output is correct
27 Correct 2 ms 2648 KB Output is correct
28 Correct 1 ms 2908 KB Output is correct
29 Correct 1 ms 2908 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2808 KB Output is correct
4 Correct 4 ms 2908 KB Output is correct
5 Correct 3 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 3 ms 2904 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 4 ms 2908 KB Output is correct
10 Correct 4 ms 3032 KB Output is correct
11 Correct 4 ms 2908 KB Output is correct
12 Correct 2 ms 2904 KB Output is correct
13 Correct 2 ms 2904 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 4 ms 3036 KB Output is correct
16 Correct 5 ms 3052 KB Output is correct
17 Correct 4 ms 2908 KB Output is correct
18 Correct 4 ms 3044 KB Output is correct
19 Correct 5 ms 2904 KB Output is correct
20 Correct 6 ms 2908 KB Output is correct
21 Correct 4 ms 3036 KB Output is correct
22 Correct 4 ms 2908 KB Output is correct
23 Correct 4 ms 2908 KB Output is correct
24 Correct 4 ms 3032 KB Output is correct
25 Correct 5 ms 2904 KB Output is correct
26 Correct 4 ms 2908 KB Output is correct
27 Correct 2 ms 2648 KB Output is correct
28 Correct 1 ms 2908 KB Output is correct
29 Correct 1 ms 2908 KB Output is correct
30 Correct 19 ms 3780 KB Output is correct
31 Correct 24 ms 3676 KB Output is correct
32 Correct 29 ms 4088 KB Output is correct
33 Correct 30 ms 3932 KB Output is correct
34 Correct 31 ms 4080 KB Output is correct
35 Correct 6 ms 4072 KB Output is correct
36 Correct 9 ms 3932 KB Output is correct
37 Correct 6 ms 3932 KB Output is correct
38 Correct 32 ms 4192 KB Output is correct
39 Correct 29 ms 4184 KB Output is correct
40 Correct 29 ms 4184 KB Output is correct
41 Correct 6 ms 4184 KB Output is correct
42 Correct 5 ms 4192 KB Output is correct
43 Correct 6 ms 4188 KB Output is correct
44 Correct 30 ms 4116 KB Output is correct
45 Correct 29 ms 3932 KB Output is correct
46 Correct 29 ms 3928 KB Output is correct
47 Correct 6 ms 3912 KB Output is correct
48 Correct 6 ms 4152 KB Output is correct
49 Correct 6 ms 3932 KB Output is correct
50 Correct 28 ms 3932 KB Output is correct
51 Correct 27 ms 3932 KB Output is correct
52 Correct 27 ms 3928 KB Output is correct
53 Correct 27 ms 3928 KB Output is correct
54 Correct 29 ms 4120 KB Output is correct
55 Correct 28 ms 3928 KB Output is correct
56 Correct 13 ms 3164 KB Output is correct
57 Correct 3 ms 3676 KB Output is correct
58 Correct 5 ms 4012 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 3 ms 2884 KB Output is correct
3 Correct 13 ms 3176 KB Output is correct
4 Execution timed out 5045 ms 45136 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 96 ms 32852 KB Output is correct
3 Correct 141 ms 39476 KB Output is correct
4 Correct 127 ms 40932 KB Output is correct
5 Correct 166 ms 64068 KB Output is correct
6 Correct 191 ms 62544 KB Output is correct
7 Correct 192 ms 60244 KB Output is correct
8 Correct 181 ms 59608 KB Output is correct
9 Correct 201 ms 59416 KB Output is correct
10 Correct 170 ms 59572 KB Output is correct
11 Correct 214 ms 59424 KB Output is correct
12 Correct 180 ms 59476 KB Output is correct
13 Correct 176 ms 59728 KB Output is correct
14 Correct 184 ms 60100 KB Output is correct
15 Correct 202 ms 62288 KB Output is correct
16 Correct 192 ms 61660 KB Output is correct
17 Correct 190 ms 61612 KB Output is correct
18 Correct 189 ms 61712 KB Output is correct
19 Correct 172 ms 64080 KB Output is correct
20 Correct 177 ms 64084 KB Output is correct
21 Correct 181 ms 61268 KB Output is correct
22 Correct 181 ms 60500 KB Output is correct
23 Correct 183 ms 59764 KB Output is correct
24 Correct 165 ms 59476 KB Output is correct
25 Correct 201 ms 59476 KB Output is correct
26 Correct 163 ms 59412 KB Output is correct
27 Correct 178 ms 59472 KB Output is correct
28 Correct 186 ms 59220 KB Output is correct
29 Correct 193 ms 59476 KB Output is correct
30 Correct 207 ms 59432 KB Output is correct
31 Correct 193 ms 59732 KB Output is correct
32 Correct 191 ms 60000 KB Output is correct
33 Correct 197 ms 60752 KB Output is correct
34 Correct 207 ms 62260 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 13 ms 3164 KB Output is correct
4 Execution timed out 5091 ms 42388 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2808 KB Output is correct
4 Correct 4 ms 2908 KB Output is correct
5 Correct 3 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 3 ms 2904 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 4 ms 2908 KB Output is correct
10 Correct 4 ms 3032 KB Output is correct
11 Correct 4 ms 2908 KB Output is correct
12 Correct 2 ms 2904 KB Output is correct
13 Correct 2 ms 2904 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 4 ms 3036 KB Output is correct
16 Correct 5 ms 3052 KB Output is correct
17 Correct 4 ms 2908 KB Output is correct
18 Correct 4 ms 3044 KB Output is correct
19 Correct 5 ms 2904 KB Output is correct
20 Correct 6 ms 2908 KB Output is correct
21 Correct 4 ms 3036 KB Output is correct
22 Correct 4 ms 2908 KB Output is correct
23 Correct 4 ms 2908 KB Output is correct
24 Correct 4 ms 3032 KB Output is correct
25 Correct 5 ms 2904 KB Output is correct
26 Correct 4 ms 2908 KB Output is correct
27 Correct 2 ms 2648 KB Output is correct
28 Correct 1 ms 2908 KB Output is correct
29 Correct 1 ms 2908 KB Output is correct
30 Correct 19 ms 3780 KB Output is correct
31 Correct 24 ms 3676 KB Output is correct
32 Correct 29 ms 4088 KB Output is correct
33 Correct 30 ms 3932 KB Output is correct
34 Correct 31 ms 4080 KB Output is correct
35 Correct 6 ms 4072 KB Output is correct
36 Correct 9 ms 3932 KB Output is correct
37 Correct 6 ms 3932 KB Output is correct
38 Correct 32 ms 4192 KB Output is correct
39 Correct 29 ms 4184 KB Output is correct
40 Correct 29 ms 4184 KB Output is correct
41 Correct 6 ms 4184 KB Output is correct
42 Correct 5 ms 4192 KB Output is correct
43 Correct 6 ms 4188 KB Output is correct
44 Correct 30 ms 4116 KB Output is correct
45 Correct 29 ms 3932 KB Output is correct
46 Correct 29 ms 3928 KB Output is correct
47 Correct 6 ms 3912 KB Output is correct
48 Correct 6 ms 4152 KB Output is correct
49 Correct 6 ms 3932 KB Output is correct
50 Correct 28 ms 3932 KB Output is correct
51 Correct 27 ms 3932 KB Output is correct
52 Correct 27 ms 3928 KB Output is correct
53 Correct 27 ms 3928 KB Output is correct
54 Correct 29 ms 4120 KB Output is correct
55 Correct 28 ms 3928 KB Output is correct
56 Correct 13 ms 3164 KB Output is correct
57 Correct 3 ms 3676 KB Output is correct
58 Correct 5 ms 4012 KB Output is correct
59 Correct 1 ms 2648 KB Output is correct
60 Correct 3 ms 2884 KB Output is correct
61 Correct 13 ms 3176 KB Output is correct
62 Execution timed out 5045 ms 45136 KB Time limit exceeded
63 Halted 0 ms 0 KB -