OJ Board

brianfry713 wrote:Input:

Code: Select all

4
1 2 1 2
2 1 1 3
3 1 1 4
4 0 0

AC output 3

thx!
I've already figure out that my algo will fail when the depth of the tree is more than 3.
So I compromise to Dfs,and then Ac in 25ms.
Thanks again for brianfry713's test sample!

Here's my code.
#include<cstdio>
#include<cmath>
#include<vector>
using namespace std;

int main()
{
int n;
while( ~scanf("%d",&n)&&n )
{
int father,value,nkid;
int iskid[10005]={0};
int marble[10005]={0};
vector<vector<int> >tree;
tree.clear() , tree.resize(n);
for(int i=0;i<n;i ...