OJ Board

Posted: **Mon Aug 04, 2008 2:37 pm**

Can anyybody help me on this problem? I have no idea why I am getting WA.

removed

Posted: **Tue Aug 05, 2008 9:26 am**

You should set edge to 0. Your code fails when the first tree (only) can talk to a doctor.

Posted: **Tue Aug 05, 2008 1:35 pm**

Thanks a lot.

Posted: **Tue Mar 03, 2009 7:03 pm**

i got WA
and i changed this

Code: Select all

struct node{
	char kind;
	[b]double[/b] xx,yy;
	int index;
};

to

Code: Select all

struct node{
	char kind;
	int xx,yy;
	int index;
};

and I got Acc

I dont know ,Why !
(maybe for reading inputs
if xx=3 , so for double xx is 2.99999999)
and i have another problem
problem says :

0 < n < 100, 0 < m ? 10, 0 ? k, d ? 100
and 0 < b < 10

so we have 10*10(trees) + 100 (number of doctor) = 200 nodes
but i got runtime error with list[300];
and i think picture isn`t exactly answer
this`s better : (Click on pic)

Posted: **Sat Sep 12, 2009 9:01 am**

Posted: **Fri Apr 20, 2012 3:34 am**

i can't find what's wrong with my code as i'm getting WA for this problem. can any1 help plz?

Code: Select all

AC

Posted: **Fri Apr 20, 2012 10:32 pm**

Your code fails on this input:

Code: Select all

AC Output:

Code: Select all

Tree can be saved :)

Posted: **Fri Apr 20, 2012 11:27 pm**

thnx

made a silly mistake

OJ Board

11474 - Dying Tree

11474 - Dying Tree

Re: 11474 - Dying Tree

Re: 11474 - Dying Tree

Re: 11474 - Dying Tree

11474 - Dying Tree_wa

Re: 11474 - Dying Tree

Re: 11474 - Dying Tree

Re: 11474 - Dying Tree