oj.uz

Submission #944917

# Submission time Handle Problem Language Result Execution time Memory
944917 2024-03-13T08:02:48 Z phoenix0423 Tourism (JOI23_tourism) C++17
10 / 100
 4027 ms 80904 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0);
#pragma GCC optimize("Ofast","unroll-loops")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define int long long
#define lowbit(x) x&-x
const int maxn = 4e5 + 5;
const int INF = 1e9 + 7;
int n, m, q;
vector<int> adj[maxn];
int dep[maxn], in[maxn], dfn = 0;
int arr[maxn][18];
int id[maxn];

void dfs(int pos, int prev){
    in[pos] = ++dfn;
    id[dfn] = pos;
    arr[dfn][0] = dep[pos];
    for(auto x : adj[pos]){
        if(x == prev) continue;
        dep[x] = dep[pos] + 1;
        dfs(x, pos);
        arr[++dfn][0] = dep[pos];
    }
    arr[++dfn][0] = dep[pos];
}

int lca(int a, int b){
    if(a > b) swap(a, b);
    int len = __lg(b - a + 1);
    return min(arr[a][len], arr[b - (1 << len) + 1][len]);
}

struct info{
    int l, r, id;
    info(){}
    info(int _l, int _r, int _id) : l(_l), r(_r), id(_id){}
    bool operator < (const info& other) const{
        return r < other.r;
    };
};
vector<info> b[500];
const int block = 320;
int ans[maxn];
int c[maxn], loc[maxn];
int cur = 0;
int path(int a, int b){
    return dep[a] + dep[b] - 2 * lca(in[a], in[b]);
}
struct node{
    int l, r, val;
} st[maxn];

struct rollback{
    int l, r, m;
};
stack<rollback> stk;
void roll_back(){
    auto [l, r, m] = stk.top(); stk.pop();
    cur -= path(st[l].val, st[r].val);
    cur += path(st[l].val, st[m].val) + path(st[m].val, st[r].val);
    st[l].r = m, st[r].l = m;
}
void del(int x){
    x = loc[x];
    int prv = st[x].l, nxt = st[x].r;
    stk.push({prv, nxt, x});
    cur -= path(st[prv].val, st[x].val) + path(st[x].val, st[nxt].val);
    cur += path(st[prv].val, st[nxt].val);
    st[prv].r = nxt, st[nxt].l = prv;
}

signed main(void){
    fastio;
    cin>>n>>m>>q;
    for(int i = 0; i < n - 1; i++){
        int a, b;
        cin>>a>>b;
        a--, b--;
        adj[a].pb(b);
        adj[b].pb(a);
    }
    dfs(0, 0);
    for(int i = 1; (1 << i) <= dfn; i++){
        for(int j = 0; j + (1 << i) - 1 <= dfn; j++){
            arr[j][i] = min(arr[j][i - 1], arr[j + (1 << (i - 1))][i - 1]);
        }
    }
    for(int i = 0; i < m; i++) cin>>c[i], c[i] --;
    for(int i = 0; i < q; i++){
        int l, r;
        cin>>l>>r;
        l--, r--;
        b[l / block].pb(info(l, r, i));
    }
    for(int i = 0; i <= m / block; i++){
        sort(b[i].begin(), b[i].end());
    }
    vector<pll> cpy;
    for(int i = 0; i < m; i++) cpy.eb(c[i], i);
    sort(cpy.begin(), cpy.end(), [&](pll a, pll b){ return in[a.f] < in[b.f];});
    for(int i = 0; i < m; i++){
        auto [val, id] = cpy[i];
        loc[id] = i;
        st[i].val = val;
        if(!i) st[i].l = m - 1;
        else st[i].l = i - 1;
        if(i == m - 1) st[i].r = 0;
        else st[i].r = i + 1;
    }
    for(int i = 0; i < m; i++) cur += path(st[i].val, st[st[i].r].val);
    int cl = 0, cr = m - 1;
    for(int i = 0; i <= m / block; i++){
        if(!b[i].size()) continue;
        while(cr < m - 1){
            roll_back();
            cr++;
        }
        while(cl < i * block){
            del(cl++);
        }
        while(stk.size()) stk.pop();
        for(auto [l, r, id] : b[i]){
            while(r > cr){
                roll_back();
                cr++;
            }
            while(r < cr){
                del(cr--);
            }
            while(cl < l) del(cl++);
            ans[id] = cur;
            while(cl > i * block){
                roll_back();
                cl--;
            }
        }
    }
    for(int i = 0; i < q; i++) cout<<ans[i] / 2 + 1<<"\n";
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 20312 KB Output is correct
2 Correct 4 ms 20316 KB Output is correct
3 Correct 4 ms 20316 KB Output is correct
4 Correct 5 ms 20316 KB Output is correct
5 Correct 4 ms 20316 KB Output is correct
6 Correct 5 ms 20316 KB Output is correct
7 Correct 5 ms 20380 KB Output is correct
8 Correct 5 ms 20316 KB Output is correct
9 Correct 6 ms 20316 KB Output is correct
10 Correct 5 ms 20440 KB Output is correct
11 Correct 5 ms 20316 KB Output is correct
12 Correct 4 ms 20316 KB Output is correct
13 Correct 4 ms 20316 KB Output is correct
14 Correct 4 ms 20408 KB Output is correct
15 Correct 5 ms 20316 KB Output is correct
16 Correct 6 ms 20316 KB Output is correct
17 Correct 5 ms 20568 KB Output is correct
18 Correct 5 ms 20316 KB Output is correct
19 Correct 6 ms 20412 KB Output is correct
20 Correct 5 ms 20316 KB Output is correct
21 Correct 6 ms 20444 KB Output is correct
22 Correct 5 ms 20316 KB Output is correct
23 Correct 6 ms 20312 KB Output is correct
24 Correct 5 ms 20316 KB Output is correct
25 Correct 5 ms 20316 KB Output is correct
26 Correct 5 ms 20316 KB Output is correct
27 Correct 5 ms 20316 KB Output is correct
28 Correct 4 ms 20316 KB Output is correct
29 Correct 6 ms 20316 KB Output is correct
30 Correct 14 ms 20568 KB Output is correct
31 Correct 16 ms 20628 KB Output is correct
32 Correct 20 ms 22740 KB Output is correct
33 Correct 24 ms 22620 KB Output is correct
34 Correct 19 ms 22616 KB Output is correct
35 Correct 7 ms 22872 KB Output is correct
36 Correct 7 ms 22708 KB Output is correct
37 Correct 10 ms 22620 KB Output is correct
38 Correct 20 ms 22876 KB Output is correct
39 Correct 19 ms 22776 KB Output is correct
40 Correct 19 ms 22620 KB Output is correct
41 Correct 7 ms 22620 KB Output is correct
42 Correct 7 ms 22616 KB Output is correct
43 Correct 7 ms 22620 KB Output is correct
44 Correct 19 ms 22616 KB Output is correct
45 Correct 19 ms 22872 KB Output is correct
46 Correct 24 ms 22868 KB Output is correct
47 Correct 7 ms 22616 KB Output is correct
48 Correct 7 ms 22620 KB Output is correct
49 Correct 7 ms 22620 KB Output is correct
50 Correct 19 ms 22620 KB Output is correct
51 Correct 18 ms 22616 KB Output is correct
52 Correct 19 ms 22620 KB Output is correct
53 Correct 21 ms 22620 KB Output is correct
54 Correct 19 ms 22620 KB Output is correct
55 Correct 18 ms 22620 KB Output is correct
56 Correct 15 ms 20572 KB Output is correct
57 Correct 5 ms 22620 KB Output is correct
58 Correct 19 ms 22620 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 20316 KB Output is correct
2 Correct 5 ms 20420 KB Output is correct
3 Correct 18 ms 20572 KB Output is correct
4 Correct 1993 ms 60388 KB Output is correct
5 Correct 1226 ms 72176 KB Output is correct
6 Incorrect 1901 ms 78444 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 20320 KB Output is correct
2 Correct 680 ms 50120 KB Output is correct
3 Correct 2043 ms 53996 KB Output is correct
4 Correct 1116 ms 57644 KB Output is correct
5 Incorrect 120 ms 74688 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 20316 KB Output is correct
2 Correct 7 ms 20316 KB Output is correct
3 Correct 21 ms 20580 KB Output is correct
4 Correct 2434 ms 57484 KB Output is correct
5 Correct 2521 ms 57608 KB Output is correct
6 Correct 3731 ms 73716 KB Output is correct
7 Incorrect 4027 ms 80904 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 20312 KB Output is correct
2 Correct 4 ms 20316 KB Output is correct
3 Correct 4 ms 20316 KB Output is correct
4 Correct 5 ms 20316 KB Output is correct
5 Correct 4 ms 20316 KB Output is correct
6 Correct 5 ms 20316 KB Output is correct
7 Correct 5 ms 20380 KB Output is correct
8 Correct 5 ms 20316 KB Output is correct
9 Correct 6 ms 20316 KB Output is correct
10 Correct 5 ms 20440 KB Output is correct
11 Correct 5 ms 20316 KB Output is correct
12 Correct 4 ms 20316 KB Output is correct
13 Correct 4 ms 20316 KB Output is correct
14 Correct 4 ms 20408 KB Output is correct
15 Correct 5 ms 20316 KB Output is correct
16 Correct 6 ms 20316 KB Output is correct
17 Correct 5 ms 20568 KB Output is correct
18 Correct 5 ms 20316 KB Output is correct
19 Correct 6 ms 20412 KB Output is correct
20 Correct 5 ms 20316 KB Output is correct
21 Correct 6 ms 20444 KB Output is correct
22 Correct 5 ms 20316 KB Output is correct
23 Correct 6 ms 20312 KB Output is correct
24 Correct 5 ms 20316 KB Output is correct
25 Correct 5 ms 20316 KB Output is correct
26 Correct 5 ms 20316 KB Output is correct
27 Correct 5 ms 20316 KB Output is correct
28 Correct 4 ms 20316 KB Output is correct
29 Correct 6 ms 20316 KB Output is correct
30 Correct 14 ms 20568 KB Output is correct
31 Correct 16 ms 20628 KB Output is correct
32 Correct 20 ms 22740 KB Output is correct
33 Correct 24 ms 22620 KB Output is correct
34 Correct 19 ms 22616 KB Output is correct
35 Correct 7 ms 22872 KB Output is correct
36 Correct 7 ms 22708 KB Output is correct
37 Correct 10 ms 22620 KB Output is correct
38 Correct 20 ms 22876 KB Output is correct
39 Correct 19 ms 22776 KB Output is correct
40 Correct 19 ms 22620 KB Output is correct
41 Correct 7 ms 22620 KB Output is correct
42 Correct 7 ms 22616 KB Output is correct
43 Correct 7 ms 22620 KB Output is correct
44 Correct 19 ms 22616 KB Output is correct
45 Correct 19 ms 22872 KB Output is correct
46 Correct 24 ms 22868 KB Output is correct
47 Correct 7 ms 22616 KB Output is correct
48 Correct 7 ms 22620 KB Output is correct
49 Correct 7 ms 22620 KB Output is correct
50 Correct 19 ms 22620 KB Output is correct
51 Correct 18 ms 22616 KB Output is correct
52 Correct 19 ms 22620 KB Output is correct
53 Correct 21 ms 22620 KB Output is correct
54 Correct 19 ms 22620 KB Output is correct
55 Correct 18 ms 22620 KB Output is correct
56 Correct 15 ms 20572 KB Output is correct
57 Correct 5 ms 22620 KB Output is correct
58 Correct 19 ms 22620 KB Output is correct
59 Correct 4 ms 20316 KB Output is correct
60 Correct 5 ms 20420 KB Output is correct
61 Correct 18 ms 20572 KB Output is correct
62 Correct 1993 ms 60388 KB Output is correct
63 Correct 1226 ms 72176 KB Output is correct
64 Incorrect 1901 ms 78444 KB Output isn't correct
65 Halted 0 ms 0 KB -