OJ Board

fpmc

Hm... this is strange.

For case

2D2
TTHHTT

how do you get 4??

Frank

fpmc

Hi Little Joey,

Nice problem. I tried many times yesterday to solve this problem. I used a standard algorithm that I have code for, but got wrong answer. Before I output the answer, I also check for validity of the solution by making sure that the mixture is stable before outputting it (otherwise ...

fpmc

By the way, your changing the name from Mr. Hamilton to Mr. Smith is either a very good joke, or a very funny Freudian slip. I like it.

Frank

fpmc

Hi,

Thanks hewei. You're right, if the streets are of different lengths the probabilities will be different. When I created the problem I forgot to say that all streets have the same lengths.

Assuming this, the probabilities only depend on degree (and I can prove this).

Thanks,
Frank Chu

fpmc

Sorry for the controversy. Like I said, it was a bit shameless on my part, and if that angers others, I'll just stop doing it next time.

As for the problem, by smallest "expected amount of time" I mean the smallest average time that it would take Mrs. H to find Mr. H and take him home. The smallest ...

fpmc

Yes, the output statement is a little vague. What little joey said is correct. Basically the problem asks for a list of intersections that Mrs. H visits, without repetition, that minimize the expected time (of finiding Mr.H and bringing him home). Thank you for the correction.

And yes I am the guy ...

fpmc

Hi,
Some pointers:

1) The sample output is wrong here. The first ouput case for 64 2 is wrong, which probably most people have noticed without asking.

2) Just in case you're using the iterative algorithm, be careful when n is odd. For n odd, you have to move the smallest disk 'counter-clockwise ...

fpmc

The problem is badly worded.

There are N types of objects , each with a value and a weight, and there are G people, each with a capacity. Each person can take at most one object from each type , but can take as many objects as one can carry. Find the maximal value that the G people can carry out ...

fpmc

Strange, you posted 6 input cases and there's 7 output??

But I checked manually and my program seems to work for your test input cases...... unfortunate...

Please can anyone help me out here???
Frank

fpmc

Hi I'm getting WA for this problem. It works on inputs I got from the official website. My algorithm is to do one flood-fill to mark all non-background pixels with a positive component number, then do a second flood-fill to mark all the dots on the die with a negative component number (negative of ...

fpmc

Hi,

I doubt your solution to the case when the first string = second string. I sent a code that yields for the test case

abc

abc abc

an answer

abc

So I guess this case doesn't exist.

Also, does anybody know how to do this in C++? I tried to use sets/maps which supposingly uses binary ...

fpmc

When calculating distance, round the distance to integer for every edge BEFORE adding them.

For example,
CityA -> CityB, 12.3km
CityB -> CityC, 7.4km

Then CityA -> CityC will be round(12.3) + round(7.4) = 12+7 = 19, and NOT round(12.3+7.4) = round(19.7) = 20

This would just mean that you should ...

fpmc

Observer, thank you for your test cases. I got accepted on second try after reading it.

However, I don't think the test cases were that sensitive. I used double, and my code don't even have an epsilon. I don't think I needed to use epsilons as the boundary cases for the two different formulae ...

fpmc

Hi,

getpath function should be

Code: Select all

void getpath(int r,int c)
{
   int k;
   k=path[r][c];
   if(k!=-1)
   {
      getpath(r,k);
      printf("%d-->",k);
      getpath(k,c);
   }
}

The print goes between the two recursive calls, as 'k' is the itermediate node between 'r' and 'c'.

Frank

fpmc

Sorry, I have found a bug in my convex hull code. I now got AC. Thanks for your help.

Frank

OJ Board

Search found 23 matches

657 The die is cast WA