Submission #94402

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
94402	2019-01-18T04:33:55 Z	gumball	Network (BOI15_net)	C++14	63 / 100	23 ms	14712 KB

#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll n,m,i,ta,tb,D[101010],daun,bes[101010],ROOT,j,P[101010],sudah[101010],sisa,kel[101010],L[101010],VS;
vector<ll> v[101010],C,w[101010],isi[101010];
vector<pair<pair<ll,ll> ,ll> > Z;
void dfs(ll aa,ll bb)
{
	//cout<<aa<<" "<<bb<<" "<<cc<<"\n";
	bes[aa]=0;
	if(D[aa]==1)bes[aa]=1;
	ll ii;
	for(ii=0;ii<v[aa].size();ii++)
		if(v[aa][ii]!=bb)
		{
			P[v[aa][ii]]=aa;
			dfs(v[aa][ii],aa);
			bes[aa]+=bes[v[aa][ii]];
		}
}
void dfs2(ll aa,ll bb,ll cc,ll dd)
{
	L[aa]=dd;
	if(D[aa]==1)
	{
		kel[dd]++;
		isi[dd].pb(aa);
		Z.pb(mp(mp(cc,dd),aa));
	}
	ll ii;
	for(ii=0;ii<v[aa].size();ii++)
		if(v[aa][ii]!=bb)
			dfs2(v[aa][ii],aa,cc,dd);
}
int main()
{
	//ios_base::sync_with_stdio(NULL);cin.tie(NULL);cout.tie(NULL);
	cin>>n;
	for(i=1;i<n;i++)
	{
		cin>>ta>>tb;
		v[ta].pb(tb);
		v[tb].pb(ta);
		D[ta]++;
		D[tb]++;
	}
	for(i=1;i<=n;i++)
		if(D[i]>1)
			C.pb(i);
		else
			daun++;
	//cout<<daun<<"\n";
	for(i=0;i<C.size();i++)
	{
		vector<ll> X;
		ROOT=C[i];
		//cout<<ROOT<<"\n";
		dfs(ROOT,ROOT);		
		for(j=0;j<v[ROOT].size();j++)
			X.pb(bes[v[ROOT][j]]);
		//return 0;
		sort(X.begin(),X.end());
		reverse(X.begin(),X.end());
		if(X[0]*2<=daun)
			break;
		else
			ROOT=-1;
	}
	VS=v[ROOT].size();
	for(i=0;i<v[ROOT].size();i++)
		dfs2(v[ROOT][i],ROOT,bes[v[ROOT][i]],i);
	cout<<(daun/2+daun%2)<<"\n";
	sort(Z.begin(),Z.end());
	if(daun%2==1)
	{
		//while(1);
		ll OO=Z[daun-1].fi.se;
		if(isi[OO].back()!=ROOT)cout<<isi[OO].back()<<" "<<ROOT<<"\n";
		else
		{
			for(i=1;i<=n;i++)
				if(L[i]!=L[isi[OO].back()])
				{
					cout<<isi[OO].back()<<" "<<i<<"\n";
					break;
				}
		}
		daun--;
		kel[OO]--;
		isi[OO].pop_back();
		Z.pop_back();
	}
	priority_queue<pair<ll,ll> > pq;
	sisa=daun/2;
	for(i=0;i<VS;i++)pq.push(mp(kel[i],i));
	for(i=0;i<(daun/2);i++)
	{
		while(kel[pq.top().se]!=pq.top().fi)pq.pop();
		ll A=pq.top().se;
		pq.pop();
		ll B=pq.top().se;
		pq.pop();
		cout<<isi[A].back()<<" "<<isi[B].back()<<"\n";
		kel[A]--;
		kel[B]--;
		isi[A].pop_back();
		isi[B].pop_back();
		pq.push(mp(kel[A],A));
		pq.push(mp(kel[B],B));
	}
	//if(sisa)while(1);
}

Compilation message

net.cpp: In function 'void dfs(long long int, long long int)':
net.cpp:17:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(ii=0;ii<v[aa].size();ii++)
           ~~^~~~~~~~~~~~~
net.cpp: In function 'void dfs2(long long int, long long int, long long int, long long int)':
net.cpp:35:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(ii=0;ii<v[aa].size();ii++)
           ~~^~~~~~~~~~~~~
net.cpp: In function 'int main()':
net.cpp:57:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0;i<C.size();i++)
          ~^~~~~~~~~
net.cpp:63:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0;j<v[ROOT].size();j++)
           ~^~~~~~~~~~~~~~~
net.cpp:74:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0;i<v[ROOT].size();i++)
          ~^~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
45.0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	7416 KB	Output is correct
2	Correct	8 ms	7416 KB	Output is correct
3	Correct	8 ms	7544 KB	Output is correct
4	Correct	8 ms	7416 KB	Output is correct
5	Correct	7 ms	7416 KB	Output is correct
6	Correct	7 ms	7544 KB	Output is correct
7	Correct	8 ms	7416 KB	Output is correct
8	Correct	8 ms	7416 KB	Output is correct
9	Correct	8 ms	7420 KB	Output is correct
10	Correct	8 ms	7416 KB	Output is correct
11	Correct	8 ms	7416 KB	Output is correct
12	Correct	7 ms	7416 KB	Output is correct
13	Correct	8 ms	7544 KB	Output is correct
14	Correct	8 ms	7544 KB	Output is correct
15	Correct	8 ms	7516 KB	Output is correct
16	Correct	8 ms	7544 KB	Output is correct
17	Correct	8 ms	7420 KB	Output is correct
18	Correct	8 ms	7544 KB	Output is correct
19	Correct	8 ms	7544 KB	Output is correct
20	Correct	8 ms	7544 KB	Output is correct
21	Correct	7 ms	7544 KB	Output is correct
22	Correct	10 ms	7672 KB	Output is correct
23	Correct	10 ms	7672 KB	Output is correct
24	Correct	10 ms	7844 KB	Output is correct
25	Correct	21 ms	7672 KB	Output is correct
26	Correct	10 ms	7672 KB	Output is correct
27	Correct	17 ms	7672 KB	Output is correct
28	Correct	23 ms	7676 KB	Output is correct
29	Correct	15 ms	7672 KB	Output is correct
30	Correct	8 ms	7544 KB	Output is correct
31	Correct	21 ms	7672 KB	Output is correct
32	Correct	7 ms	7544 KB	Output is correct
33	Correct	6 ms	7416 KB	Output is correct
34	Correct	7 ms	7416 KB	Output is correct
35	Correct	6 ms	7544 KB	Output is correct
36	Correct	19 ms	7544 KB	Output is correct
37	Correct	8 ms	7544 KB	Output is correct
38	Correct	12 ms	7544 KB	Output is correct
39	Correct	7 ms	7544 KB	Output is correct
40	Correct	8 ms	7544 KB	Output is correct
41	Correct	7 ms	7416 KB	Output is correct
42	Correct	9 ms	7544 KB	Output is correct
43	Correct	8 ms	7672 KB	Output is correct
44	Correct	7 ms	7516 KB	Output is correct
45	Correct	7 ms	7544 KB	Output is correct
46	Correct	9 ms	7544 KB	Output is correct
47	Correct	7 ms	7548 KB	Output is correct
48	Correct	7 ms	7544 KB	Output is correct
49	Correct	9 ms	7544 KB	Output is correct
50	Correct	8 ms	7416 KB	Output is correct
51	Correct	8 ms	7416 KB	Output is correct
52	Correct	8 ms	7544 KB	Output is correct
53	Correct	15 ms	7544 KB	Output is correct
54	Correct	8 ms	7544 KB	Output is correct
55	Correct	9 ms	7456 KB	Output is correct
56	Correct	8 ms	7444 KB	Output is correct
57	Correct	7 ms	7544 KB	Output is correct
58	Correct	8 ms	7672 KB	Output is correct

Subtask #3
0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	7416 KB	Output is correct
2	Correct	8 ms	7416 KB	Output is correct
3	Correct	8 ms	7544 KB	Output is correct
4	Correct	8 ms	7416 KB	Output is correct
5	Correct	7 ms	7416 KB	Output is correct
6	Correct	7 ms	7544 KB	Output is correct
7	Correct	8 ms	7416 KB	Output is correct
8	Correct	8 ms	7416 KB	Output is correct
9	Correct	8 ms	7420 KB	Output is correct
10	Correct	8 ms	7416 KB	Output is correct
11	Correct	8 ms	7416 KB	Output is correct
12	Correct	7 ms	7416 KB	Output is correct
13	Correct	8 ms	7544 KB	Output is correct
14	Correct	8 ms	7544 KB	Output is correct
15	Correct	8 ms	7516 KB	Output is correct
16	Correct	8 ms	7544 KB	Output is correct
17	Correct	8 ms	7420 KB	Output is correct
18	Correct	8 ms	7544 KB	Output is correct
19	Correct	8 ms	7544 KB	Output is correct
20	Correct	8 ms	7544 KB	Output is correct
21	Correct	7 ms	7544 KB	Output is correct
22	Correct	10 ms	7672 KB	Output is correct
23	Correct	10 ms	7672 KB	Output is correct
24	Correct	10 ms	7844 KB	Output is correct
25	Correct	21 ms	7672 KB	Output is correct
26	Correct	10 ms	7672 KB	Output is correct
27	Correct	17 ms	7672 KB	Output is correct
28	Correct	23 ms	7676 KB	Output is correct
29	Correct	15 ms	7672 KB	Output is correct
30	Correct	8 ms	7544 KB	Output is correct
31	Correct	21 ms	7672 KB	Output is correct
32	Correct	7 ms	7544 KB	Output is correct
33	Correct	6 ms	7416 KB	Output is correct
34	Correct	7 ms	7416 KB	Output is correct
35	Correct	6 ms	7544 KB	Output is correct
36	Correct	19 ms	7544 KB	Output is correct
37	Correct	8 ms	7544 KB	Output is correct
38	Correct	12 ms	7544 KB	Output is correct
39	Correct	7 ms	7544 KB	Output is correct
40	Correct	8 ms	7544 KB	Output is correct
41	Correct	7 ms	7416 KB	Output is correct
42	Correct	9 ms	7544 KB	Output is correct
43	Correct	8 ms	7672 KB	Output is correct
44	Correct	7 ms	7516 KB	Output is correct
45	Correct	7 ms	7544 KB	Output is correct
46	Correct	9 ms	7544 KB	Output is correct
47	Correct	7 ms	7548 KB	Output is correct
48	Correct	7 ms	7544 KB	Output is correct
49	Correct	9 ms	7544 KB	Output is correct
50	Correct	8 ms	7416 KB	Output is correct
51	Correct	8 ms	7416 KB	Output is correct
52	Correct	8 ms	7544 KB	Output is correct
53	Correct	15 ms	7544 KB	Output is correct
54	Correct	8 ms	7544 KB	Output is correct
55	Correct	9 ms	7456 KB	Output is correct
56	Correct	8 ms	7444 KB	Output is correct
57	Correct	7 ms	7544 KB	Output is correct
58	Correct	8 ms	7672 KB	Output is correct
59	Runtime error	14 ms	14712 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
60	Halted	0 ms	0 KB	-

Submission #94402

Compilation message

Subtask #1 18.0 / 18.0

Subtask #2 45.0 / 45.0

Subtask #3 0 / 37.0

Subtask #1
18.0 / 18.0

Subtask #2
45.0 / 45.0

Subtask #3
0 / 37.0