oj.uz

Submission #889604

# Submission time Handle Problem Language Result Execution time Memory
889604 2023-12-20T03:44:27 Z vjudge1 Tourism (JOI23_tourism) C++17
17 / 100
 85 ms 16556 KB 
#include <bits/stdc++.h>
#define ll long long
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define bc back()
#define ar array
#define vll vector<ll> 
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <class _T>
bool chmin(_T &x, const _T &y){
    if(x>y){
        x=y;
        return true;
    }
    return false;
}
template <class _T>
bool chmax(_T &x, const _T &y){
    bool flag=false;
    if (x<y){
        x=y;flag|=true;
    }
    return flag;
}
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const ll inf=2e18+7;
const ll mod=1e9+7;
const ll N=1e5+7;
const ld eps=1e-9;
vector<vll> g(N);
vector<pair<ll,ll>> t(N*4,{inf,0});
ll val[N];
void build(ll v,ll tl,ll tr){
	if(tl==tr){
		t[v]={val[tl],val[tl]};
		return;
	}
	ll tm=(tl+tr)/2;
	build(v*2,tl,tm);
	build(v*2+1,tm+1,tr);
	t[v]={min(t[v*2].fr,t[v*2+1].fr),max(t[v*2].sc,t[v*2+1].sc)};
}

pair<ll,ll> get(ll v,ll tl,ll tr,ll l,ll r){
	if(tl>r || tr<l)return {inf,0ll};
	if(l<=tl && tr<=r) return t[v];
	ll tm=(tl+tr)/2;
	pair<ll,ll> a=get(v*2,tl,tm,l,r);
	pair<ll,ll> b=get(v*2+1,tm+1,tr,l,r);
	return {min(a.fr,b.fr),max(a.sc,b.sc)};
}

bool f[2005];
ll dfs(ll v,ll p){
	ll sum=0;
	for(auto i : g[v]){
		if(i==p)continue;
		sum+=dfs(i,v);
	}
	if(f[v] || sum) return sum+1;
	return sum;
}
void solve(){
	ll i,j;
	ll n,m,q;
	ll a,b;
	cin>>n>>m>>q;
	bool line=true,bint=true;
	//bool flag=true;
	for(i=1;i<n;i++){
		cin>>a>>b;
		if(a>b)swap(a,b);
		if(b-a!=1)line=false;
		if(b/2!=a)bint=false;
		g[a].pb(b);
		g[b].pb(a);
	}
	vector<ll> s(m+1);
	for(i=1;i<=m;i++)cin>>s[i];
	if(n<=2000 && m<=2000 && q<=2000){
		for(i=1;i<=q;i++){
			memset(f,false,sizeof(f));
			cin>>a>>b;
			for(j=a;j<=b;j++)f[s[j]]=true;
			cout<<dfs(s[a],0)<<endl;
		}
		return;
	}
	if(line){
		for(i=1;i<=m;i++)val[i]=s[i];
		build(1,1,m);
		for(i=0;i<q;i++){
			cin>>a>>b;
			pair<ll,ll> x=get(1,1,m,a,b);
			cout<<x.sc-x.fr+1<<endl;
		}
		return;
	}
	if(bint){
		
		return;
	}
	
}
signed main(){
	start();
    ll t=1;
	//cin>>t;
    while(t--) solve();
    return 0;
}
/*
1
6
5 4 3 2 1 0





*/

Compilation message

tourism.cpp: In function 'void fre(std::string)':
tourism.cpp:42:27: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 | void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
tourism.cpp:42:64: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 | void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                                                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9052 KB Output is correct
2 Correct 3 ms 9052 KB Output is correct
3 Correct 3 ms 8964 KB Output is correct
4 Correct 3 ms 9052 KB Output is correct
5 Correct 3 ms 9052 KB Output is correct
6 Correct 4 ms 9048 KB Output is correct
7 Correct 3 ms 9052 KB Output is correct
8 Correct 3 ms 9052 KB Output is correct
9 Correct 3 ms 9104 KB Output is correct
10 Correct 3 ms 9048 KB Output is correct
11 Correct 4 ms 9052 KB Output is correct
12 Correct 4 ms 9048 KB Output is correct
13 Correct 3 ms 9052 KB Output is correct
14 Correct 3 ms 9052 KB Output is correct
15 Correct 4 ms 9048 KB Output is correct
16 Correct 4 ms 9052 KB Output is correct
17 Correct 4 ms 9048 KB Output is correct
18 Correct 3 ms 9052 KB Output is correct
19 Correct 4 ms 9052 KB Output is correct
20 Correct 4 ms 9052 KB Output is correct
21 Correct 3 ms 9052 KB Output is correct
22 Correct 3 ms 9048 KB Output is correct
23 Correct 3 ms 9048 KB Output is correct
24 Correct 3 ms 9052 KB Output is correct
25 Correct 3 ms 9052 KB Output is correct
26 Correct 3 ms 9052 KB Output is correct
27 Correct 3 ms 9052 KB Output is correct
28 Correct 3 ms 9052 KB Output is correct
29 Correct 3 ms 8952 KB Output is correct
30 Correct 31 ms 9052 KB Output is correct
31 Correct 36 ms 9052 KB Output is correct
32 Correct 54 ms 9052 KB Output is correct
33 Correct 55 ms 9052 KB Output is correct
34 Correct 55 ms 9052 KB Output is correct
35 Correct 29 ms 9172 KB Output is correct
36 Correct 28 ms 9052 KB Output is correct
37 Correct 28 ms 9052 KB Output is correct
38 Correct 47 ms 9300 KB Output is correct
39 Correct 43 ms 9048 KB Output is correct
40 Correct 44 ms 9052 KB Output is correct
41 Correct 39 ms 9052 KB Output is correct
42 Correct 37 ms 9048 KB Output is correct
43 Correct 39 ms 9052 KB Output is correct
44 Correct 44 ms 9204 KB Output is correct
45 Correct 47 ms 9448 KB Output is correct
46 Correct 44 ms 9052 KB Output is correct
47 Correct 38 ms 9052 KB Output is correct
48 Correct 38 ms 9048 KB Output is correct
49 Correct 38 ms 9048 KB Output is correct
50 Correct 24 ms 9184 KB Output is correct
51 Correct 24 ms 9052 KB Output is correct
52 Correct 24 ms 9048 KB Output is correct
53 Correct 23 ms 9188 KB Output is correct
54 Correct 27 ms 9168 KB Output is correct
55 Correct 24 ms 9052 KB Output is correct
56 Correct 4 ms 9052 KB Output is correct
57 Correct 24 ms 9052 KB Output is correct
58 Correct 25 ms 9052 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9052 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 4 ms 9104 KB Output is correct
4 Correct 55 ms 12624 KB Output is correct
5 Correct 52 ms 14172 KB Output is correct
6 Correct 53 ms 14984 KB Output is correct
7 Correct 76 ms 16476 KB Output is correct
8 Correct 76 ms 16468 KB Output is correct
9 Correct 77 ms 16468 KB Output is correct
10 Correct 85 ms 16352 KB Output is correct
11 Correct 76 ms 16380 KB Output is correct
12 Correct 70 ms 16468 KB Output is correct
13 Correct 67 ms 16468 KB Output is correct
14 Correct 73 ms 16556 KB Output is correct
15 Correct 34 ms 13568 KB Output is correct
16 Correct 61 ms 15860 KB Output is correct
17 Correct 55 ms 11860 KB Output is correct

Subtask #4
0 / 18.0

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

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9052 KB Output is correct
2 Correct 3 ms 9052 KB Output is correct
3 Correct 3 ms 9048 KB Output is correct
4 Incorrect 18 ms 11864 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9052 KB Output is correct
2 Correct 3 ms 9052 KB Output is correct
3 Correct 3 ms 8964 KB Output is correct
4 Correct 3 ms 9052 KB Output is correct
5 Correct 3 ms 9052 KB Output is correct
6 Correct 4 ms 9048 KB Output is correct
7 Correct 3 ms 9052 KB Output is correct
8 Correct 3 ms 9052 KB Output is correct
9 Correct 3 ms 9104 KB Output is correct
10 Correct 3 ms 9048 KB Output is correct
11 Correct 4 ms 9052 KB Output is correct
12 Correct 4 ms 9048 KB Output is correct
13 Correct 3 ms 9052 KB Output is correct
14 Correct 3 ms 9052 KB Output is correct
15 Correct 4 ms 9048 KB Output is correct
16 Correct 4 ms 9052 KB Output is correct
17 Correct 4 ms 9048 KB Output is correct
18 Correct 3 ms 9052 KB Output is correct
19 Correct 4 ms 9052 KB Output is correct
20 Correct 4 ms 9052 KB Output is correct
21 Correct 3 ms 9052 KB Output is correct
22 Correct 3 ms 9048 KB Output is correct
23 Correct 3 ms 9048 KB Output is correct
24 Correct 3 ms 9052 KB Output is correct
25 Correct 3 ms 9052 KB Output is correct
26 Correct 3 ms 9052 KB Output is correct
27 Correct 3 ms 9052 KB Output is correct
28 Correct 3 ms 9052 KB Output is correct
29 Correct 3 ms 8952 KB Output is correct
30 Correct 31 ms 9052 KB Output is correct
31 Correct 36 ms 9052 KB Output is correct
32 Correct 54 ms 9052 KB Output is correct
33 Correct 55 ms 9052 KB Output is correct
34 Correct 55 ms 9052 KB Output is correct
35 Correct 29 ms 9172 KB Output is correct
36 Correct 28 ms 9052 KB Output is correct
37 Correct 28 ms 9052 KB Output is correct
38 Correct 47 ms 9300 KB Output is correct
39 Correct 43 ms 9048 KB Output is correct
40 Correct 44 ms 9052 KB Output is correct
41 Correct 39 ms 9052 KB Output is correct
42 Correct 37 ms 9048 KB Output is correct
43 Correct 39 ms 9052 KB Output is correct
44 Correct 44 ms 9204 KB Output is correct
45 Correct 47 ms 9448 KB Output is correct
46 Correct 44 ms 9052 KB Output is correct
47 Correct 38 ms 9052 KB Output is correct
48 Correct 38 ms 9048 KB Output is correct
49 Correct 38 ms 9048 KB Output is correct
50 Correct 24 ms 9184 KB Output is correct
51 Correct 24 ms 9052 KB Output is correct
52 Correct 24 ms 9048 KB Output is correct
53 Correct 23 ms 9188 KB Output is correct
54 Correct 27 ms 9168 KB Output is correct
55 Correct 24 ms 9052 KB Output is correct
56 Correct 4 ms 9052 KB Output is correct
57 Correct 24 ms 9052 KB Output is correct
58 Correct 25 ms 9052 KB Output is correct
59 Correct 3 ms 9052 KB Output is correct
60 Correct 2 ms 9052 KB Output is correct
61 Correct 4 ms 9104 KB Output is correct
62 Correct 55 ms 12624 KB Output is correct
63 Correct 52 ms 14172 KB Output is correct
64 Correct 53 ms 14984 KB Output is correct
65 Correct 76 ms 16476 KB Output is correct
66 Correct 76 ms 16468 KB Output is correct
67 Correct 77 ms 16468 KB Output is correct
68 Correct 85 ms 16352 KB Output is correct
69 Correct 76 ms 16380 KB Output is correct
70 Correct 70 ms 16468 KB Output is correct
71 Correct 67 ms 16468 KB Output is correct
72 Correct 73 ms 16556 KB Output is correct
73 Correct 34 ms 13568 KB Output is correct
74 Correct 61 ms 15860 KB Output is correct
75 Correct 55 ms 11860 KB Output is correct
76 Correct 3 ms 9048 KB Output is correct
77 Incorrect 18 ms 11380 KB Output isn't correct
78 Halted 0 ms 0 KB -