oj.uz

Submission #889665

# Submission time Handle Problem Language Result Execution time Memory
889665 2023-12-20T04:52:06 Z Aiperiii Tourism (JOI23_tourism) C++14
5 / 100
 5000 ms 12956 KB 
#include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
using namespace std;
const int N=1e5+5;
int mn[N*4],mx[N*4],c[N];
void build(int v,int tl,int tr){
    if(tl==tr){
        mn[v]=c[tl];
        mx[v]=c[tl];
    }
    else{
        int tm=(tl+tr)/2;
        build(v*2,tl,tm);
        build(v*2+1,tm+1,tr);
        mn[v]=min(mn[v*2],mn[v*2+1]);
        mx[v]=max(mx[v*2],mx[v*2+1]);
    }
}
int get_mn(int v,int tl,int tr,int l,int r){
    if(r<tl or l>tr)return INT_MAX;
    if(l<=tl && tr<=r)return mn[v];
    int tm=(tl+tr)/2;
    return min(get_mn(v*2,tl,tm,l,r),get_mn(v*2+1,tm+1,tr,l,r));
}
int get_mx(int v,int tl,int tr,int l,int r){
    if(r<tl or l>tr)return INT_MIN;
    if(l<=tl && tr<=r)return mx[v];
    int tm=(tl+tr)/2;
    return max(get_mx(v*2,tl,tm,l,r),get_mx(v*2+1,tm+1,tr,l,r));
}
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);
    int n,m,qq;
    cin>>n>>m>>qq;
    vector <int> g[n+1];
    for(int i=0;i<n-1;i++){
        int u,v;
        cin>>u>>v;
        g[u].pb(v);
        g[v].pb(u);
    }
    for(int i=1;i<=m;i++){
        cin>>c[i];
    }
    if(n<=300){
        queue <int> q;
        while(qq--){
            int l,r;
            cin>>l>>r;
            set <int> st;
            if(l==r)st.insert(l);
            for(int i=l;i<r;i++){
                vector <int> d(n+1,-1);
                vector <int> p(n+1);
                q.push(c[i]);
                d[c[i]]=1;
                while(!q.empty()){
                    int v=q.front();
                    q.pop();
                    for(auto to : g[v]){
                        if(d[to]==-1){
                            d[to]=1;
                            p[to]=v;
                            q.push(to);
                        }
                    }
                }
                int x=c[i+1];
                st.insert(x);st.insert(c[i]);
                while(x!=c[i]){
                    x=p[x];
                    st.insert(x);
                }
            }
            cout<<st.size()<<"\n";
        }
        return 0;
    }
    build(1,1,m);
    while(qq--){
        int l,r;
        cin>>l>>r;
        cout<<get_mx(1,1,m,l,r)-get_mn(1,1,m,l,r)+1<<"\n";
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 32 ms 460 KB Output is correct
5 Correct 31 ms 348 KB Output is correct
6 Correct 23 ms 348 KB Output is correct
7 Correct 31 ms 348 KB Output is correct
8 Correct 29 ms 468 KB Output is correct
9 Correct 88 ms 448 KB Output is correct
10 Correct 82 ms 456 KB Output is correct
11 Correct 86 ms 344 KB Output is correct
12 Correct 241 ms 452 KB Output is correct
13 Correct 242 ms 460 KB Output is correct
14 Correct 235 ms 348 KB Output is correct
15 Correct 121 ms 344 KB Output is correct
16 Correct 125 ms 344 KB Output is correct
17 Correct 125 ms 344 KB Output is correct
18 Correct 109 ms 348 KB Output is correct
19 Correct 112 ms 344 KB Output is correct
20 Correct 125 ms 448 KB Output is correct
21 Correct 53 ms 348 KB Output is correct
22 Correct 51 ms 344 KB Output is correct
23 Correct 51 ms 344 KB Output is correct
24 Correct 56 ms 348 KB Output is correct
25 Correct 53 ms 460 KB Output is correct
26 Correct 58 ms 468 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 32 ms 460 KB Output is correct
5 Correct 31 ms 348 KB Output is correct
6 Correct 23 ms 348 KB Output is correct
7 Correct 31 ms 348 KB Output is correct
8 Correct 29 ms 468 KB Output is correct
9 Correct 88 ms 448 KB Output is correct
10 Correct 82 ms 456 KB Output is correct
11 Correct 86 ms 344 KB Output is correct
12 Correct 241 ms 452 KB Output is correct
13 Correct 242 ms 460 KB Output is correct
14 Correct 235 ms 348 KB Output is correct
15 Correct 121 ms 344 KB Output is correct
16 Correct 125 ms 344 KB Output is correct
17 Correct 125 ms 344 KB Output is correct
18 Correct 109 ms 348 KB Output is correct
19 Correct 112 ms 344 KB Output is correct
20 Correct 125 ms 448 KB Output is correct
21 Correct 53 ms 348 KB Output is correct
22 Correct 51 ms 344 KB Output is correct
23 Correct 51 ms 344 KB Output is correct
24 Correct 56 ms 348 KB Output is correct
25 Correct 53 ms 460 KB Output is correct
26 Correct 58 ms 468 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Incorrect 3 ms 4608 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 448 KB Output is correct
3 Correct 46 ms 348 KB Output is correct
4 Correct 115 ms 10088 KB Output is correct
5 Correct 111 ms 11684 KB Output is correct
6 Correct 109 ms 11876 KB Output is correct
7 Correct 166 ms 12640 KB Output is correct
8 Correct 162 ms 12776 KB Output is correct
9 Correct 163 ms 12628 KB Output is correct
10 Correct 161 ms 12624 KB Output is correct
11 Correct 160 ms 12620 KB Output is correct
12 Correct 163 ms 12956 KB Output is correct
13 Correct 144 ms 12748 KB Output is correct
14 Correct 145 ms 12668 KB Output is correct
15 Correct 69 ms 10044 KB Output is correct
16 Correct 131 ms 12408 KB Output is correct
17 Execution timed out 5097 ms 2648 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 43 ms 9996 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 49 ms 348 KB Output is correct
4 Incorrect 145 ms 10788 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 32 ms 460 KB Output is correct
5 Correct 31 ms 348 KB Output is correct
6 Correct 23 ms 348 KB Output is correct
7 Correct 31 ms 348 KB Output is correct
8 Correct 29 ms 468 KB Output is correct
9 Correct 88 ms 448 KB Output is correct
10 Correct 82 ms 456 KB Output is correct
11 Correct 86 ms 344 KB Output is correct
12 Correct 241 ms 452 KB Output is correct
13 Correct 242 ms 460 KB Output is correct
14 Correct 235 ms 348 KB Output is correct
15 Correct 121 ms 344 KB Output is correct
16 Correct 125 ms 344 KB Output is correct
17 Correct 125 ms 344 KB Output is correct
18 Correct 109 ms 348 KB Output is correct
19 Correct 112 ms 344 KB Output is correct
20 Correct 125 ms 448 KB Output is correct
21 Correct 53 ms 348 KB Output is correct
22 Correct 51 ms 344 KB Output is correct
23 Correct 51 ms 344 KB Output is correct
24 Correct 56 ms 348 KB Output is correct
25 Correct 53 ms 460 KB Output is correct
26 Correct 58 ms 468 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Incorrect 3 ms 4608 KB Output isn't correct
31 Halted 0 ms 0 KB -