Submission #890040

# Submission time Handle Problem Language Result Execution time Memory
890040 2023-12-20T11:32:25 Z vjudge1 Tourism (JOI23_tourism) C++17
10 / 100
60 ms 1108 KB
#include <bits/stdc++.h>
 
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
 
using namespace std;

void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} 
int pow(int a,int b,int m){int ans=1;while(b){if(b&1){ans=(ans*a)%m;}b>>=1;a=(a*a)%m;}return ans;}
int binpow(int a,int b){int ans=1;while(b){if(b&1){ans=(ans*a);}b>>=1;a=(a*a);}return ans;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int N = 2e3 + 100, inf = 1e18, M = 4e3;

int parn[N];

vector <int> g[N];


void dfs(int v, int p){
	parn[v] = p;
	for(auto to : g[v]){
		if(to != p){
			dfs(to, v);
		}
	}
}

main(){
	iostream::sync_with_stdio(false);	
    cin.tie(nullptr);
    cout.tie(nullptr);
	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);
	}
	vector <int> c(m + 1);
	for(int i = 1; i <= m; i++){
		cin >> c[i];
	}
	for(int i = 0; i < q; i++){
		int l, r;
		cin >> l >> r;
		dfs(c[l], c[l]);
		vector <int> vis(n + 1);
		int ans = 0;
		for(int j = l; j <= r; j++){
			int x = c[j];
			
			while(!vis[x]){
				vis[x] = 1;
				ans++;
				x = parn[x];
			}
		}
		cout << ans << endl;
	}
}

/*
	Before implementing the problem:
	
	Do I understand the problem correctly?
	Which places are tricky? What do I need to remember to implement them correctly?
	Which place is the heaviest by implementation? Can I do it simpler?
	Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
	----------------------------------
	If not AC:
 
	Did you remember to do everything to handle the tricky places you thought about before?
	Is the solution correct?
	Do I understand the problem correctly?
	----------------------------------
	If you have a test on which the solution gives wrong answer:
 
	Is the solution doing what it was supposed to do?
	Is the problem in the code or in the idea?
*/

Compilation message

tourism.cpp:34:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   34 | main(){
      | ^~~~
tourism.cpp: In function 'void fp(std::string)':
tourism.cpp:13:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
tourism.cpp:13:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 516 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 516 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 27 ms 604 KB Output is correct
31 Correct 34 ms 604 KB Output is correct
32 Correct 56 ms 756 KB Output is correct
33 Correct 57 ms 600 KB Output is correct
34 Correct 56 ms 604 KB Output is correct
35 Correct 53 ms 604 KB Output is correct
36 Correct 60 ms 860 KB Output is correct
37 Correct 54 ms 600 KB Output is correct
38 Correct 47 ms 604 KB Output is correct
39 Correct 43 ms 716 KB Output is correct
40 Correct 48 ms 724 KB Output is correct
41 Correct 55 ms 600 KB Output is correct
42 Correct 47 ms 604 KB Output is correct
43 Correct 45 ms 716 KB Output is correct
44 Correct 44 ms 688 KB Output is correct
45 Correct 45 ms 604 KB Output is correct
46 Correct 44 ms 600 KB Output is correct
47 Correct 48 ms 864 KB Output is correct
48 Correct 46 ms 600 KB Output is correct
49 Correct 46 ms 672 KB Output is correct
50 Correct 20 ms 600 KB Output is correct
51 Correct 24 ms 604 KB Output is correct
52 Correct 21 ms 684 KB Output is correct
53 Correct 21 ms 604 KB Output is correct
54 Correct 26 ms 1108 KB Output is correct
55 Correct 21 ms 604 KB Output is correct
56 Correct 4 ms 344 KB Output is correct
57 Correct 27 ms 520 KB Output is correct
58 Correct 41 ms 600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Runtime error 1 ms 860 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 0 ms 604 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Runtime error 1 ms 860 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 516 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 27 ms 604 KB Output is correct
31 Correct 34 ms 604 KB Output is correct
32 Correct 56 ms 756 KB Output is correct
33 Correct 57 ms 600 KB Output is correct
34 Correct 56 ms 604 KB Output is correct
35 Correct 53 ms 604 KB Output is correct
36 Correct 60 ms 860 KB Output is correct
37 Correct 54 ms 600 KB Output is correct
38 Correct 47 ms 604 KB Output is correct
39 Correct 43 ms 716 KB Output is correct
40 Correct 48 ms 724 KB Output is correct
41 Correct 55 ms 600 KB Output is correct
42 Correct 47 ms 604 KB Output is correct
43 Correct 45 ms 716 KB Output is correct
44 Correct 44 ms 688 KB Output is correct
45 Correct 45 ms 604 KB Output is correct
46 Correct 44 ms 600 KB Output is correct
47 Correct 48 ms 864 KB Output is correct
48 Correct 46 ms 600 KB Output is correct
49 Correct 46 ms 672 KB Output is correct
50 Correct 20 ms 600 KB Output is correct
51 Correct 24 ms 604 KB Output is correct
52 Correct 21 ms 684 KB Output is correct
53 Correct 21 ms 604 KB Output is correct
54 Correct 26 ms 1108 KB Output is correct
55 Correct 21 ms 604 KB Output is correct
56 Correct 4 ms 344 KB Output is correct
57 Correct 27 ms 520 KB Output is correct
58 Correct 41 ms 600 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 4 ms 348 KB Output is correct
62 Runtime error 1 ms 860 KB Execution killed with signal 11
63 Halted 0 ms 0 KB -