oj.uz

Submission #998829

# Submission time Handle Problem Language Result Execution time Memory
998829 2024-06-14T17:23:08 Z imarn Tourism (JOI23_tourism) C++14
28 / 100
 5000 ms 21988 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vi>
using namespace std;
const int mxn=1e5+5,blc=505;
vector<int>g[mxn];
int tin[mxn],tout[mxn],cnt=0,pr[mxn][19],d[mxn]{0};
void dfs(int u,int p,int l){
    d[u]=l;pr[u][0]=p;tin[u]=++cnt;
    for(int i=1;i<19;i++)pr[u][i]=pr[pr[u][i-1]][i-1];
    for(auto v:g[u]){
        if(v==p)continue;dfs(v,u,l+1);
    }tout[u]=cnt;
}
int get(int a,int b){
    if(d[a]>d[b])swap(a,b);
    for(int i=18;i>=0;i--)if(d[b]-(1<<i)>=d[a])b=pr[b][i];
    if(a==b)return a;
    for(int i=18;i>=0;i--)if(pr[a][i]!=pr[b][i])a=pr[a][i],b=pr[b][i];
    return pr[a][0];
}
bool cmp(pair<pii,int>a,pair<pii,int>b){
    if(a.f.f/blc==b.f.f/blc)return a.f.s<b.f.s;
    else return a.f.f<b.f.f;
}multiset<pii>ms;
int ans=0;
int cal(int a,int b){
    return d[a]+d[b]-2*d[get(a,b)];
}
void add(int t,int u){
    if(ms.empty()){ms.insert({t,u});return;}
    if(ms.size()==1){
        ms.insert({t,u});
        ans += 2*(cal(ms.begin()->s,(--ms.end())->s));
        return;
    }
    if(t>=(--ms.end())->f||t<=ms.begin()->f){
        ans-=cal(ms.begin()->s,(--ms.end())->s);
        ans+=cal(ms.begin()->s,u);
        ans+=cal((--ms.end())->s,u);
        ms.insert({t,u});
        return;
    }
    ms.insert({t,u});
    auto it = ms.lower_bound({t,u});
    auto it2=++it;it--;auto it3=--it;it++;
    ans-=cal(it2->s,it3->s);
    ans+=cal(it2->s,it->s);
    ans+=cal(it3->s,it->s);
}
void del(int t,int u){
    if(ms.size()==1){
        ms.erase({t,u});return;
    }
    if(ms.size()==2){
        ans-=2*(cal(ms.begin()->s,(--ms.end())->s));
        ms.erase(ms.lower_bound({t,u}));return;
    }auto it = ms.lower_bound({t,u});
    if(it==ms.begin()){
        ans-=cal(it->s,(--ms.end())->s);
        ans-=cal(it->s,next(it)->s);
        ans+=cal(next(it)->s,(--ms.end())->s);
        ms.erase(ms.lower_bound({t,u}));return;
    }
    if(it==(--ms.end())){
        ans-=cal(it->s,prev(--ms.end())->s);
        ans-=cal(it->s,ms.begin()->s);
        ans+=cal(ms.begin()->s,prev(--ms.end())->s);
        ms.erase(ms.lower_bound({t,u}));return;
    }auto it2=--it;it++;auto it3=++it;it--;
    ans-=cal(it2->s,it->s);ans-=cal(it3->s,it->s);
    ans+=cal(it2->s,it3->s);ms.erase(ms.lower_bound({t,u}));

}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n,m,q;cin>>n>>m>>q;
    for(int i=1;i<=n-1;i++){
        int u,v;cin>>u>>v;g[u].pb(v),g[v].pb(u);
    }dfs(1,1,0);int a[m+1];vector<pair<pii,int>>qr(q);
    for(int i=1;i<=m;i++)cin>>a[i];
    for(int i=0;i<q;i++)cin>>qr[i].f.f>>qr[i].f.s,qr[i].s=i;
    sort(qr.begin(),qr.end(),cmp);int res[q];
    int cl=1,cr=0;
    for(auto it : qr){
        while(cr<it.f.s)cr++,add(tin[a[cr]],a[cr]);
        while(cl>it.f.f)cl--,add(tin[a[cl]],a[cl]);
        while(cr>it.f.s)del(tin[a[cr]],a[cr]),cr--;
        while(cl<it.f.f)del(tin[a[cl]],a[cl]),cl++;
        res[it.s]=ans/2+1;
    }for(int i=0;i<q;i++)cout<<res[i]<<'\n';
}

Compilation message

tourism.cpp: In function 'void dfs(int, int, int)':
tourism.cpp:23:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   23 |         if(v==p)continue;dfs(v,u,l+1);
      |         ^~
tourism.cpp:23:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   23 |         if(v==p)continue;dfs(v,u,l+1);
      |                          ^~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 4 ms 4956 KB Output is correct
5 Correct 4 ms 4956 KB Output is correct
6 Correct 4 ms 4956 KB Output is correct
7 Correct 4 ms 4956 KB Output is correct
8 Correct 3 ms 4956 KB Output is correct
9 Correct 6 ms 5136 KB Output is correct
10 Correct 6 ms 4956 KB Output is correct
11 Correct 8 ms 4952 KB Output is correct
12 Correct 1 ms 5136 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 2 ms 4952 KB Output is correct
15 Correct 6 ms 4956 KB Output is correct
16 Correct 5 ms 4956 KB Output is correct
17 Correct 5 ms 4956 KB Output is correct
18 Correct 6 ms 4956 KB Output is correct
19 Correct 6 ms 5208 KB Output is correct
20 Correct 5 ms 4956 KB Output is correct
21 Correct 6 ms 4956 KB Output is correct
22 Correct 6 ms 5144 KB Output is correct
23 Correct 5 ms 4956 KB Output is correct
24 Correct 6 ms 4952 KB Output is correct
25 Correct 7 ms 5144 KB Output is correct
26 Correct 6 ms 5140 KB Output is correct
27 Correct 3 ms 4956 KB Output is correct
28 Correct 1 ms 4956 KB Output is correct
29 Correct 1 ms 5096 KB Output is correct
30 Correct 61 ms 5276 KB Output is correct
31 Correct 77 ms 5276 KB Output is correct
32 Correct 93 ms 5208 KB Output is correct
33 Correct 95 ms 5344 KB Output is correct
34 Correct 94 ms 5208 KB Output is correct
35 Correct 8 ms 5212 KB Output is correct
36 Correct 8 ms 5364 KB Output is correct
37 Correct 8 ms 5212 KB Output is correct
38 Correct 77 ms 5408 KB Output is correct
39 Correct 79 ms 5212 KB Output is correct
40 Correct 80 ms 5212 KB Output is correct
41 Correct 7 ms 3420 KB Output is correct
42 Correct 10 ms 5468 KB Output is correct
43 Correct 7 ms 5212 KB Output is correct
44 Correct 79 ms 3444 KB Output is correct
45 Correct 80 ms 3460 KB Output is correct
46 Correct 80 ms 3460 KB Output is correct
47 Correct 8 ms 5212 KB Output is correct
48 Correct 7 ms 5212 KB Output is correct
49 Correct 7 ms 5212 KB Output is correct
50 Correct 84 ms 3420 KB Output is correct
51 Correct 83 ms 5208 KB Output is correct
52 Correct 81 ms 5208 KB Output is correct
53 Correct 80 ms 3460 KB Output is correct
54 Correct 80 ms 5208 KB Output is correct
55 Correct 89 ms 5208 KB Output is correct
56 Correct 37 ms 3164 KB Output is correct
57 Correct 2 ms 5208 KB Output is correct
58 Correct 3 ms 5180 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 3 ms 4952 KB Output is correct
3 Correct 37 ms 5212 KB Output is correct
4 Execution timed out 5036 ms 21988 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 4952 KB Output is correct
2 Correct 55 ms 11580 KB Output is correct
3 Correct 87 ms 13256 KB Output is correct
4 Correct 71 ms 13432 KB Output is correct
5 Correct 94 ms 21332 KB Output is correct
6 Correct 124 ms 19796 KB Output is correct
7 Correct 133 ms 17488 KB Output is correct
8 Correct 131 ms 16980 KB Output is correct
9 Correct 129 ms 16724 KB Output is correct
10 Correct 124 ms 16720 KB Output is correct
11 Correct 120 ms 16796 KB Output is correct
12 Correct 114 ms 16840 KB Output is correct
13 Correct 120 ms 16976 KB Output is correct
14 Correct 141 ms 17488 KB Output is correct
15 Correct 78 ms 19600 KB Output is correct
16 Correct 130 ms 19148 KB Output is correct
17 Correct 126 ms 19052 KB Output is correct
18 Correct 133 ms 19028 KB Output is correct
19 Correct 89 ms 21328 KB Output is correct
20 Correct 130 ms 21164 KB Output is correct
21 Correct 143 ms 18516 KB Output is correct
22 Correct 149 ms 17512 KB Output is correct
23 Correct 160 ms 17120 KB Output is correct
24 Correct 154 ms 16792 KB Output is correct
25 Correct 159 ms 16744 KB Output is correct
26 Correct 168 ms 16700 KB Output is correct
27 Correct 171 ms 16516 KB Output is correct
28 Correct 160 ms 16536 KB Output is correct
29 Correct 164 ms 16604 KB Output is correct
30 Correct 160 ms 16768 KB Output is correct
31 Correct 164 ms 16924 KB Output is correct
32 Correct 161 ms 17076 KB Output is correct
33 Correct 134 ms 18020 KB Output is correct
34 Correct 99 ms 19452 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 3 ms 4956 KB Output is correct
3 Correct 37 ms 5220 KB Output is correct
4 Execution timed out 5069 ms 18004 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 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 4 ms 4956 KB Output is correct
5 Correct 4 ms 4956 KB Output is correct
6 Correct 4 ms 4956 KB Output is correct
7 Correct 4 ms 4956 KB Output is correct
8 Correct 3 ms 4956 KB Output is correct
9 Correct 6 ms 5136 KB Output is correct
10 Correct 6 ms 4956 KB Output is correct
11 Correct 8 ms 4952 KB Output is correct
12 Correct 1 ms 5136 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 2 ms 4952 KB Output is correct
15 Correct 6 ms 4956 KB Output is correct
16 Correct 5 ms 4956 KB Output is correct
17 Correct 5 ms 4956 KB Output is correct
18 Correct 6 ms 4956 KB Output is correct
19 Correct 6 ms 5208 KB Output is correct
20 Correct 5 ms 4956 KB Output is correct
21 Correct 6 ms 4956 KB Output is correct
22 Correct 6 ms 5144 KB Output is correct
23 Correct 5 ms 4956 KB Output is correct
24 Correct 6 ms 4952 KB Output is correct
25 Correct 7 ms 5144 KB Output is correct
26 Correct 6 ms 5140 KB Output is correct
27 Correct 3 ms 4956 KB Output is correct
28 Correct 1 ms 4956 KB Output is correct
29 Correct 1 ms 5096 KB Output is correct
30 Correct 61 ms 5276 KB Output is correct
31 Correct 77 ms 5276 KB Output is correct
32 Correct 93 ms 5208 KB Output is correct
33 Correct 95 ms 5344 KB Output is correct
34 Correct 94 ms 5208 KB Output is correct
35 Correct 8 ms 5212 KB Output is correct
36 Correct 8 ms 5364 KB Output is correct
37 Correct 8 ms 5212 KB Output is correct
38 Correct 77 ms 5408 KB Output is correct
39 Correct 79 ms 5212 KB Output is correct
40 Correct 80 ms 5212 KB Output is correct
41 Correct 7 ms 3420 KB Output is correct
42 Correct 10 ms 5468 KB Output is correct
43 Correct 7 ms 5212 KB Output is correct
44 Correct 79 ms 3444 KB Output is correct
45 Correct 80 ms 3460 KB Output is correct
46 Correct 80 ms 3460 KB Output is correct
47 Correct 8 ms 5212 KB Output is correct
48 Correct 7 ms 5212 KB Output is correct
49 Correct 7 ms 5212 KB Output is correct
50 Correct 84 ms 3420 KB Output is correct
51 Correct 83 ms 5208 KB Output is correct
52 Correct 81 ms 5208 KB Output is correct
53 Correct 80 ms 3460 KB Output is correct
54 Correct 80 ms 5208 KB Output is correct
55 Correct 89 ms 5208 KB Output is correct
56 Correct 37 ms 3164 KB Output is correct
57 Correct 2 ms 5208 KB Output is correct
58 Correct 3 ms 5180 KB Output is correct
59 Correct 1 ms 4952 KB Output is correct
60 Correct 3 ms 4952 KB Output is correct
61 Correct 37 ms 5212 KB Output is correct
62 Execution timed out 5036 ms 21988 KB Time limit exceeded
63 Halted 0 ms 0 KB -