oj.uz

답안 #793768

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
793768 2023-07-26T06:25:32 Z vjudge1 Tourism (JOI23_tourism) C++17
17 / 100
 5000 ms 291332 KB 

// Author : حسن

#include <bits/stdc++.h>



using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 2e5 + 9 , mod = 1e9 + 7;
ll c[N] = {} , d[N] = {} , a[N] = {}, b[N] = {}  , us[N] , us1[N] , st[20][N][2] , dp[N] = {};

vector<int>v[N];
multiset<pair<int,int>>st1[N / 2];
void dfs(int n,int p = 0){
    d[n] = d[p] + 1;
    for(auto to : v[n])
        if(to != p)
            dfs(to , n);
}

void dfs2(int n,int p = 0){
    d[n] = d[p] + 1;
    for(auto to1 : v[n])
        if(to1 != p){
            dfs2(to1 , n);
            if(st1[to1].size() > st1[n].size())
                swap(st1[to1] , st1[n]);
            for(auto to : st1[to1]){
                auto it = st1[n].lower_bound({to.fi , 0});
                if(it != st1[n].end() && it->fi == to.fi){
                    c[to.fi] += max(to.se - d[n] - 1 ,0ll);
                    if(to.se != d[n] && it->se != d[n])
                        c[to.fi]++;
                    c[to.fi] += max(it->se - d[n] - 1 ,0ll);
                    st1[n].erase(it);
                    st1[n].insert({to.fi , d[n]});
                }else
                    st1[n].insert(to);
        }
}
}


ll ans;
void dfs1(int n,int p = 0){
    for(auto to : v[n])
        if(to != p)
            dfs1(to , n);
        ll s = 0;
     for(auto to  : v[n])
            if(b[to] != 0)
                if(to != p)
                s++, b[n] = b[to];
    if(s != 0){
        if(s == 1 && us[n] == 0){

        }else {
        ans++;
        for(auto to  : v[n])
            if(to != p && b[to] != 0){
            ans += d[b[to]] - d[n] - 1;
            }
        b[n] = n;
        }
    }else if(us[n] == 1){
        ans++;
        b[n] = n;
    }
}



pair<ll,ll> get(int x , int y){
    ll i = dp[y - x + 1];
    ll minimum = min(st[i][x][1], st[i][y - (1 << i) + 1][1]);
    ll maximum = max(st[i][x][0], st[i][y - (1 << i) + 1][0]);
    //cout<<i<<" "<<minimum<<" "<<maximum<<" ";
    return {maximum , minimum};
}

void get1(){
    ll x ,y , i;
x = 0;
    y = 1;
    dp[0] = 0;
    for(i = 1; i <= 2e5; i++){
        if(2 * y <= i)
            x++, y *= 2;
        dp[i] = x;
    }
    }

void solve(){
    ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
    cin>>n>>m>>q;
    for(i = 1; i < n; i++){
        cin>>l>>r;
        v[l].pb(r);
        v[r].pb(l);
        if(!(l == i && r == i + 1))
            s++;
    }
    for(i = 1; i <= m; i++)
        cin>>a[i];
    dfs(1);
    get1();
    for(i = 1; i <= m; i++)
        st[0][i][0]  = st[0][i][1] = d[a[i]];
    for (int i = 1; i < 18; i++)
    for (int j = 1; j + (1 << i) <= (m + 2); j++){
        st[i][j][0] = max(st[i - 1][j][0], st[i - 1][j + (1 << (i - 1))][0]);
        st[i][j][1] = min(st[i - 1][j][1], st[i - 1][j + (1 << (i - 1))][1]);
    }
    if(s && n <= 2000 && m <= 2000 && q <= 2000){
    while(q--){
        cin>>l>>r;
        for(i = 1; i <= n; i++){
            us[i] = b[i] = c[i] = 0;
        }
        for(i = l; i <= r; i++)
            us[a[i]] = 1;
        ans = 0;
        dfs1(1);
        cout<<ans<<"\n";
    }
    }else if(s == 0){
    while(q--){
        cin>>l>>r;
        cout<<get(l , r).fi - get(l , r).se + 1<<"\n";
    }
    }else {
        for(i = 1; i <= q; i++){
            cin>>l>>r;
            for(j = l; j <= r; j++)
                us[a[j]] = i ,c[i]++, st1[a[j]].insert({i , d[a[j]]});
        }
        dfs2( 1);
        for(i = 1; i <= q; i++)
            cout<<c[i]<<"\n";
    }
}

int main(){

     TL;
     /*
     #ifndef ONLINE_JUDGE
     freopen("input.txt", "r", stdin);
     freopen("output.txt", "w", stdout);
     #endif
     */
int t = 1;
//cin>>t;

while(t--)
     {
     solve();
     }

}
// Author : حسن

Compilation message

tourism.cpp: In function 'void solve()':
tourism.cpp:112:28: warning: unused variable 'z' [-Wunused-variable]
  112 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                            ^
tourism.cpp:112:40: warning: unused variable 'f' [-Wunused-variable]
  112 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                        ^
tourism.cpp:112:51: warning: unused variable 'k' [-Wunused-variable]
  112 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                   ^
tourism.cpp:112:55: warning: unused variable 'x' [-Wunused-variable]
  112 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                       ^
tourism.cpp:112:59: warning: unused variable 'y' [-Wunused-variable]
  112 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                           ^
tourism.cpp:112:63: warning: unused variable 'mn' [-Wunused-variable]
  112 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                               ^~
tourism.cpp:112:76: warning: unused variable 'mx' [-Wunused-variable]
  112 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                                            ^~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11220 KB Output is correct
2 Correct 6 ms 11272 KB Output is correct
3 Correct 5 ms 11348 KB Output is correct
4 Correct 6 ms 11348 KB Output is correct
5 Correct 6 ms 11348 KB Output is correct
6 Correct 7 ms 11348 KB Output is correct
7 Correct 6 ms 11416 KB Output is correct
8 Correct 6 ms 11348 KB Output is correct
9 Correct 7 ms 11400 KB Output is correct
10 Correct 7 ms 11372 KB Output is correct
11 Correct 6 ms 11348 KB Output is correct
12 Correct 6 ms 11348 KB Output is correct
13 Correct 6 ms 11436 KB Output is correct
14 Correct 6 ms 11348 KB Output is correct
15 Correct 6 ms 11348 KB Output is correct
16 Correct 6 ms 11452 KB Output is correct
17 Correct 7 ms 11452 KB Output is correct
18 Correct 6 ms 11348 KB Output is correct
19 Correct 6 ms 11456 KB Output is correct
20 Correct 6 ms 11348 KB Output is correct
21 Correct 9 ms 11348 KB Output is correct
22 Correct 8 ms 11476 KB Output is correct
23 Correct 7 ms 11448 KB Output is correct
24 Correct 6 ms 11444 KB Output is correct
25 Correct 6 ms 11348 KB Output is correct
26 Correct 7 ms 11348 KB Output is correct
27 Correct 5 ms 11348 KB Output is correct
28 Correct 8 ms 11348 KB Output is correct
29 Correct 6 ms 11348 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11220 KB Output is correct
2 Correct 6 ms 11272 KB Output is correct
3 Correct 5 ms 11348 KB Output is correct
4 Correct 6 ms 11348 KB Output is correct
5 Correct 6 ms 11348 KB Output is correct
6 Correct 7 ms 11348 KB Output is correct
7 Correct 6 ms 11416 KB Output is correct
8 Correct 6 ms 11348 KB Output is correct
9 Correct 7 ms 11400 KB Output is correct
10 Correct 7 ms 11372 KB Output is correct
11 Correct 6 ms 11348 KB Output is correct
12 Correct 6 ms 11348 KB Output is correct
13 Correct 6 ms 11436 KB Output is correct
14 Correct 6 ms 11348 KB Output is correct
15 Correct 6 ms 11348 KB Output is correct
16 Correct 6 ms 11452 KB Output is correct
17 Correct 7 ms 11452 KB Output is correct
18 Correct 6 ms 11348 KB Output is correct
19 Correct 6 ms 11456 KB Output is correct
20 Correct 6 ms 11348 KB Output is correct
21 Correct 9 ms 11348 KB Output is correct
22 Correct 8 ms 11476 KB Output is correct
23 Correct 7 ms 11448 KB Output is correct
24 Correct 6 ms 11444 KB Output is correct
25 Correct 6 ms 11348 KB Output is correct
26 Correct 7 ms 11348 KB Output is correct
27 Correct 5 ms 11348 KB Output is correct
28 Correct 8 ms 11348 KB Output is correct
29 Correct 6 ms 11348 KB Output is correct
30 Correct 44 ms 11728 KB Output is correct
31 Correct 57 ms 11732 KB Output is correct
32 Correct 89 ms 11860 KB Output is correct
33 Correct 90 ms 11860 KB Output is correct
34 Correct 89 ms 11860 KB Output is correct
35 Correct 55 ms 11852 KB Output is correct
36 Correct 57 ms 11844 KB Output is correct
37 Correct 56 ms 11864 KB Output is correct
38 Correct 65 ms 11932 KB Output is correct
39 Correct 62 ms 11948 KB Output is correct
40 Correct 65 ms 11952 KB Output is correct
41 Correct 68 ms 11872 KB Output is correct
42 Correct 71 ms 11952 KB Output is correct
43 Correct 67 ms 11912 KB Output is correct
44 Correct 74 ms 11900 KB Output is correct
45 Correct 75 ms 11880 KB Output is correct
46 Correct 67 ms 11904 KB Output is correct
47 Correct 63 ms 11892 KB Output is correct
48 Correct 62 ms 11876 KB Output is correct
49 Correct 75 ms 11880 KB Output is correct
50 Correct 65 ms 11852 KB Output is correct
51 Correct 65 ms 11872 KB Output is correct
52 Correct 64 ms 11860 KB Output is correct
53 Correct 63 ms 11872 KB Output is correct
54 Correct 64 ms 11860 KB Output is correct
55 Correct 66 ms 11868 KB Output is correct
56 Correct 6 ms 11604 KB Output is correct
57 Correct 45 ms 11400 KB Output is correct
58 Correct 45 ms 11864 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 11264 KB Output is correct
2 Correct 5 ms 11348 KB Output is correct
3 Correct 6 ms 11604 KB Output is correct
4 Correct 47 ms 37936 KB Output is correct
5 Correct 54 ms 31048 KB Output is correct
6 Correct 51 ms 38604 KB Output is correct
7 Correct 62 ms 44368 KB Output is correct
8 Correct 69 ms 44352 KB Output is correct
9 Correct 65 ms 44360 KB Output is correct
10 Correct 63 ms 44296 KB Output is correct
11 Correct 63 ms 44312 KB Output is correct
12 Correct 60 ms 44284 KB Output is correct
13 Correct 57 ms 44260 KB Output is correct
14 Correct 58 ms 44360 KB Output is correct
15 Correct 45 ms 18460 KB Output is correct
16 Correct 64 ms 43996 KB Output is correct
17 Correct 52 ms 36884 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 11220 KB Output is correct
2 Incorrect 71 ms 35788 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 11220 KB Output is correct
2 Correct 5 ms 11348 KB Output is correct
3 Correct 7 ms 11604 KB Output is correct
4 Execution timed out 5078 ms 291332 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11220 KB Output is correct
2 Correct 6 ms 11272 KB Output is correct
3 Correct 5 ms 11348 KB Output is correct
4 Correct 6 ms 11348 KB Output is correct
5 Correct 6 ms 11348 KB Output is correct
6 Correct 7 ms 11348 KB Output is correct
7 Correct 6 ms 11416 KB Output is correct
8 Correct 6 ms 11348 KB Output is correct
9 Correct 7 ms 11400 KB Output is correct
10 Correct 7 ms 11372 KB Output is correct
11 Correct 6 ms 11348 KB Output is correct
12 Correct 6 ms 11348 KB Output is correct
13 Correct 6 ms 11436 KB Output is correct
14 Correct 6 ms 11348 KB Output is correct
15 Correct 6 ms 11348 KB Output is correct
16 Correct 6 ms 11452 KB Output is correct
17 Correct 7 ms 11452 KB Output is correct
18 Correct 6 ms 11348 KB Output is correct
19 Correct 6 ms 11456 KB Output is correct
20 Correct 6 ms 11348 KB Output is correct
21 Correct 9 ms 11348 KB Output is correct
22 Correct 8 ms 11476 KB Output is correct
23 Correct 7 ms 11448 KB Output is correct
24 Correct 6 ms 11444 KB Output is correct
25 Correct 6 ms 11348 KB Output is correct
26 Correct 7 ms 11348 KB Output is correct
27 Correct 5 ms 11348 KB Output is correct
28 Correct 8 ms 11348 KB Output is correct
29 Correct 6 ms 11348 KB Output is correct
30 Correct 44 ms 11728 KB Output is correct
31 Correct 57 ms 11732 KB Output is correct
32 Correct 89 ms 11860 KB Output is correct
33 Correct 90 ms 11860 KB Output is correct
34 Correct 89 ms 11860 KB Output is correct
35 Correct 55 ms 11852 KB Output is correct
36 Correct 57 ms 11844 KB Output is correct
37 Correct 56 ms 11864 KB Output is correct
38 Correct 65 ms 11932 KB Output is correct
39 Correct 62 ms 11948 KB Output is correct
40 Correct 65 ms 11952 KB Output is correct
41 Correct 68 ms 11872 KB Output is correct
42 Correct 71 ms 11952 KB Output is correct
43 Correct 67 ms 11912 KB Output is correct
44 Correct 74 ms 11900 KB Output is correct
45 Correct 75 ms 11880 KB Output is correct
46 Correct 67 ms 11904 KB Output is correct
47 Correct 63 ms 11892 KB Output is correct
48 Correct 62 ms 11876 KB Output is correct
49 Correct 75 ms 11880 KB Output is correct
50 Correct 65 ms 11852 KB Output is correct
51 Correct 65 ms 11872 KB Output is correct
52 Correct 64 ms 11860 KB Output is correct
53 Correct 63 ms 11872 KB Output is correct
54 Correct 64 ms 11860 KB Output is correct
55 Correct 66 ms 11868 KB Output is correct
56 Correct 6 ms 11604 KB Output is correct
57 Correct 45 ms 11400 KB Output is correct
58 Correct 45 ms 11864 KB Output is correct
59 Correct 5 ms 11264 KB Output is correct
60 Correct 5 ms 11348 KB Output is correct
61 Correct 6 ms 11604 KB Output is correct
62 Correct 47 ms 37936 KB Output is correct
63 Correct 54 ms 31048 KB Output is correct
64 Correct 51 ms 38604 KB Output is correct
65 Correct 62 ms 44368 KB Output is correct
66 Correct 69 ms 44352 KB Output is correct
67 Correct 65 ms 44360 KB Output is correct
68 Correct 63 ms 44296 KB Output is correct
69 Correct 63 ms 44312 KB Output is correct
70 Correct 60 ms 44284 KB Output is correct
71 Correct 57 ms 44260 KB Output is correct
72 Correct 58 ms 44360 KB Output is correct
73 Correct 45 ms 18460 KB Output is correct
74 Correct 64 ms 43996 KB Output is correct
75 Correct 52 ms 36884 KB Output is correct
76 Correct 5 ms 11220 KB Output is correct
77 Incorrect 71 ms 35788 KB Output isn't correct
78 Halted 0 ms 0 KB -