oj.uz

Submission #793705

# Submission time Handle Problem Language Result Execution time Memory
793705 2023-07-26T05:42:29 Z vjudge1 Tourism (JOI23_tourism) C++17
17 / 100
 125 ms 34332 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 1e5 + 10;
const int M = (1 << 17);
// segment Sum + update in pos
int segSum[2 * M];
void update(int pos, int val) {
    for(segSum[pos += M] += val; pos > 1; pos >>= 1) {
        segSum[pos >> 1] = segSum[pos] + segSum[pos ^ 1];
    }
}
int get(int ql, int qr) {
    int res = 0;
    for(ql += M, qr += M + 1; ql < qr; ql >>= 1, qr >>= 1) {
        if(ql & 1) res += segSum[ql++];
        if(qr & 1) res += segSum[--qr];
    }
    return res;
}

template<typename T> 
struct SprarseTable {
    int len;
    vector<vector<T>> st;
    T (*F) (T, T);
    void init(vector<T> &a, T (*f)(T, T)) {
        F = f;
        len = (int)a.size();
        int mxpw = 32 - __builtin_clz(len);
        st.resize(mxpw);
        st[0] = a;
        for(int k = 1; k < mxpw; k++) {
            st[k].resize(len - (1 << k) + 1);
            for(int i = 0; i < (int)st[k].size(); i++) {
                st[k][i] = F(st[k - 1][i], st[k - 1][i + (1 << (k - 1))]);
            }
        }
    }
    T get(int l, int r) {
        int mxpw = 31 - __builtin_clz(r - l + 1);
        return F(st[mxpw][l], st[mxpw][r - (1 << mxpw) + 1]);
    }
};


int n, m, q;

vector<int> g[N];
vector<pair<int, int>> e;
int sm[N];
int tin[N], tout[N], anc[N][17], depth[N], T;
void calc(int s, int p) {
    for(int to : g[s]) {
        if(to == p) continue;
        calc(to, s);
        sm[s] += sm[to];
    }
}

void precalc(int s, int p) {
    if(s == 1) T = 0;
    tin[s] = T++;
    anc[s][0] = p;
    for(int i = 1; i < 17; i++)
        anc[s][i] = anc[anc[s][i - 1]][i - 1];
    for(int to : g[s]) {
        if(to == p) continue;
        depth[to] = depth[s] + 1;
        precalc(to, s);
    }
    tout[s] = T++;
}

struct query {
    int l, r, i;
};

int curAns;
void add(int ver) {
    int u = ver;
    for(int i = 16; i >= 0; i--) {
        if(!get(tin[ anc[u][i] ], tout[ anc[u][i] ])) 
            u = anc[u][i];
    }
    curAns += depth[ver] - depth[u] + 1;
    update(tin[ver], +1);
}
void del(int ver) {
    update(tin[ver], -1);
    int u = ver;
    for(int i = 16; i >= 0; i--) {
        if(!get(tin[ anc[u][i] ], tout[ anc[u][i] ])) 
            u = anc[u][i];
    }
    curAns -= depth[ver] - depth[u] + 1;
}

vector<query> qr;
int ans[N];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin >> n >> m >> q;
    for(int i = 0; i < n - 1; i++) {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
        e.push_back({u, v});
    }
    vector<int> ver(m + 1);
    for(int i = 1; i <= m; i++) 
        cin >> ver[i];
    
    if(n <= 2000 && q <= 2000 && m <= 2000) {
        while(q --> 0) {
            int l, r;
            cin >> l >> r;
            for(int i = l; i <= r; i++) 
                sm[ver[i]]++;
            calc(1, 1);
            int res = 1;
            for(int i = 1; i <= n; i++) {
                res += (sm[i] && sm[i] < r - l + 1);
                sm[i] = 0;
            }
            cout << res << '\n';
        }
        return 0;
    }
    precalc(1, 1);
    bool subtask = 1;
    for(int i = 0; i < n - 1; i++) {
        if(e[i].first != i + 1 || e[i].second != i + 2)
            subtask = 0;
    } 
    if(subtask) {
        vector<int> ti(m + 1);
        for(int i = 1; i <= m; i++) 
            ti[i] = depth[ver[i]];
        SprarseTable<int> mn, mx;
        mn.init(ti, [](int a, int b) {return (a < b ? a : b);});
        mx.init(ti, [](int a, int b) {return (a > b ? a : b);});
        while(q --> 0) {
            int l, r;
            cin >> l >> r;
            cout << mx.get(l, r) - mn.get(l, r) + 1 << '\n';
        }
        return 0;
    }
    for(int i = 0; i < q; i++) {
        query c;
        cin >> c.l >> c.r; c.i = i;
        qr.push_back(c);
    }
    // sort(qr.begin(), qr.end(), [](query a, query b) {return (a.l < b.l);});
    int curL = 1, curR = 0;
    for(query c : qr) {
        while(curR < c.r) {
            add(ver[++curR]);
        }
        while(curL < c.l) {
            del(ver[curL++]);
        }
        ans[c.i] = curAns;
    }
    for(int i = 0; i < q; i++) 
        cout << ans[i] << '\n';
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 3 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2708 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 3 ms 2644 KB Output is correct
23 Correct 3 ms 2644 KB Output is correct
24 Correct 3 ms 2644 KB Output is correct
25 Correct 2 ms 2692 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 20 ms 2772 KB Output is correct
31 Correct 26 ms 2772 KB Output is correct
32 Correct 41 ms 2776 KB Output is correct
33 Correct 43 ms 2796 KB Output is correct
34 Correct 41 ms 2796 KB Output is correct
35 Correct 31 ms 2792 KB Output is correct
36 Correct 32 ms 2772 KB Output is correct
37 Correct 32 ms 2792 KB Output is correct
38 Correct 46 ms 2892 KB Output is correct
39 Correct 43 ms 2900 KB Output is correct
40 Correct 44 ms 2916 KB Output is correct
41 Correct 45 ms 2924 KB Output is correct
42 Correct 44 ms 2900 KB Output is correct
43 Correct 44 ms 2772 KB Output is correct
44 Correct 44 ms 2828 KB Output is correct
45 Correct 44 ms 2772 KB Output is correct
46 Correct 46 ms 2852 KB Output is correct
47 Correct 45 ms 2832 KB Output is correct
48 Correct 49 ms 2820 KB Output is correct
49 Correct 48 ms 2772 KB Output is correct
50 Correct 30 ms 2800 KB Output is correct
51 Correct 30 ms 2772 KB Output is correct
52 Correct 30 ms 2772 KB Output is correct
53 Correct 30 ms 2808 KB Output is correct
54 Correct 31 ms 2804 KB Output is correct
55 Correct 31 ms 2804 KB Output is correct
56 Correct 5 ms 2712 KB Output is correct
57 Correct 29 ms 2772 KB Output is correct
58 Correct 29 ms 2772 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 5 ms 2644 KB Output is correct
4 Correct 46 ms 24600 KB Output is correct
5 Correct 46 ms 24604 KB Output is correct
6 Correct 60 ms 30028 KB Output is correct
7 Correct 74 ms 34280 KB Output is correct
8 Correct 70 ms 34332 KB Output is correct
9 Correct 68 ms 34272 KB Output is correct
10 Correct 70 ms 34316 KB Output is correct
11 Correct 78 ms 34256 KB Output is correct
12 Correct 76 ms 34248 KB Output is correct
13 Correct 65 ms 34292 KB Output is correct
14 Correct 64 ms 34316 KB Output is correct
15 Correct 44 ms 20836 KB Output is correct
16 Correct 65 ms 33888 KB Output is correct
17 Correct 34 ms 15948 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Incorrect 102 ms 10288 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2580 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 5 ms 2644 KB Output is correct
4 Incorrect 125 ms 12792 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 3 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2708 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 3 ms 2644 KB Output is correct
23 Correct 3 ms 2644 KB Output is correct
24 Correct 3 ms 2644 KB Output is correct
25 Correct 2 ms 2692 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 20 ms 2772 KB Output is correct
31 Correct 26 ms 2772 KB Output is correct
32 Correct 41 ms 2776 KB Output is correct
33 Correct 43 ms 2796 KB Output is correct
34 Correct 41 ms 2796 KB Output is correct
35 Correct 31 ms 2792 KB Output is correct
36 Correct 32 ms 2772 KB Output is correct
37 Correct 32 ms 2792 KB Output is correct
38 Correct 46 ms 2892 KB Output is correct
39 Correct 43 ms 2900 KB Output is correct
40 Correct 44 ms 2916 KB Output is correct
41 Correct 45 ms 2924 KB Output is correct
42 Correct 44 ms 2900 KB Output is correct
43 Correct 44 ms 2772 KB Output is correct
44 Correct 44 ms 2828 KB Output is correct
45 Correct 44 ms 2772 KB Output is correct
46 Correct 46 ms 2852 KB Output is correct
47 Correct 45 ms 2832 KB Output is correct
48 Correct 49 ms 2820 KB Output is correct
49 Correct 48 ms 2772 KB Output is correct
50 Correct 30 ms 2800 KB Output is correct
51 Correct 30 ms 2772 KB Output is correct
52 Correct 30 ms 2772 KB Output is correct
53 Correct 30 ms 2808 KB Output is correct
54 Correct 31 ms 2804 KB Output is correct
55 Correct 31 ms 2804 KB Output is correct
56 Correct 5 ms 2712 KB Output is correct
57 Correct 29 ms 2772 KB Output is correct
58 Correct 29 ms 2772 KB Output is correct
59 Correct 1 ms 2644 KB Output is correct
60 Correct 1 ms 2652 KB Output is correct
61 Correct 5 ms 2644 KB Output is correct
62 Correct 46 ms 24600 KB Output is correct
63 Correct 46 ms 24604 KB Output is correct
64 Correct 60 ms 30028 KB Output is correct
65 Correct 74 ms 34280 KB Output is correct
66 Correct 70 ms 34332 KB Output is correct
67 Correct 68 ms 34272 KB Output is correct
68 Correct 70 ms 34316 KB Output is correct
69 Correct 78 ms 34256 KB Output is correct
70 Correct 76 ms 34248 KB Output is correct
71 Correct 65 ms 34292 KB Output is correct
72 Correct 64 ms 34316 KB Output is correct
73 Correct 44 ms 20836 KB Output is correct
74 Correct 65 ms 33888 KB Output is correct
75 Correct 34 ms 15948 KB Output is correct
76 Correct 1 ms 2644 KB Output is correct
77 Incorrect 102 ms 10288 KB Output isn't correct
78 Halted 0 ms 0 KB -