oj.uz

Submission #889753

# Submission time Handle Problem Language Result Execution time Memory
889753 2023-12-20T06:52:54 Z vjudge1 Tourism (JOI23_tourism) C++17
5 / 100
 5000 ms 14684 KB 
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

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

using namespace __gnu_pbds;
using namespace std;

const int N = 1e5 * 4;

#define pb push_back

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

void solve(){
	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";
		}
	}
}

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

	int t = 1;
//	cin >> t;
	while(t--){
		solve();
	}
    
}

Compilation message

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 3 ms 12728 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 3 ms 12636 KB Output is correct
5 Correct 3 ms 12636 KB Output is correct
6 Correct 3 ms 12636 KB Output is correct
7 Correct 3 ms 12636 KB Output is correct
8 Correct 3 ms 12636 KB Output is correct
9 Correct 4 ms 12636 KB Output is correct
10 Correct 4 ms 12636 KB Output is correct
11 Correct 4 ms 12636 KB Output is correct
12 Correct 5 ms 12828 KB Output is correct
13 Correct 5 ms 12636 KB Output is correct
14 Correct 5 ms 12636 KB Output is correct
15 Correct 9 ms 12824 KB Output is correct
16 Correct 9 ms 12636 KB Output is correct
17 Correct 9 ms 12824 KB Output is correct
18 Correct 6 ms 12632 KB Output is correct
19 Correct 7 ms 12636 KB Output is correct
20 Correct 8 ms 12636 KB Output is correct
21 Correct 3 ms 12832 KB Output is correct
22 Correct 3 ms 12732 KB Output is correct
23 Correct 3 ms 12828 KB Output is correct
24 Correct 3 ms 12636 KB Output is correct
25 Correct 3 ms 12636 KB Output is correct
26 Correct 3 ms 12636 KB Output is correct
27 Correct 2 ms 12632 KB Output is correct
28 Correct 3 ms 12636 KB Output is correct
29 Correct 3 ms 12636 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 3 ms 12728 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 3 ms 12636 KB Output is correct
5 Correct 3 ms 12636 KB Output is correct
6 Correct 3 ms 12636 KB Output is correct
7 Correct 3 ms 12636 KB Output is correct
8 Correct 3 ms 12636 KB Output is correct
9 Correct 4 ms 12636 KB Output is correct
10 Correct 4 ms 12636 KB Output is correct
11 Correct 4 ms 12636 KB Output is correct
12 Correct 5 ms 12828 KB Output is correct
13 Correct 5 ms 12636 KB Output is correct
14 Correct 5 ms 12636 KB Output is correct
15 Correct 9 ms 12824 KB Output is correct
16 Correct 9 ms 12636 KB Output is correct
17 Correct 9 ms 12824 KB Output is correct
18 Correct 6 ms 12632 KB Output is correct
19 Correct 7 ms 12636 KB Output is correct
20 Correct 8 ms 12636 KB Output is correct
21 Correct 3 ms 12832 KB Output is correct
22 Correct 3 ms 12732 KB Output is correct
23 Correct 3 ms 12828 KB Output is correct
24 Correct 3 ms 12636 KB Output is correct
25 Correct 3 ms 12636 KB Output is correct
26 Correct 3 ms 12636 KB Output is correct
27 Correct 2 ms 12632 KB Output is correct
28 Correct 3 ms 12636 KB Output is correct
29 Correct 3 ms 12636 KB Output is correct
30 Correct 42 ms 12632 KB Output is correct
31 Correct 56 ms 12876 KB Output is correct
32 Correct 84 ms 12892 KB Output is correct
33 Correct 86 ms 12900 KB Output is correct
34 Correct 82 ms 12892 KB Output is correct
35 Correct 160 ms 12900 KB Output is correct
36 Correct 166 ms 12896 KB Output is correct
37 Correct 169 ms 12888 KB Output is correct
38 Correct 1651 ms 13136 KB Output is correct
39 Correct 1653 ms 12896 KB Output is correct
40 Correct 1657 ms 12892 KB Output is correct
41 Execution timed out 5017 ms 12892 KB Time limit exceeded
42 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

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

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Incorrect 18 ms 14680 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 4 ms 12636 KB Output is correct
4 Incorrect 19 ms 14480 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 3 ms 12728 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 3 ms 12636 KB Output is correct
5 Correct 3 ms 12636 KB Output is correct
6 Correct 3 ms 12636 KB Output is correct
7 Correct 3 ms 12636 KB Output is correct
8 Correct 3 ms 12636 KB Output is correct
9 Correct 4 ms 12636 KB Output is correct
10 Correct 4 ms 12636 KB Output is correct
11 Correct 4 ms 12636 KB Output is correct
12 Correct 5 ms 12828 KB Output is correct
13 Correct 5 ms 12636 KB Output is correct
14 Correct 5 ms 12636 KB Output is correct
15 Correct 9 ms 12824 KB Output is correct
16 Correct 9 ms 12636 KB Output is correct
17 Correct 9 ms 12824 KB Output is correct
18 Correct 6 ms 12632 KB Output is correct
19 Correct 7 ms 12636 KB Output is correct
20 Correct 8 ms 12636 KB Output is correct
21 Correct 3 ms 12832 KB Output is correct
22 Correct 3 ms 12732 KB Output is correct
23 Correct 3 ms 12828 KB Output is correct
24 Correct 3 ms 12636 KB Output is correct
25 Correct 3 ms 12636 KB Output is correct
26 Correct 3 ms 12636 KB Output is correct
27 Correct 2 ms 12632 KB Output is correct
28 Correct 3 ms 12636 KB Output is correct
29 Correct 3 ms 12636 KB Output is correct
30 Correct 42 ms 12632 KB Output is correct
31 Correct 56 ms 12876 KB Output is correct
32 Correct 84 ms 12892 KB Output is correct
33 Correct 86 ms 12900 KB Output is correct
34 Correct 82 ms 12892 KB Output is correct
35 Correct 160 ms 12900 KB Output is correct
36 Correct 166 ms 12896 KB Output is correct
37 Correct 169 ms 12888 KB Output is correct
38 Correct 1651 ms 13136 KB Output is correct
39 Correct 1653 ms 12896 KB Output is correct
40 Correct 1657 ms 12892 KB Output is correct
41 Execution timed out 5017 ms 12892 KB Time limit exceeded
42 Halted 0 ms 0 KB -