oj.uz

답안 #889676

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
889676 2023-12-20T05:03:53 Z vjudge1 Tourism (JOI23_tourism) C++17
5 / 100
 5000 ms 9124 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];
    int cnt=0;
    for(int i=0;i<n-1;i++){
        int u,v;
        cin>>u>>v;
        if(u==v+1)cnt++;
        g[u].pb(v);
        g[v].pb(u);
    }
    for(int i=1;i<=m;i++){
        cin>>c[i];
    }
    if(cnt==n-1){
        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";
        }
        return 0;
    }
    
    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";
    }
   
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 35 ms 348 KB Output is correct
5 Correct 31 ms 440 KB Output is correct
6 Correct 24 ms 344 KB Output is correct
7 Correct 36 ms 600 KB Output is correct
8 Correct 31 ms 344 KB Output is correct
9 Correct 88 ms 448 KB Output is correct
10 Correct 85 ms 452 KB Output is correct
11 Correct 90 ms 348 KB Output is correct
12 Correct 257 ms 600 KB Output is correct
13 Correct 241 ms 452 KB Output is correct
14 Correct 246 ms 348 KB Output is correct
15 Correct 122 ms 448 KB Output is correct
16 Correct 116 ms 600 KB Output is correct
17 Correct 127 ms 472 KB Output is correct
18 Correct 118 ms 348 KB Output is correct
19 Correct 112 ms 348 KB Output is correct
20 Correct 120 ms 452 KB Output is correct
21 Correct 54 ms 452 KB Output is correct
22 Correct 56 ms 348 KB Output is correct
23 Correct 52 ms 344 KB Output is correct
24 Correct 51 ms 344 KB Output is correct
25 Correct 62 ms 352 KB Output is correct
26 Correct 53 ms 344 KB Output is correct
27 Correct 1 ms 4696 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 35 ms 348 KB Output is correct
5 Correct 31 ms 440 KB Output is correct
6 Correct 24 ms 344 KB Output is correct
7 Correct 36 ms 600 KB Output is correct
8 Correct 31 ms 344 KB Output is correct
9 Correct 88 ms 448 KB Output is correct
10 Correct 85 ms 452 KB Output is correct
11 Correct 90 ms 348 KB Output is correct
12 Correct 257 ms 600 KB Output is correct
13 Correct 241 ms 452 KB Output is correct
14 Correct 246 ms 348 KB Output is correct
15 Correct 122 ms 448 KB Output is correct
16 Correct 116 ms 600 KB Output is correct
17 Correct 127 ms 472 KB Output is correct
18 Correct 118 ms 348 KB Output is correct
19 Correct 112 ms 348 KB Output is correct
20 Correct 120 ms 452 KB Output is correct
21 Correct 54 ms 452 KB Output is correct
22 Correct 56 ms 348 KB Output is correct
23 Correct 52 ms 344 KB Output is correct
24 Correct 51 ms 344 KB Output is correct
25 Correct 62 ms 352 KB Output is correct
26 Correct 53 ms 344 KB Output is correct
27 Correct 1 ms 4696 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Execution timed out 5059 ms 588 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Execution timed out 5060 ms 9124 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 5075 ms 6916 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 356 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Execution timed out 5076 ms 8668 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 35 ms 348 KB Output is correct
5 Correct 31 ms 440 KB Output is correct
6 Correct 24 ms 344 KB Output is correct
7 Correct 36 ms 600 KB Output is correct
8 Correct 31 ms 344 KB Output is correct
9 Correct 88 ms 448 KB Output is correct
10 Correct 85 ms 452 KB Output is correct
11 Correct 90 ms 348 KB Output is correct
12 Correct 257 ms 600 KB Output is correct
13 Correct 241 ms 452 KB Output is correct
14 Correct 246 ms 348 KB Output is correct
15 Correct 122 ms 448 KB Output is correct
16 Correct 116 ms 600 KB Output is correct
17 Correct 127 ms 472 KB Output is correct
18 Correct 118 ms 348 KB Output is correct
19 Correct 112 ms 348 KB Output is correct
20 Correct 120 ms 452 KB Output is correct
21 Correct 54 ms 452 KB Output is correct
22 Correct 56 ms 348 KB Output is correct
23 Correct 52 ms 344 KB Output is correct
24 Correct 51 ms 344 KB Output is correct
25 Correct 62 ms 352 KB Output is correct
26 Correct 53 ms 344 KB Output is correct
27 Correct 1 ms 4696 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Execution timed out 5059 ms 588 KB Time limit exceeded
31 Halted 0 ms 0 KB -