oj.uz

Submission #889796

# Submission time Handle Problem Language Result Execution time Memory
889796 2023-12-20T07:15:06 Z vjudge1 Tourism (JOI23_tourism) C++17
5 / 100
 5000 ms 11476 KB 
#include <bits/stdc++.h>
using namespace std;/*
<<<<It's never too late for a new beginning in your life>>>>
Today is hard
  tomorrow will worse
  but the day after tomorrow will be the sunshine..
 
HARD WORK BEATS TALENT WHEN TALENT DOESN'T WORK HARD............
Never give up  */
//The most CHALISHKANCHIK
#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
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vii;
const long long N = 2e5+50, inf = 1e18, mod = 1e9+7;
vi g[N];
set<pii> mp, jol;
set<int> chk;
void dfs(int pos, int pr){
	if(chk.empty())return;
	if(chk.count(pos) > 0){
		chk.erase(chk.find(pos));
		if(!jol.empty()){
			for(auto i:jol){
				mp.insert(i);
			}
		}
	}
	for(auto to:g[pos]){
		if(to == pr)continue;
		jol.insert({pos, to});
		dfs(to, pos);
		jol.erase(jol.find({pos, to}));
	}
}


void solve(){
	int n, m, q, a, b;
	cin >> n >> m >> q;
	bool ok = 1;
	for(int i = 0; i < n-1; i++){
		cin >> a >> b;
		g[a].push_back(b);
		g[b].push_back(a);
		if(a!=i+1 || b!=i+2)ok = 0;
	}
	int pl[m+1]{};
	for(int i = 1; i <= m; i++){
		cin >> pl[i];
	}
	if(ok){
		while(q--){
			int l, r;
			cin >> l >> r;
			int mn = 1e18;
			int mx = 0;
			for(int i = l; i <= r; i++){
				mx = max(mx, pl[i]);
				mn = min(mn, pl[i]);
			}
			cout << mx-mn+1 << '\n';
		}
	}else{
		while(q--){
			int l, r;
			cin >> l >> r;
			for(int i = l+1; i <= r; i++)chk.insert(pl[i]);
			dfs(pl[l], -1);
			cout << mp.size()+1 << '\n';
			mp.clear();
			//~ queue<pii> q;
			//~ q.push({pl[l], 0});
			//~ int us[n+1]{};
			//~ while(!q.empty()){
				//~ auto [pos, ds] = q.front();
				//~ cout << pos << ' ' << ds << '\n';
				//~ q.pop();
				//~ us[pos] = 1;
				//~ for(auto to:g[pos]){
					//~ if(us[to])continue;
					//~ if(chk.count(to)){
						//~ ans += ds+1;
						//~ ds = 0;
					//~ }
				//~ }
				//~ for(auto to:g[pos]){
					//~ if(us[to])continue;
					
					//~ if(chk.count(to)){
						//~ chk.erase(to);
						//~ q.push({to, 0});
					//~ }else q.push({to, ds+1});
				//~ }
				//~ if(chk.empty())break;
			//~ }
			//~ cout << ans+1 << '\n';
		}
	}
}
main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	int t = 1;
	//~ cin >> t;
	while(t--){
		solve();
	}
}

Compilation message

tourism.cpp:106:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  106 | main(){
      | ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 12 ms 4956 KB Output is correct
5 Correct 13 ms 4956 KB Output is correct
6 Correct 10 ms 4960 KB Output is correct
7 Correct 14 ms 4956 KB Output is correct
8 Correct 12 ms 4956 KB Output is correct
9 Correct 25 ms 4956 KB Output is correct
10 Correct 26 ms 4956 KB Output is correct
11 Correct 25 ms 4956 KB Output is correct
12 Correct 44 ms 4952 KB Output is correct
13 Correct 39 ms 4956 KB Output is correct
14 Correct 39 ms 4952 KB Output is correct
15 Correct 97 ms 5212 KB Output is correct
16 Correct 94 ms 5212 KB Output is correct
17 Correct 99 ms 5232 KB Output is correct
18 Correct 68 ms 4956 KB Output is correct
19 Correct 74 ms 5216 KB Output is correct
20 Correct 85 ms 5212 KB Output is correct
21 Correct 13 ms 5188 KB Output is correct
22 Correct 13 ms 5192 KB Output is correct
23 Correct 13 ms 5184 KB Output is correct
24 Correct 13 ms 4952 KB Output is correct
25 Correct 13 ms 5188 KB Output is correct
26 Correct 13 ms 4952 KB Output is correct
27 Correct 1 ms 4956 KB Output is correct
28 Correct 1 ms 4956 KB Output is correct
29 Correct 1 ms 4956 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 12 ms 4956 KB Output is correct
5 Correct 13 ms 4956 KB Output is correct
6 Correct 10 ms 4960 KB Output is correct
7 Correct 14 ms 4956 KB Output is correct
8 Correct 12 ms 4956 KB Output is correct
9 Correct 25 ms 4956 KB Output is correct
10 Correct 26 ms 4956 KB Output is correct
11 Correct 25 ms 4956 KB Output is correct
12 Correct 44 ms 4952 KB Output is correct
13 Correct 39 ms 4956 KB Output is correct
14 Correct 39 ms 4952 KB Output is correct
15 Correct 97 ms 5212 KB Output is correct
16 Correct 94 ms 5212 KB Output is correct
17 Correct 99 ms 5232 KB Output is correct
18 Correct 68 ms 4956 KB Output is correct
19 Correct 74 ms 5216 KB Output is correct
20 Correct 85 ms 5212 KB Output is correct
21 Correct 13 ms 5188 KB Output is correct
22 Correct 13 ms 5192 KB Output is correct
23 Correct 13 ms 5184 KB Output is correct
24 Correct 13 ms 4952 KB Output is correct
25 Correct 13 ms 5188 KB Output is correct
26 Correct 13 ms 4952 KB Output is correct
27 Correct 1 ms 4956 KB Output is correct
28 Correct 1 ms 4956 KB Output is correct
29 Correct 1 ms 4956 KB Output is correct
30 Correct 655 ms 5568 KB Output is correct
31 Correct 860 ms 5316 KB Output is correct
32 Correct 1358 ms 5208 KB Output is correct
33 Correct 1366 ms 5384 KB Output is correct
34 Correct 1356 ms 5636 KB Output is correct
35 Correct 2498 ms 5392 KB Output is correct
36 Correct 2593 ms 5460 KB Output is correct
37 Correct 2706 ms 5376 KB Output is correct
38 Execution timed out 5022 ms 5688 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5208 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 3 ms 4920 KB Output is correct
4 Correct 2309 ms 7916 KB Output is correct
5 Correct 1262 ms 8584 KB Output is correct
6 Correct 1527 ms 8972 KB Output is correct
7 Correct 3404 ms 9620 KB Output is correct
8 Correct 3519 ms 9644 KB Output is correct
9 Correct 3640 ms 9632 KB Output is correct
10 Correct 3413 ms 9672 KB Output is correct
11 Correct 3474 ms 9644 KB Output is correct
12 Execution timed out 5041 ms 9472 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Execution timed out 5034 ms 7636 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 4 ms 5168 KB Output is correct
4 Execution timed out 5062 ms 11476 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 12 ms 4956 KB Output is correct
5 Correct 13 ms 4956 KB Output is correct
6 Correct 10 ms 4960 KB Output is correct
7 Correct 14 ms 4956 KB Output is correct
8 Correct 12 ms 4956 KB Output is correct
9 Correct 25 ms 4956 KB Output is correct
10 Correct 26 ms 4956 KB Output is correct
11 Correct 25 ms 4956 KB Output is correct
12 Correct 44 ms 4952 KB Output is correct
13 Correct 39 ms 4956 KB Output is correct
14 Correct 39 ms 4952 KB Output is correct
15 Correct 97 ms 5212 KB Output is correct
16 Correct 94 ms 5212 KB Output is correct
17 Correct 99 ms 5232 KB Output is correct
18 Correct 68 ms 4956 KB Output is correct
19 Correct 74 ms 5216 KB Output is correct
20 Correct 85 ms 5212 KB Output is correct
21 Correct 13 ms 5188 KB Output is correct
22 Correct 13 ms 5192 KB Output is correct
23 Correct 13 ms 5184 KB Output is correct
24 Correct 13 ms 4952 KB Output is correct
25 Correct 13 ms 5188 KB Output is correct
26 Correct 13 ms 4952 KB Output is correct
27 Correct 1 ms 4956 KB Output is correct
28 Correct 1 ms 4956 KB Output is correct
29 Correct 1 ms 4956 KB Output is correct
30 Correct 655 ms 5568 KB Output is correct
31 Correct 860 ms 5316 KB Output is correct
32 Correct 1358 ms 5208 KB Output is correct
33 Correct 1366 ms 5384 KB Output is correct
34 Correct 1356 ms 5636 KB Output is correct
35 Correct 2498 ms 5392 KB Output is correct
36 Correct 2593 ms 5460 KB Output is correct
37 Correct 2706 ms 5376 KB Output is correct
38 Execution timed out 5022 ms 5688 KB Time limit exceeded
39 Halted 0 ms 0 KB -