OJ Board

SDiZ

Just FYI,

When you have two suit with same card number, pick it according to the order S-H-D-C.
I have tried picking D over S and got a WA.

SDiZ

The test data is okay if I use

Code: Select all

while ((cin >> n)) {
 ...
}

but not

Code: Select all

while (1) {
   cin >> n;
   if (cin.eof()) break;

   ...
}

is this expected?

SDiZ

I can't understand the test-cases posted above..... Can any one tell me why the test case: 5 3 2 1 3 1 2 4 5 3 5 3 4 0 have the output 1 3 Number of Articulaion point=1 I think there is no articulaion points ! see : http://www.sdiz.net/temp/315.png After removing point 3, the graph is still connecte...

SDiZ

N|N0 wrote:What did you use instead of Floyd?
Did you try placing a firestation on every empty intersection and running special-Dijkstra?
Or just used some other all-pairs algorithm and then doing the job...

I just use Dijkstra on every feasible sol'n

SDiZ

It's using gcc-2.95, a very old version of gcc.

SDiZ

okay, i get A.C. eventally.
I didn't knew Floyd is that slow..

SDiZ

Observer wrote:Seems that you don't understand what I mean......

Floyd's certainly NOT the only way to compute all-pair shortest paths.

Floyd is the only all-pair shortest paths i know how to code. Or did you means useing a single-source, all destination algorithm and repeat N times?

SDiZ

I use an all-pair shortest path algorithm here, because i can update the new maximum distance in O(n) time. ( using the relation NewNearestDistanceFromCity = MIN( OldNearestDistanceFromCity , Distanace[ NewFireStation, i ] ) ) I have seen some post saying putting all firestation to a heap, and run d...

SDiZ

I guess I may have misunderstood something on 10278 My understand 10278 is : Minimizing the maximum distance from all intersetion to it's nearest firestation. For example, Case 1: * = with firestation Assume all path are equal length [ 1 ] ------ [ 2 ] ------ [ 3* ] ------ [ 4 ] ------ [ 5 ] No matt...

SDiZ

my program get AC after change from STL map to hash_map.

STL map in gcc use rb_tree, which is slow in inserting.

SDiZ

I get a TLE using any algorithm I have on mind, anyone can give me some hints?
I suspect my string ops are too slow, but i have no ide how to improve it.

Code: Select all

SDiZ

May anyone explain the "hash" method you use?

How do you check if two hash is an editing step?

or do you generate all possible editing steps? (i think this would be very large&slow)

SDiZ

I got WA..
any one have good test case for this question?

OJ Board

Search found 13 matches

Re: 462 Problem

256, malformed judge input?

10278 - clarification needed.

AC

TLE

editing step with Hash?

10167 Birthday Cake