oj.uz

답안 #793651

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
793651 2023-07-26T05:06:31 Z vjudge1 Tourism (JOI23_tourism) C++17
10 / 100
 5000 ms 13900 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] , p[N][20];

vector<int>v[N];

void dfs(int n,int p = 0){
    d[n] = d[p] + 1;
    for(auto to : v[n])
        if(to != p)
            dfs(to , n);
}
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;
    }
}


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);
    if(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;
        mn = 1e9, mx = 0;
        for(i = l; i <= r; i++)
            us[a[i]] = 1 , mn = min(mn , d[a[i]]) , mx = max(mx , d[a[i]]);
        cout<<mx - mn + 1<<"\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:67:16: warning: unused variable 'j' [-Wunused-variable]
   67 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                ^
tourism.cpp:67:28: warning: unused variable 'z' [-Wunused-variable]
   67 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                            ^
tourism.cpp:67:40: warning: unused variable 'f' [-Wunused-variable]
   67 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                        ^
tourism.cpp:67:51: warning: unused variable 'k' [-Wunused-variable]
   67 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                   ^
tourism.cpp:67:55: warning: unused variable 'x' [-Wunused-variable]
   67 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                       ^
tourism.cpp:67:59: warning: unused variable 'y' [-Wunused-variable]
   67 |     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 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 4 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 4 ms 5076 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 4 ms 5076 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 4 ms 5076 KB Output is correct
27 Correct 2 ms 4948 KB Output is correct
28 Correct 3 ms 5076 KB Output is correct
29 Correct 3 ms 5076 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 4 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 4 ms 5076 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 4 ms 5076 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 4 ms 5076 KB Output is correct
27 Correct 2 ms 4948 KB Output is correct
28 Correct 3 ms 5076 KB Output is correct
29 Correct 3 ms 5076 KB Output is correct
30 Correct 42 ms 5168 KB Output is correct
31 Correct 53 ms 5168 KB Output is correct
32 Correct 85 ms 5204 KB Output is correct
33 Correct 89 ms 5204 KB Output is correct
34 Correct 86 ms 5204 KB Output is correct
35 Correct 53 ms 5204 KB Output is correct
36 Correct 55 ms 5192 KB Output is correct
37 Correct 54 ms 5208 KB Output is correct
38 Correct 60 ms 5272 KB Output is correct
39 Correct 60 ms 5284 KB Output is correct
40 Correct 62 ms 5296 KB Output is correct
41 Correct 65 ms 5328 KB Output is correct
42 Correct 68 ms 5308 KB Output is correct
43 Correct 63 ms 5276 KB Output is correct
44 Correct 64 ms 5252 KB Output is correct
45 Correct 60 ms 5232 KB Output is correct
46 Correct 61 ms 5252 KB Output is correct
47 Correct 64 ms 5324 KB Output is correct
48 Correct 60 ms 5204 KB Output is correct
49 Correct 62 ms 5248 KB Output is correct
50 Correct 60 ms 5204 KB Output is correct
51 Correct 61 ms 5204 KB Output is correct
52 Correct 59 ms 5216 KB Output is correct
53 Correct 60 ms 5204 KB Output is correct
54 Correct 63 ms 5216 KB Output is correct
55 Correct 61 ms 5204 KB Output is correct
56 Correct 4 ms 5076 KB Output is correct
57 Correct 46 ms 5172 KB Output is correct
58 Correct 42 ms 5204 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 5056 KB Output is correct
4 Correct 4847 ms 10388 KB Output is correct
5 Correct 2814 ms 12116 KB Output is correct
6 Correct 3357 ms 13132 KB Output is correct
7 Execution timed out 5078 ms 13900 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

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

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 4 ms 5080 KB Output is correct
4 Incorrect 18 ms 7900 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 4 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 4 ms 5076 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 4 ms 5076 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 4 ms 5076 KB Output is correct
27 Correct 2 ms 4948 KB Output is correct
28 Correct 3 ms 5076 KB Output is correct
29 Correct 3 ms 5076 KB Output is correct
30 Correct 42 ms 5168 KB Output is correct
31 Correct 53 ms 5168 KB Output is correct
32 Correct 85 ms 5204 KB Output is correct
33 Correct 89 ms 5204 KB Output is correct
34 Correct 86 ms 5204 KB Output is correct
35 Correct 53 ms 5204 KB Output is correct
36 Correct 55 ms 5192 KB Output is correct
37 Correct 54 ms 5208 KB Output is correct
38 Correct 60 ms 5272 KB Output is correct
39 Correct 60 ms 5284 KB Output is correct
40 Correct 62 ms 5296 KB Output is correct
41 Correct 65 ms 5328 KB Output is correct
42 Correct 68 ms 5308 KB Output is correct
43 Correct 63 ms 5276 KB Output is correct
44 Correct 64 ms 5252 KB Output is correct
45 Correct 60 ms 5232 KB Output is correct
46 Correct 61 ms 5252 KB Output is correct
47 Correct 64 ms 5324 KB Output is correct
48 Correct 60 ms 5204 KB Output is correct
49 Correct 62 ms 5248 KB Output is correct
50 Correct 60 ms 5204 KB Output is correct
51 Correct 61 ms 5204 KB Output is correct
52 Correct 59 ms 5216 KB Output is correct
53 Correct 60 ms 5204 KB Output is correct
54 Correct 63 ms 5216 KB Output is correct
55 Correct 61 ms 5204 KB Output is correct
56 Correct 4 ms 5076 KB Output is correct
57 Correct 46 ms 5172 KB Output is correct
58 Correct 42 ms 5204 KB Output is correct
59 Correct 2 ms 4948 KB Output is correct
60 Correct 2 ms 4948 KB Output is correct
61 Correct 3 ms 5056 KB Output is correct
62 Correct 4847 ms 10388 KB Output is correct
63 Correct 2814 ms 12116 KB Output is correct
64 Correct 3357 ms 13132 KB Output is correct
65 Execution timed out 5078 ms 13900 KB Time limit exceeded
66 Halted 0 ms 0 KB -