oj.uz

Submission #553745

# Submission time Handle Problem Language Result Execution time Memory
553745 2022-04-26T18:25:27 Z new_acc Cat in a tree (BOI17_catinatree) C++14
100 / 100
 103 ms 29724 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define pitem item*
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=2e5+10;
const int SS=1<<19;
const int INFi=2e9;
const ll INFl=1e13;
const ll mod2=998244353;
const ll mod=1e9+7;
const ll mod3=1000696969;
const ll p=70032301;
const ull p2=913;
const int L=20;
vi graf[N];
pair<int,int> dp[N];
int n,k;
void dfs(int v,int o){
	vector<pair<int,int> >curr;
	int aktsum=0;
	for(auto u:graf[v]){
		if(u==o) continue;
		dfs(u,v);
		curr.push_back({dp[u].se,dp[u].fi});
		aktsum+=dp[u].fi;
	}
	sort(curr.begin(),curr.end());
	auto bs=[&](int pocz,int kon,int x){
		int sr,res=pocz;
		pocz++;
		while(pocz<=kon){
			sr=(pocz+kon)>>1;
			if(curr[sr].fi+x+2<k) res=sr,pocz=sr+1;
			else kon=sr-1;
		}
		return res;	
	};
	dp[v].fi=0;
	for(int i=0;i<curr.size();i++){
		pair<int,int> akt;
		akt.fi=aktsum-i-(bs(i,curr.size()-1,curr[i].fi)-i);
		akt.se=curr[i].fi+1;
		if(akt.fi>dp[v].fi or (akt.fi==dp[v].fi and akt.se>dp[v].se)) dp[v]=akt;
	}
	for(auto u:graf[v]){
		if(u==o) continue;
		if(dp[u].se!=k-1) aktsum--;
	}
	aktsum++;
	if(aktsum>dp[v].fi) dp[v]={aktsum,0};
}
void solve(){
	cin>>n>>k;
	for(int a,i=2;i<=n;i++){
		cin>>a;
		a++;
		graf[i].push_back(a),graf[a].push_back(i);
	}
	dfs(1,1);
	cout<<dp[1].fi<<"\n";
}
int main(){
	ios_base::sync_with_stdio(0),cin.tie(0);
	solve();
}

Compilation message

catinatree.cpp: In function 'void dfs(int, int)':
catinatree.cpp:44:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |  for(int i=0;i<curr.size();i++){
      |              ~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 5020 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 5020 KB Output is correct
21 Correct 3 ms 5204 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 5024 KB Output is correct
28 Correct 3 ms 5032 KB Output is correct
29 Correct 3 ms 5028 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 3 ms 5024 KB Output is correct
32 Correct 3 ms 5076 KB Output is correct
33 Correct 3 ms 5024 KB Output is correct
34 Correct 3 ms 5024 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 3 ms 5032 KB Output is correct
38 Correct 3 ms 5028 KB Output is correct
39 Correct 3 ms 5204 KB Output is correct
40 Correct 3 ms 5204 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 5020 KB Output is correct
21 Correct 3 ms 5204 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 5024 KB Output is correct
28 Correct 3 ms 5032 KB Output is correct
29 Correct 3 ms 5028 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 3 ms 5024 KB Output is correct
32 Correct 3 ms 5076 KB Output is correct
33 Correct 3 ms 5024 KB Output is correct
34 Correct 3 ms 5024 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 3 ms 5032 KB Output is correct
38 Correct 3 ms 5028 KB Output is correct
39 Correct 3 ms 5204 KB Output is correct
40 Correct 3 ms 5204 KB Output is correct
41 Correct 54 ms 14276 KB Output is correct
42 Correct 33 ms 9568 KB Output is correct
43 Correct 35 ms 9572 KB Output is correct
44 Correct 34 ms 9456 KB Output is correct
45 Correct 33 ms 9540 KB Output is correct
46 Correct 88 ms 14204 KB Output is correct
47 Correct 97 ms 14164 KB Output is correct
48 Correct 96 ms 14156 KB Output is correct
49 Correct 88 ms 14096 KB Output is correct
50 Correct 25 ms 9788 KB Output is correct
51 Correct 25 ms 9768 KB Output is correct
52 Correct 23 ms 9748 KB Output is correct
53 Correct 52 ms 14584 KB Output is correct
54 Correct 60 ms 14636 KB Output is correct
55 Correct 54 ms 14700 KB Output is correct
56 Correct 4 ms 5256 KB Output is correct
57 Correct 9 ms 9044 KB Output is correct
58 Correct 35 ms 23480 KB Output is correct
59 Correct 103 ms 29724 KB Output is correct
60 Correct 57 ms 14540 KB Output is correct
61 Correct 60 ms 13608 KB Output is correct