oj.uz

Submission #71601

# Submission time Handle Problem Language Result Execution time Memory
71601 2018-08-25T08:21:08 Z algorithm16 Paprike (COI18_paprike) C++14
100 / 100
 319 ms 100676 KB 
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long int llint;
llint parent[3000000],brojac=0,b1=0;
vector <llint> c[3000000];
llint sum[3000000];
vector <llint> v;
llint n,k;
llint dfs(llint x) {
	vector <llint> v2;
	llint mini=10000000,b2=0,b3=0,b4=0,b5=0,sum3=0;
	for(llint i=0;i<c[x].size();i++) {
		if(parent[x]==c[x][i]) continue;
		//cout <<x<<" "<<c[x][i]<<endl;
		//sum2+=sum[c[x][i]];
		/*if(mini==-1) mini=dfs(c[x][i],brojac2,x);
		else if(dfs(c[x][i],brojac2,x)<mini) mini=dfs(c[x][i],brojac2,x);*/
		//cout <<x<<" "<<dfs(c[x][i],0)<<endl;
		int sum2=dfs(c[x][i]);
		sum3+=sum2;
		/*if(sum2+v[x]>k) {
			b2+=1;
			//b1+=sum2;
			//sum[x]-=b1;
			//cout <<v[x]<<" "<<sum2<<" "<<"uvjet1"<<endl;
			brojac+=1;
			sum[x]-=sum2;
		}
		else {
			v.push_back()
			b4+=sum2;
			b3+=sum2;
			b5+=1;
			if(sum2<mini) mini=sum2;
		}*/
		v2.push_back(sum2);
	}
	/*b4-=mini;
	llint s=c[x].size();
	if(s-b2-1>1) {
		//cout <<v[x]<<" "<<s-b2-1<<" "<<"uvjet2"<<endl;
		b3-=b4;
		//b1+=maxi;
		brojac+=b5-1;
	}
	else if(x==0 && s-b2>1) {
		//cout <<v[x]<<" "<<s-b2-1<<" "<<"uvjet2"<<endl;
		b3-=b4;
		//b1+=maxi;
		brojac+=1;
	}
	//if(x==0) cout <<b3<<" "<<maxi<<endl;
	sum[x]=v[x]+b3;
	//sum[x]-=b1;*/
	sum3+=v[x];
	int index=v2.size()-1;
	sort(v2.begin(),v2.end());
	while(sum3>k) {
		sum3-=v2[index];
		index-=1;
		brojac+=1;
	}
	return sum3;
}
void dfs2(llint x,llint par) {
	parent[x]=par;
	for(llint i=0;i<c[x].size();i++) {
		if(c[x][i]==par) continue;
		dfs2(c[x][i],x);
		//sum[x]+=sum[c[x][i]];
	}
	//sum[x]+=v[x];
}
int main()
{
	cin >> n >> k;
	vector <pair<llint,llint> > y;
	for(int i=0;i<n;i++) {
		llint x;
		cin >> x;
		v.push_back(x);
	}
	for(llint i=0;i<n-1;i++) {
		llint a,b;
		cin >> a >> b;
		y.push_back(make_pair(a-1,b-1));
		c[a-1].push_back(b-1);
		c[b-1].push_back(a-1);
	}
	dfs2(0,-1);
	dfs(0);
	/*for(int i=0;i<n;i++) {
		cout <<sum[i]<<" ";
	}
	cout <<endl;*/
	cout <<brojac;
	return 0;
}

Compilation message

paprike.cpp: In function 'llint dfs(llint)':
paprike.cpp:14:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(llint i=0;i<c[x].size();i++) {
                ~^~~~~~~~~~~~
paprike.cpp:13:8: warning: unused variable 'mini' [-Wunused-variable]
  llint mini=10000000,b2=0,b3=0,b4=0,b5=0,sum3=0;
        ^~~~
paprike.cpp:13:22: warning: unused variable 'b2' [-Wunused-variable]
  llint mini=10000000,b2=0,b3=0,b4=0,b5=0,sum3=0;
                      ^~
paprike.cpp:13:27: warning: unused variable 'b3' [-Wunused-variable]
  llint mini=10000000,b2=0,b3=0,b4=0,b5=0,sum3=0;
                           ^~
paprike.cpp:13:32: warning: unused variable 'b4' [-Wunused-variable]
  llint mini=10000000,b2=0,b3=0,b4=0,b5=0,sum3=0;
                                ^~
paprike.cpp:13:37: warning: unused variable 'b5' [-Wunused-variable]
  llint mini=10000000,b2=0,b3=0,b4=0,b5=0,sum3=0;
                                     ^~
paprike.cpp: In function 'void dfs2(llint, llint)':
paprike.cpp:69:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(llint i=0;i<c[x].size();i++) {
                ~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 70776 KB Output is correct
2 Correct 67 ms 70884 KB Output is correct
3 Correct 66 ms 70884 KB Output is correct
4 Correct 74 ms 70964 KB Output is correct
5 Correct 73 ms 70964 KB Output is correct
6 Correct 72 ms 71240 KB Output is correct
7 Correct 69 ms 71240 KB Output is correct
8 Correct 64 ms 71240 KB Output is correct
9 Correct 65 ms 71240 KB Output is correct
10 Correct 70 ms 71240 KB Output is correct
11 Correct 65 ms 71240 KB Output is correct
12 Correct 64 ms 71240 KB Output is correct
13 Correct 64 ms 71240 KB Output is correct
14 Correct 77 ms 71240 KB Output is correct
15 Correct 62 ms 71240 KB Output is correct
16 Correct 69 ms 71240 KB Output is correct
17 Correct 71 ms 71240 KB Output is correct
18 Correct 64 ms 71240 KB Output is correct
19 Correct 64 ms 71268 KB Output is correct
20 Correct 65 ms 71308 KB Output is correct
21 Correct 64 ms 71336 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 88560 KB Output is correct
2 Correct 210 ms 88560 KB Output is correct
3 Correct 226 ms 88560 KB Output is correct
4 Correct 221 ms 88616 KB Output is correct
5 Correct 239 ms 88616 KB Output is correct
6 Correct 227 ms 88676 KB Output is correct
7 Correct 317 ms 88676 KB Output is correct
8 Correct 194 ms 88676 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 70776 KB Output is correct
2 Correct 67 ms 70884 KB Output is correct
3 Correct 66 ms 70884 KB Output is correct
4 Correct 74 ms 70964 KB Output is correct
5 Correct 73 ms 70964 KB Output is correct
6 Correct 72 ms 71240 KB Output is correct
7 Correct 69 ms 71240 KB Output is correct
8 Correct 64 ms 71240 KB Output is correct
9 Correct 65 ms 71240 KB Output is correct
10 Correct 70 ms 71240 KB Output is correct
11 Correct 65 ms 71240 KB Output is correct
12 Correct 64 ms 71240 KB Output is correct
13 Correct 64 ms 71240 KB Output is correct
14 Correct 77 ms 71240 KB Output is correct
15 Correct 62 ms 71240 KB Output is correct
16 Correct 69 ms 71240 KB Output is correct
17 Correct 71 ms 71240 KB Output is correct
18 Correct 64 ms 71240 KB Output is correct
19 Correct 64 ms 71268 KB Output is correct
20 Correct 65 ms 71308 KB Output is correct
21 Correct 64 ms 71336 KB Output is correct
22 Correct 70 ms 88676 KB Output is correct
23 Correct 62 ms 88676 KB Output is correct
24 Correct 71 ms 88676 KB Output is correct
25 Correct 75 ms 88676 KB Output is correct
26 Correct 79 ms 88676 KB Output is correct
27 Correct 62 ms 88676 KB Output is correct
28 Correct 63 ms 88676 KB Output is correct
29 Correct 65 ms 88676 KB Output is correct
30 Correct 62 ms 88676 KB Output is correct
31 Correct 69 ms 88676 KB Output is correct
32 Correct 66 ms 88676 KB Output is correct
33 Correct 66 ms 88676 KB Output is correct
34 Correct 75 ms 88676 KB Output is correct
35 Correct 77 ms 88676 KB Output is correct
36 Correct 72 ms 88676 KB Output is correct
37 Correct 78 ms 88676 KB Output is correct
38 Correct 77 ms 88676 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 70776 KB Output is correct
2 Correct 67 ms 70884 KB Output is correct
3 Correct 66 ms 70884 KB Output is correct
4 Correct 74 ms 70964 KB Output is correct
5 Correct 73 ms 70964 KB Output is correct
6 Correct 72 ms 71240 KB Output is correct
7 Correct 69 ms 71240 KB Output is correct
8 Correct 64 ms 71240 KB Output is correct
9 Correct 65 ms 71240 KB Output is correct
10 Correct 70 ms 71240 KB Output is correct
11 Correct 65 ms 71240 KB Output is correct
12 Correct 64 ms 71240 KB Output is correct
13 Correct 64 ms 71240 KB Output is correct
14 Correct 77 ms 71240 KB Output is correct
15 Correct 62 ms 71240 KB Output is correct
16 Correct 69 ms 71240 KB Output is correct
17 Correct 71 ms 71240 KB Output is correct
18 Correct 64 ms 71240 KB Output is correct
19 Correct 64 ms 71268 KB Output is correct
20 Correct 65 ms 71308 KB Output is correct
21 Correct 64 ms 71336 KB Output is correct
22 Correct 208 ms 88560 KB Output is correct
23 Correct 210 ms 88560 KB Output is correct
24 Correct 226 ms 88560 KB Output is correct
25 Correct 221 ms 88616 KB Output is correct
26 Correct 239 ms 88616 KB Output is correct
27 Correct 227 ms 88676 KB Output is correct
28 Correct 317 ms 88676 KB Output is correct
29 Correct 194 ms 88676 KB Output is correct
30 Correct 70 ms 88676 KB Output is correct
31 Correct 62 ms 88676 KB Output is correct
32 Correct 71 ms 88676 KB Output is correct
33 Correct 75 ms 88676 KB Output is correct
34 Correct 79 ms 88676 KB Output is correct
35 Correct 62 ms 88676 KB Output is correct
36 Correct 63 ms 88676 KB Output is correct
37 Correct 65 ms 88676 KB Output is correct
38 Correct 62 ms 88676 KB Output is correct
39 Correct 69 ms 88676 KB Output is correct
40 Correct 66 ms 88676 KB Output is correct
41 Correct 66 ms 88676 KB Output is correct
42 Correct 75 ms 88676 KB Output is correct
43 Correct 77 ms 88676 KB Output is correct
44 Correct 72 ms 88676 KB Output is correct
45 Correct 78 ms 88676 KB Output is correct
46 Correct 77 ms 88676 KB Output is correct
47 Correct 217 ms 88676 KB Output is correct
48 Correct 226 ms 88676 KB Output is correct
49 Correct 266 ms 88676 KB Output is correct
50 Correct 236 ms 88676 KB Output is correct
51 Correct 298 ms 88676 KB Output is correct
52 Correct 270 ms 90620 KB Output is correct
53 Correct 311 ms 92464 KB Output is correct
54 Correct 251 ms 94284 KB Output is correct
55 Correct 287 ms 95760 KB Output is correct
56 Correct 319 ms 97052 KB Output is correct
57 Correct 285 ms 100676 KB Output is correct