oj.uz

Submission #889802

# Submission time Handle Problem Language Result Execution time Memory
889802 2023-12-20T07:18:55 Z vjudge1 Tourism (JOI23_tourism) C++17
5 / 100
 5000 ms 11344 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;
		if(a > b)swap(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:107:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  107 | main(){
      | ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 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 5180 KB Output is correct
6 Correct 10 ms 4956 KB Output is correct
7 Correct 14 ms 5172 KB Output is correct
8 Correct 12 ms 4956 KB Output is correct
9 Correct 25 ms 4952 KB Output is correct
10 Correct 25 ms 4956 KB Output is correct
11 Correct 25 ms 5188 KB Output is correct
12 Correct 43 ms 4956 KB Output is correct
13 Correct 39 ms 4956 KB Output is correct
14 Correct 39 ms 4956 KB Output is correct
15 Correct 100 ms 5216 KB Output is correct
16 Correct 92 ms 5212 KB Output is correct
17 Correct 103 ms 5208 KB Output is correct
18 Correct 67 ms 4952 KB Output is correct
19 Correct 73 ms 5212 KB Output is correct
20 Correct 82 ms 5208 KB Output is correct
21 Correct 13 ms 4956 KB Output is correct
22 Correct 13 ms 4956 KB Output is correct
23 Correct 13 ms 4956 KB Output is correct
24 Correct 13 ms 5196 KB Output is correct
25 Correct 13 ms 4956 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 2 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 1 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 5180 KB Output is correct
6 Correct 10 ms 4956 KB Output is correct
7 Correct 14 ms 5172 KB Output is correct
8 Correct 12 ms 4956 KB Output is correct
9 Correct 25 ms 4952 KB Output is correct
10 Correct 25 ms 4956 KB Output is correct
11 Correct 25 ms 5188 KB Output is correct
12 Correct 43 ms 4956 KB Output is correct
13 Correct 39 ms 4956 KB Output is correct
14 Correct 39 ms 4956 KB Output is correct
15 Correct 100 ms 5216 KB Output is correct
16 Correct 92 ms 5212 KB Output is correct
17 Correct 103 ms 5208 KB Output is correct
18 Correct 67 ms 4952 KB Output is correct
19 Correct 73 ms 5212 KB Output is correct
20 Correct 82 ms 5208 KB Output is correct
21 Correct 13 ms 4956 KB Output is correct
22 Correct 13 ms 4956 KB Output is correct
23 Correct 13 ms 4956 KB Output is correct
24 Correct 13 ms 5196 KB Output is correct
25 Correct 13 ms 4956 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 2 ms 4956 KB Output is correct
30 Correct 628 ms 5212 KB Output is correct
31 Correct 853 ms 5308 KB Output is correct
32 Correct 1326 ms 5380 KB Output is correct
33 Correct 1405 ms 5388 KB Output is correct
34 Correct 1368 ms 5612 KB Output is correct
35 Correct 2605 ms 5628 KB Output is correct
36 Correct 2629 ms 5376 KB Output is correct
37 Correct 2725 ms 5376 KB Output is correct
38 Execution timed out 5006 ms 5684 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 2 ms 4956 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Correct 2321 ms 7804 KB Output is correct
5 Correct 1289 ms 8580 KB Output is correct
6 Correct 1550 ms 9148 KB Output is correct
7 Correct 3431 ms 9568 KB Output is correct
8 Correct 3455 ms 9644 KB Output is correct
9 Correct 3447 ms 9548 KB Output is correct
10 Correct 3422 ms 9668 KB Output is correct
11 Correct 3435 ms 9644 KB Output is correct
12 Execution timed out 5075 ms 9376 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

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

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Execution timed out 5085 ms 11344 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 1 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 5180 KB Output is correct
6 Correct 10 ms 4956 KB Output is correct
7 Correct 14 ms 5172 KB Output is correct
8 Correct 12 ms 4956 KB Output is correct
9 Correct 25 ms 4952 KB Output is correct
10 Correct 25 ms 4956 KB Output is correct
11 Correct 25 ms 5188 KB Output is correct
12 Correct 43 ms 4956 KB Output is correct
13 Correct 39 ms 4956 KB Output is correct
14 Correct 39 ms 4956 KB Output is correct
15 Correct 100 ms 5216 KB Output is correct
16 Correct 92 ms 5212 KB Output is correct
17 Correct 103 ms 5208 KB Output is correct
18 Correct 67 ms 4952 KB Output is correct
19 Correct 73 ms 5212 KB Output is correct
20 Correct 82 ms 5208 KB Output is correct
21 Correct 13 ms 4956 KB Output is correct
22 Correct 13 ms 4956 KB Output is correct
23 Correct 13 ms 4956 KB Output is correct
24 Correct 13 ms 5196 KB Output is correct
25 Correct 13 ms 4956 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 2 ms 4956 KB Output is correct
30 Correct 628 ms 5212 KB Output is correct
31 Correct 853 ms 5308 KB Output is correct
32 Correct 1326 ms 5380 KB Output is correct
33 Correct 1405 ms 5388 KB Output is correct
34 Correct 1368 ms 5612 KB Output is correct
35 Correct 2605 ms 5628 KB Output is correct
36 Correct 2629 ms 5376 KB Output is correct
37 Correct 2725 ms 5376 KB Output is correct
38 Execution timed out 5006 ms 5684 KB Time limit exceeded
39 Halted 0 ms 0 KB -