Submission #1693144


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define X first
#define Y second

const int maxn=131072+233;

int n,fa[maxn],lc[maxn],rc[maxn],w[maxn];
LL mid;

vector<pair<LL,LL> > S[maxn],tmp;

void dfs(int u)
{
	if (!lc[u])
	{
		S[u].push_back(make_pair(w[u],w[u]));
		return;
	}
	dfs(lc[u]); dfs(rc[u]);
	int i,j=-1;
	int m=(int)S[rc[u]].size()-1;
	for (i=0;i<(int)S[lc[u]].size();i++)
	{
		bool flag=0;
		while (j<m&&S[lc[u]][i].Y+S[rc[u]][j+1].X<=mid) j++,flag=1;
		if (flag)
			S[u].push_back(make_pair(S[lc[u]][i].X+w[u],S[rc[u]][j].Y+w[u]));
	}

	m=(int)S[u].size();
	for (i=0;i<m;i++)
		S[u].push_back(make_pair(S[u][i].Y,S[u][i].X));
	sort(S[u].begin(),S[u].end());
	LL last=1e15;
	tmp.clear();
	for (i=0;i<(int)S[u].size();i++)
		if (last>S[u][i].Y) last=S[u][i].Y,tmp.push_back(S[u][i]);
	S[u].clear();
	for (i=0;i<(int)tmp.size();i++)
		S[u].push_back(tmp[i]);

//	printf("S[%d]:\n",u);
//	for (i=0;i<(int)S[u].size();i++)
//		printf("%lld %lld\n",S[u][i].X,S[u][i].Y);
//	puts("");
}

bool pass()
{
//	printf("<<<pass %lld>>>\n",mid);
	int i;
	for (i=1;i<=n;i++)
		S[i].clear();
	dfs(1);
//	puts(""); puts(""); puts(""); puts(""); puts("");
	return S[1].size();
}

int main()
{
#ifdef h10
	freopen("E.in","r",stdin);
	freopen("E.out","w",stdout);
#endif
	int i;
	LL L=0,R=0;
	scanf("%d",&n);
	for (i=2;i<=n;i++)
	{
		scanf("%d%d",&fa[i],&w[i]);
		if (lc[fa[i]]) rc[fa[i]]=i;
		else lc[fa[i]]=i;
		R+=w[i];
	}

	while (L<=R)
	{
		mid=(L+R)>>1;
		if (pass()) R=mid-1;
		else L=mid+1;
	}
	printf("%lld\n",L);
}

Submission Info

Submission Time
Task A - Shik and Stone
User h10
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1626 Byte
Status WA
Exec Time 3 ms
Memory 4352 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:69:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:72:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&fa[i],&w[i]);
                             ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
WA × 3
WA × 22
Set Name Test Cases
Sample example0.txt, example1.txt, example2.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, example0.txt, example1.txt, example2.txt
Case Name Status Exec Time Memory
000.txt WA 3 ms 4352 KB
001.txt WA 3 ms 4352 KB
002.txt WA 3 ms 4352 KB
003.txt WA 3 ms 4352 KB
004.txt WA 3 ms 4352 KB
005.txt WA 3 ms 4352 KB
006.txt WA 3 ms 4352 KB
007.txt WA 3 ms 4352 KB
008.txt WA 3 ms 4352 KB
009.txt WA 3 ms 4352 KB
010.txt WA 3 ms 4352 KB
011.txt WA 3 ms 4352 KB
012.txt WA 3 ms 4352 KB
013.txt WA 3 ms 4352 KB
014.txt WA 3 ms 4352 KB
015.txt WA 3 ms 4352 KB
016.txt WA 3 ms 4352 KB
017.txt WA 3 ms 4352 KB
018.txt WA 3 ms 4352 KB
example0.txt WA 3 ms 4352 KB
example1.txt WA 3 ms 4352 KB
example2.txt WA 3 ms 4352 KB