oj.uz

Submission #889738

# Submission time Handle Problem Language Result Execution time Memory
889738 2023-12-20T06:29:47 Z vjudge1 Tourism (JOI23_tourism) C++17
5 / 100
 5000 ms 5252 KB 

#include "bits/stdc++.h"

using namespace std;

#define pb push_back

#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")

const int N = 1e5 + 1;

vector<int> g[N];
int huy1[N],huy2[N];

signed main(){
    ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);      

	int n,m,q;
	cin >> n >> m >> q;
	for(int i = 0;i < n - 1;i++){
		int a,b;
		cin >> a >> b;
		g[a].pb(b);
		g[b].pb(a);
	}	
	for(int i = 1;i <= m;i++){
		int a;
		cin >> a;
		huy1[i] = a;
		huy2[a] = i;
	}
	if(n <= 2000){
		while(q--){
			int l,r;
			cin >> l >> r;
			vector<int> dis(n + 1,1e18);
			queue<pair<int,int>> q;
			q.push({huy1[l],-1});
			vector<int> pr(n + 1);
			while(!q.empty()){
				auto [v,p] = q.front();q.pop();
				for(auto u : g[v]){
					if(u != p && dis[u] > dis[v] + 1){
						dis[u] = dis[v] + 1;
						pr[u] = v;
						q.push({u,v});
					}
				}
			}
			vector<int> huy3(n + 1);
			for(int i = l + 1;i <= r;i++){
				int huy4 = huy1[i];
				while(huy4 != huy1[l]){
					huy3[huy4] = 1;
					 	huy4 = pr[huy4];
				}
			}
			int cnt = 0;
			for(int i = 1;i <= n;i++){
				cnt += huy3[i];
			}
			cout << cnt + 1 << "\n";
		}
	}
    
}

Compilation message

tourism.cpp: In function 'int main()':
tourism.cpp:40:26: warning: overflow in conversion from 'double' to 'std::vector<int>::value_type' {aka 'int'} changes value from '1.0e+18' to '2147483647' [-Woverflow]
   40 |    vector<int> dis(n + 1,1e18);
      |                          ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 1 ms 3164 KB Output is correct
4 Correct 2 ms 3420 KB Output is correct
5 Correct 2 ms 3420 KB Output is correct
6 Correct 2 ms 3420 KB Output is correct
7 Correct 2 ms 3420 KB Output is correct
8 Correct 2 ms 3420 KB Output is correct
9 Correct 3 ms 3416 KB Output is correct
10 Correct 3 ms 3420 KB Output is correct
11 Correct 2 ms 3420 KB Output is correct
12 Correct 3 ms 3416 KB Output is correct
13 Correct 4 ms 3420 KB Output is correct
14 Correct 3 ms 3420 KB Output is correct
15 Correct 8 ms 3432 KB Output is correct
16 Correct 7 ms 3420 KB Output is correct
17 Correct 8 ms 3432 KB Output is correct
18 Correct 5 ms 3420 KB Output is correct
19 Correct 6 ms 3420 KB Output is correct
20 Correct 6 ms 3420 KB Output is correct
21 Correct 2 ms 3420 KB Output is correct
22 Correct 2 ms 3420 KB Output is correct
23 Correct 2 ms 3420 KB Output is correct
24 Correct 2 ms 3420 KB Output is correct
25 Correct 2 ms 3420 KB Output is correct
26 Correct 2 ms 3420 KB Output is correct
27 Correct 1 ms 3164 KB Output is correct
28 Correct 2 ms 3420 KB Output is correct
29 Correct 2 ms 3420 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 1 ms 3164 KB Output is correct
4 Correct 2 ms 3420 KB Output is correct
5 Correct 2 ms 3420 KB Output is correct
6 Correct 2 ms 3420 KB Output is correct
7 Correct 2 ms 3420 KB Output is correct
8 Correct 2 ms 3420 KB Output is correct
9 Correct 3 ms 3416 KB Output is correct
10 Correct 3 ms 3420 KB Output is correct
11 Correct 2 ms 3420 KB Output is correct
12 Correct 3 ms 3416 KB Output is correct
13 Correct 4 ms 3420 KB Output is correct
14 Correct 3 ms 3420 KB Output is correct
15 Correct 8 ms 3432 KB Output is correct
16 Correct 7 ms 3420 KB Output is correct
17 Correct 8 ms 3432 KB Output is correct
18 Correct 5 ms 3420 KB Output is correct
19 Correct 6 ms 3420 KB Output is correct
20 Correct 6 ms 3420 KB Output is correct
21 Correct 2 ms 3420 KB Output is correct
22 Correct 2 ms 3420 KB Output is correct
23 Correct 2 ms 3420 KB Output is correct
24 Correct 2 ms 3420 KB Output is correct
25 Correct 2 ms 3420 KB Output is correct
26 Correct 2 ms 3420 KB Output is correct
27 Correct 1 ms 3164 KB Output is correct
28 Correct 2 ms 3420 KB Output is correct
29 Correct 2 ms 3420 KB Output is correct
30 Correct 39 ms 3488 KB Output is correct
31 Correct 51 ms 3472 KB Output is correct
32 Correct 81 ms 3672 KB Output is correct
33 Correct 83 ms 3416 KB Output is correct
34 Correct 80 ms 3500 KB Output is correct
35 Correct 155 ms 3500 KB Output is correct
36 Correct 168 ms 3420 KB Output is correct
37 Correct 168 ms 3496 KB Output is correct
38 Correct 1649 ms 3740 KB Output is correct
39 Correct 1653 ms 3492 KB Output is correct
40 Correct 1658 ms 3492 KB Output is correct
41 Execution timed out 5015 ms 3668 KB Time limit exceeded
42 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 1 ms 3420 KB Output is correct
3 Correct 3 ms 3420 KB Output is correct
4 Incorrect 16 ms 5212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Incorrect 15 ms 5212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 3 ms 3164 KB Output is correct
4 Incorrect 17 ms 5252 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 1 ms 3164 KB Output is correct
4 Correct 2 ms 3420 KB Output is correct
5 Correct 2 ms 3420 KB Output is correct
6 Correct 2 ms 3420 KB Output is correct
7 Correct 2 ms 3420 KB Output is correct
8 Correct 2 ms 3420 KB Output is correct
9 Correct 3 ms 3416 KB Output is correct
10 Correct 3 ms 3420 KB Output is correct
11 Correct 2 ms 3420 KB Output is correct
12 Correct 3 ms 3416 KB Output is correct
13 Correct 4 ms 3420 KB Output is correct
14 Correct 3 ms 3420 KB Output is correct
15 Correct 8 ms 3432 KB Output is correct
16 Correct 7 ms 3420 KB Output is correct
17 Correct 8 ms 3432 KB Output is correct
18 Correct 5 ms 3420 KB Output is correct
19 Correct 6 ms 3420 KB Output is correct
20 Correct 6 ms 3420 KB Output is correct
21 Correct 2 ms 3420 KB Output is correct
22 Correct 2 ms 3420 KB Output is correct
23 Correct 2 ms 3420 KB Output is correct
24 Correct 2 ms 3420 KB Output is correct
25 Correct 2 ms 3420 KB Output is correct
26 Correct 2 ms 3420 KB Output is correct
27 Correct 1 ms 3164 KB Output is correct
28 Correct 2 ms 3420 KB Output is correct
29 Correct 2 ms 3420 KB Output is correct
30 Correct 39 ms 3488 KB Output is correct
31 Correct 51 ms 3472 KB Output is correct
32 Correct 81 ms 3672 KB Output is correct
33 Correct 83 ms 3416 KB Output is correct
34 Correct 80 ms 3500 KB Output is correct
35 Correct 155 ms 3500 KB Output is correct
36 Correct 168 ms 3420 KB Output is correct
37 Correct 168 ms 3496 KB Output is correct
38 Correct 1649 ms 3740 KB Output is correct
39 Correct 1653 ms 3492 KB Output is correct
40 Correct 1658 ms 3492 KB Output is correct
41 Execution timed out 5015 ms 3668 KB Time limit exceeded
42 Halted 0 ms 0 KB -