oj.uz

Submission #893781

# Submission time Handle Problem Language Result Execution time Memory
893781 2023-12-27T12:13:01 Z lolismek Tourism (JOI23_tourism) C++14
100 / 100
 1232 ms 25060 KB 
#include <algorithm>
#include <iostream>
#include <fstream>
#include <climits>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>

#include <random>
#include <chrono>

// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using ull = unsigned long long;
using ll = long long;

//#define int __int128
//#define int ll
#define pii pair <int, int>
#define all(a) (a).begin(), (a).end()
#define fr first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound

#define vt vector
#define FOR(a, b) for(int i = (a); ((a) <= (b) ? i <= (b) : i >= (b));((a) <= (b) ? i++ : i--))
#define sz(x) (int)(x).size() // ?

#define YES fout << "YES\n"
#define NO fout << "NO\n"

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int rangerng(int l, int r){
    return uniform_int_distribution<>(l, r)(rng);
}

////////////////////////////////////////////////////////////////////////////////////

// ifstream fin("input.in");
// ofstream fout("output.out");

#define fin cin
#define fout cout

const int NMAX = 1e5 + 5; // ?

vt <int> adj[NMAX + 1];
int c[NMAX + 1];
vt <pii> quer[NMAX + 1];

int Ans[NMAX + 1];

int sz[NMAX + 1];
int par[NMAX + 1];
int hvChild[NMAX + 1];

int lvl[NMAX + 1];

void expl(int node, int parent){
    par[node] = parent;
    sz[node] = 1;

    lvl[node] = lvl[parent] + 1;

    int maxi = 0;
    for(int child : adj[node]){
        if(child != parent){
            expl(child, node);
            sz[node] += sz[child];

            if(sz[child] > maxi){
                maxi = sz[child];
                hvChild[node] = child;
            }
        }
    }
}

int Id = 0;
int id[NMAX + 1];
int head[NMAX + 1];
int last[NMAX + 1];

int Time = 0;
int pos[NMAX + 1];

void hvFirst(int node, int parent){
    pos[node] = ++Time;
    
    if(hvChild[parent] != node){
        id[node] = ++Id;
        head[Id] = node;
    }else{
        id[node] = id[parent];
    }

    last[id[node]] = node;

    if(hvChild[node] != 0){
        hvFirst(hvChild[node], node);
    }

    for(int child : adj[node]){
        if(child != parent && child != hvChild[node]){
            hvFirst(child, node);
        }
    }
}

namespace AIB{
    int n;
    int aib[NMAX + 2];

    void init(int _n){
        n = _n + 1;
        FOR(1, n){
            aib[i] = 0;
        }
    }

    int lsb(int x){
        return x & -x;
    }

    void update(int pos, int val){
        pos++;
        for(int i = pos; i <= n; i += lsb(i)){
            aib[i] += val;
        }
    }

    int query(int pos){
        int ans = 0;
        pos++;
        for(int i = pos; i >= 1; i -= lsb(i)){
            ans += aib[i];
        }
        return ans;
    }
}

set <pair <pii, int>> S;

void setInterval(int l, int r, int x){
    //cout << 1 << endl;
    vt <pair <pii, int>> toErase;
    vt <pair <pii, int>> toInsert;
    toInsert.pb({{l, r}, x});

    for(auto it = S.lb({{l, 0}, 0}); it != S.end() && (*it).fr.fr <= r; it++){
        pair <pii, int> obj = (*it);
        toErase.pb(obj);
        if(obj.fr.sc > r){
            pair <pii, int> newObj = {{r + 1, obj.fr.sc}, obj.sc};
            toInsert.pb(newObj);
        }
    }

    auto it = S.lb({{l, 0}, 0});
    if(!S.empty() && it != S.begin()){
        it--;
        pair <pii, int> obj = (*it);
        if(obj.fr.fr < l && obj.fr.sc >= l){
            toErase.pb(obj);
            toInsert.pb({{obj.fr.fr, l - 1}, obj.sc});
            if(obj.fr.sc > r){
                toInsert.pb({{r + 1, obj.fr.sc}, obj.sc});
            }
        }
    }

    for(auto x : toErase){
        if(S.find(x) != S.end()){
            S.erase(x);
        }
        AIB::update(x.sc, -(x.fr.sc - x.fr.fr + 1));
    }

    for(auto x : toInsert){
        S.insert(x);
        AIB::update(x.sc, +(x.fr.sc - x.fr.fr + 1));
    }

    //cout << 2 << endl;
}

void update(int a, int b, int x){
    while(id[a] != id[b]){
        if(lvl[head[id[a]]] > lvl[head[id[b]]]){
            setInterval(pos[head[id[a]]], pos[a], x);
            a = par[head[id[a]]];
        }else{
            setInterval(pos[head[id[b]]], pos[b], x);
            b = par[head[id[b]]];
        }
    }
    setInterval(min(pos[a], pos[b]), max(pos[a], pos[b]), x);
}

void solve(){
    int n, m, q;
    fin >> n >> m >> q;

    for(int i = 1; i <= n - 1; i++){
        int a, b;
        fin >> a >> b;
        adj[a].pb(b);
        adj[b].pb(a);
    }

    FOR(1, m){
        fin >> c[i];
    }

    //cout << 3 << endl;

    FOR(1, q){
        int x, y;
        fin >> x >> y;
        quer[y].pb({x, i});
    }

    //cout << 3 << endl;
    expl(1, 0);
    //cout << 3 << endl;
    hvFirst(1, 0);

    //cout << 3 << endl;

    AIB::init(m);

    //cout << 3 << endl;

    FOR(1, Id){
        S.insert({{pos[head[i]], pos[last[i]]}, 0});
        AIB::update(0, pos[last[i]] - pos[head[i]] + 1);
    }

    FOR(1, m){
        if(i > 1){
            update(c[i - 1], c[i], i - 1);
        }
        update(c[i], c[i], i);

        for(pii x : quer[i]){
            Ans[x.sc] += AIB::query(m) - AIB::query(x.fr - 1);
        }
    }

    for(int i = 1; i <= q; i++){
        fout << Ans[i] << '\n';
    }
}       

signed main(){

    ios_base::sync_with_stdio(false);
    fin.tie(0);

    int T;
    //fin >> T;

    T = 1;

    while(T--){
        solve();
    }

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7260 KB Output is correct
2 Correct 1 ms 7260 KB Output is correct
3 Correct 1 ms 7256 KB Output is correct
4 Correct 2 ms 7260 KB Output is correct
5 Correct 2 ms 7260 KB Output is correct
6 Correct 2 ms 7260 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7260 KB Output is correct
9 Correct 2 ms 7260 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct
11 Correct 2 ms 7260 KB Output is correct
12 Correct 2 ms 7260 KB Output is correct
13 Correct 2 ms 7260 KB Output is correct
14 Correct 2 ms 7260 KB Output is correct
15 Correct 2 ms 7260 KB Output is correct
16 Correct 2 ms 7260 KB Output is correct
17 Correct 2 ms 7260 KB Output is correct
18 Correct 2 ms 7260 KB Output is correct
19 Correct 2 ms 7256 KB Output is correct
20 Correct 2 ms 7256 KB Output is correct
21 Correct 2 ms 7260 KB Output is correct
22 Correct 2 ms 7260 KB Output is correct
23 Correct 2 ms 7260 KB Output is correct
24 Correct 2 ms 7260 KB Output is correct
25 Correct 2 ms 7260 KB Output is correct
26 Correct 2 ms 7260 KB Output is correct
27 Correct 2 ms 7260 KB Output is correct
28 Correct 2 ms 7260 KB Output is correct
29 Correct 2 ms 7260 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7260 KB Output is correct
2 Correct 1 ms 7260 KB Output is correct
3 Correct 1 ms 7256 KB Output is correct
4 Correct 2 ms 7260 KB Output is correct
5 Correct 2 ms 7260 KB Output is correct
6 Correct 2 ms 7260 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7260 KB Output is correct
9 Correct 2 ms 7260 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct
11 Correct 2 ms 7260 KB Output is correct
12 Correct 2 ms 7260 KB Output is correct
13 Correct 2 ms 7260 KB Output is correct
14 Correct 2 ms 7260 KB Output is correct
15 Correct 2 ms 7260 KB Output is correct
16 Correct 2 ms 7260 KB Output is correct
17 Correct 2 ms 7260 KB Output is correct
18 Correct 2 ms 7260 KB Output is correct
19 Correct 2 ms 7256 KB Output is correct
20 Correct 2 ms 7256 KB Output is correct
21 Correct 2 ms 7260 KB Output is correct
22 Correct 2 ms 7260 KB Output is correct
23 Correct 2 ms 7260 KB Output is correct
24 Correct 2 ms 7260 KB Output is correct
25 Correct 2 ms 7260 KB Output is correct
26 Correct 2 ms 7260 KB Output is correct
27 Correct 2 ms 7260 KB Output is correct
28 Correct 2 ms 7260 KB Output is correct
29 Correct 2 ms 7260 KB Output is correct
30 Correct 7 ms 7260 KB Output is correct
31 Correct 8 ms 7256 KB Output is correct
32 Correct 10 ms 7260 KB Output is correct
33 Correct 12 ms 7496 KB Output is correct
34 Correct 11 ms 7260 KB Output is correct
35 Correct 11 ms 7260 KB Output is correct
36 Correct 10 ms 7516 KB Output is correct
37 Correct 10 ms 7256 KB Output is correct
38 Correct 4 ms 7260 KB Output is correct
39 Correct 4 ms 7516 KB Output is correct
40 Correct 4 ms 7516 KB Output is correct
41 Correct 4 ms 7516 KB Output is correct
42 Correct 4 ms 7516 KB Output is correct
43 Correct 4 ms 7508 KB Output is correct
44 Correct 6 ms 7260 KB Output is correct
45 Correct 6 ms 7260 KB Output is correct
46 Correct 6 ms 7260 KB Output is correct
47 Correct 8 ms 7260 KB Output is correct
48 Correct 6 ms 7260 KB Output is correct
49 Correct 6 ms 7260 KB Output is correct
50 Correct 6 ms 7516 KB Output is correct
51 Correct 6 ms 7512 KB Output is correct
52 Correct 5 ms 7516 KB Output is correct
53 Correct 7 ms 7512 KB Output is correct
54 Correct 5 ms 7512 KB Output is correct
55 Correct 5 ms 7548 KB Output is correct
56 Correct 2 ms 7260 KB Output is correct
57 Correct 3 ms 7260 KB Output is correct
58 Correct 9 ms 7260 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 7260 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7104 KB Output is correct
4 Correct 130 ms 18016 KB Output is correct
5 Correct 100 ms 20820 KB Output is correct
6 Correct 128 ms 22244 KB Output is correct
7 Correct 158 ms 25012 KB Output is correct
8 Correct 165 ms 25060 KB Output is correct
9 Correct 160 ms 24912 KB Output is correct
10 Correct 162 ms 24916 KB Output is correct
11 Correct 159 ms 25004 KB Output is correct
12 Correct 173 ms 24452 KB Output is correct
13 Correct 172 ms 24412 KB Output is correct
14 Correct 172 ms 24408 KB Output is correct
15 Correct 40 ms 21848 KB Output is correct
16 Correct 167 ms 24656 KB Output is correct
17 Correct 55 ms 10988 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7456 KB Output is correct
2 Correct 404 ms 12576 KB Output is correct
3 Correct 596 ms 13140 KB Output is correct
4 Correct 481 ms 13876 KB Output is correct
5 Correct 775 ms 16968 KB Output is correct
6 Correct 760 ms 16976 KB Output is correct
7 Correct 773 ms 16632 KB Output is correct
8 Correct 793 ms 16724 KB Output is correct
9 Correct 786 ms 16784 KB Output is correct
10 Correct 813 ms 16720 KB Output is correct
11 Correct 770 ms 16812 KB Output is correct
12 Correct 791 ms 16884 KB Output is correct
13 Correct 794 ms 17300 KB Output is correct
14 Correct 783 ms 17808 KB Output is correct
15 Correct 807 ms 19900 KB Output is correct
16 Correct 776 ms 17316 KB Output is correct
17 Correct 783 ms 17292 KB Output is correct
18 Correct 762 ms 17076 KB Output is correct
19 Correct 464 ms 12252 KB Output is correct
20 Correct 466 ms 12220 KB Output is correct
21 Correct 475 ms 12116 KB Output is correct
22 Correct 473 ms 12652 KB Output is correct
23 Correct 464 ms 12460 KB Output is correct
24 Correct 466 ms 12076 KB Output is correct
25 Correct 471 ms 12384 KB Output is correct
26 Correct 467 ms 12116 KB Output is correct
27 Correct 476 ms 12256 KB Output is correct
28 Correct 479 ms 12372 KB Output is correct
29 Correct 475 ms 12156 KB Output is correct
30 Correct 487 ms 12372 KB Output is correct
31 Correct 477 ms 12416 KB Output is correct
32 Correct 479 ms 12880 KB Output is correct
33 Correct 507 ms 13904 KB Output is correct
34 Correct 477 ms 15440 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7260 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 3 ms 7260 KB Output is correct
4 Correct 916 ms 17748 KB Output is correct
5 Correct 962 ms 18000 KB Output is correct
6 Correct 1114 ms 21116 KB Output is correct
7 Correct 1196 ms 22596 KB Output is correct
8 Correct 1232 ms 22668 KB Output is correct
9 Correct 1174 ms 22508 KB Output is correct
10 Correct 1181 ms 22760 KB Output is correct
11 Correct 1168 ms 22528 KB Output is correct
12 Correct 1204 ms 22392 KB Output is correct
13 Correct 1224 ms 22512 KB Output is correct
14 Correct 53 ms 11092 KB Output is correct

Subtask #6
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7260 KB Output is correct
2 Correct 1 ms 7260 KB Output is correct
3 Correct 1 ms 7256 KB Output is correct
4 Correct 2 ms 7260 KB Output is correct
5 Correct 2 ms 7260 KB Output is correct
6 Correct 2 ms 7260 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7260 KB Output is correct
9 Correct 2 ms 7260 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct
11 Correct 2 ms 7260 KB Output is correct
12 Correct 2 ms 7260 KB Output is correct
13 Correct 2 ms 7260 KB Output is correct
14 Correct 2 ms 7260 KB Output is correct
15 Correct 2 ms 7260 KB Output is correct
16 Correct 2 ms 7260 KB Output is correct
17 Correct 2 ms 7260 KB Output is correct
18 Correct 2 ms 7260 KB Output is correct
19 Correct 2 ms 7256 KB Output is correct
20 Correct 2 ms 7256 KB Output is correct
21 Correct 2 ms 7260 KB Output is correct
22 Correct 2 ms 7260 KB Output is correct
23 Correct 2 ms 7260 KB Output is correct
24 Correct 2 ms 7260 KB Output is correct
25 Correct 2 ms 7260 KB Output is correct
26 Correct 2 ms 7260 KB Output is correct
27 Correct 2 ms 7260 KB Output is correct
28 Correct 2 ms 7260 KB Output is correct
29 Correct 2 ms 7260 KB Output is correct
30 Correct 7 ms 7260 KB Output is correct
31 Correct 8 ms 7256 KB Output is correct
32 Correct 10 ms 7260 KB Output is correct
33 Correct 12 ms 7496 KB Output is correct
34 Correct 11 ms 7260 KB Output is correct
35 Correct 11 ms 7260 KB Output is correct
36 Correct 10 ms 7516 KB Output is correct
37 Correct 10 ms 7256 KB Output is correct
38 Correct 4 ms 7260 KB Output is correct
39 Correct 4 ms 7516 KB Output is correct
40 Correct 4 ms 7516 KB Output is correct
41 Correct 4 ms 7516 KB Output is correct
42 Correct 4 ms 7516 KB Output is correct
43 Correct 4 ms 7508 KB Output is correct
44 Correct 6 ms 7260 KB Output is correct
45 Correct 6 ms 7260 KB Output is correct
46 Correct 6 ms 7260 KB Output is correct
47 Correct 8 ms 7260 KB Output is correct
48 Correct 6 ms 7260 KB Output is correct
49 Correct 6 ms 7260 KB Output is correct
50 Correct 6 ms 7516 KB Output is correct
51 Correct 6 ms 7512 KB Output is correct
52 Correct 5 ms 7516 KB Output is correct
53 Correct 7 ms 7512 KB Output is correct
54 Correct 5 ms 7512 KB Output is correct
55 Correct 5 ms 7548 KB Output is correct
56 Correct 2 ms 7260 KB Output is correct
57 Correct 3 ms 7260 KB Output is correct
58 Correct 9 ms 7260 KB Output is correct
59 Correct 1 ms 7260 KB Output is correct
60 Correct 2 ms 7260 KB Output is correct
61 Correct 2 ms 7104 KB Output is correct
62 Correct 130 ms 18016 KB Output is correct
63 Correct 100 ms 20820 KB Output is correct
64 Correct 128 ms 22244 KB Output is correct
65 Correct 158 ms 25012 KB Output is correct
66 Correct 165 ms 25060 KB Output is correct
67 Correct 160 ms 24912 KB Output is correct
68 Correct 162 ms 24916 KB Output is correct
69 Correct 159 ms 25004 KB Output is correct
70 Correct 173 ms 24452 KB Output is correct
71 Correct 172 ms 24412 KB Output is correct
72 Correct 172 ms 24408 KB Output is correct
73 Correct 40 ms 21848 KB Output is correct
74 Correct 167 ms 24656 KB Output is correct
75 Correct 55 ms 10988 KB Output is correct
76 Correct 2 ms 7456 KB Output is correct
77 Correct 404 ms 12576 KB Output is correct
78 Correct 596 ms 13140 KB Output is correct
79 Correct 481 ms 13876 KB Output is correct
80 Correct 775 ms 16968 KB Output is correct
81 Correct 760 ms 16976 KB Output is correct
82 Correct 773 ms 16632 KB Output is correct
83 Correct 793 ms 16724 KB Output is correct
84 Correct 786 ms 16784 KB Output is correct
85 Correct 813 ms 16720 KB Output is correct
86 Correct 770 ms 16812 KB Output is correct
87 Correct 791 ms 16884 KB Output is correct
88 Correct 794 ms 17300 KB Output is correct
89 Correct 783 ms 17808 KB Output is correct
90 Correct 807 ms 19900 KB Output is correct
91 Correct 776 ms 17316 KB Output is correct
92 Correct 783 ms 17292 KB Output is correct
93 Correct 762 ms 17076 KB Output is correct
94 Correct 464 ms 12252 KB Output is correct
95 Correct 466 ms 12220 KB Output is correct
96 Correct 475 ms 12116 KB Output is correct
97 Correct 473 ms 12652 KB Output is correct
98 Correct 464 ms 12460 KB Output is correct
99 Correct 466 ms 12076 KB Output is correct
100 Correct 471 ms 12384 KB Output is correct
101 Correct 467 ms 12116 KB Output is correct
102 Correct 476 ms 12256 KB Output is correct
103 Correct 479 ms 12372 KB Output is correct
104 Correct 475 ms 12156 KB Output is correct
105 Correct 487 ms 12372 KB Output is correct
106 Correct 477 ms 12416 KB Output is correct
107 Correct 479 ms 12880 KB Output is correct
108 Correct 507 ms 13904 KB Output is correct
109 Correct 477 ms 15440 KB Output is correct
110 Correct 2 ms 7260 KB Output is correct
111 Correct 2 ms 7260 KB Output is correct
112 Correct 3 ms 7260 KB Output is correct
113 Correct 916 ms 17748 KB Output is correct
114 Correct 962 ms 18000 KB Output is correct
115 Correct 1114 ms 21116 KB Output is correct
116 Correct 1196 ms 22596 KB Output is correct
117 Correct 1232 ms 22668 KB Output is correct
118 Correct 1174 ms 22508 KB Output is correct
119 Correct 1181 ms 22760 KB Output is correct
120 Correct 1168 ms 22528 KB Output is correct
121 Correct 1204 ms 22392 KB Output is correct
122 Correct 1224 ms 22512 KB Output is correct
123 Correct 53 ms 11092 KB Output is correct
124 Correct 675 ms 21756 KB Output is correct
125 Correct 499 ms 19832 KB Output is correct
126 Correct 823 ms 22352 KB Output is correct
127 Correct 855 ms 22056 KB Output is correct
128 Correct 803 ms 22548 KB Output is correct
129 Correct 828 ms 22108 KB Output is correct
130 Correct 784 ms 22076 KB Output is correct
131 Correct 168 ms 23820 KB Output is correct
132 Correct 170 ms 24904 KB Output is correct
133 Correct 170 ms 21108 KB Output is correct
134 Correct 487 ms 17700 KB Output is correct
135 Correct 519 ms 17636 KB Output is correct
136 Correct 502 ms 17496 KB Output is correct
137 Correct 325 ms 24644 KB Output is correct
138 Correct 302 ms 24524 KB Output is correct
139 Correct 321 ms 24640 KB Output is correct
140 Correct 308 ms 24516 KB Output is correct
141 Correct 324 ms 24444 KB Output is correct
142 Correct 317 ms 24524 KB Output is correct
143 Correct 51 ms 17356 KB Output is correct
144 Correct 800 ms 21772 KB Output is correct