Search found 202 matches

by baodog
Sat May 24, 2008 10:39 pm
Forum: Volume 114 (11400-11499)
Topic: 11454 - Very well informed domino player
Replies: 9
Views: 3222

Re: 11454 - Very well informed domino player

Hi, Can someone verify my answers or LayCurse's answers? please :-) ? Thanks. I think the judge io is likely wrong. Here is the answers I get: [code] First Piece Wins Losses -------------------------------------------- if(s=="(2,0)" || s=="(0,2)") out(10244240,22183168); else if(s=="(6,0)" || s=="(0...
by baodog
Mon May 19, 2008 1:11 am
Forum: Volume 114 (11400-11499)
Topic: 11454 - Very well informed domino player
Replies: 9
Views: 3222

Re: 11454 Domino, Sample I/O also Wrong?

After fixing a bug, now I get

W 10244240 L 22183168 T 1577845

We both have around 32 million states total for (2,0),
whereas the problem setter has about 6.1 million (ties occur more rarely).
by baodog
Sun May 18, 2008 9:11 pm
Forum: Volume 114 (11400-11499)
Topic: 11454 - Very well informed domino player
Replies: 9
Views: 3222

11454 - Very well informed domino player

Hi,

for (0,2), I'm getting
W 9637224 L 21213222 T 1527593
for wins, losses, ties.

Is anyone getting the same?
I think the sample IO is wrong, or the pieces shown are not correct.
Thanks.
by baodog
Sun May 18, 2008 5:09 am
Forum: Volume 114 (11400-11499)
Topic: 11453 - Traveling fishmonger
Replies: 2
Views: 2236

11453 - Traveling fishmonger

Cartagena 211286

Just at the first city, I can sell 5*(211286/10000)=105 fish, for
a profit of 1050 !! Which is greater than 594, the sample answer!!
I think the I/O is very wrong...

btw, I'm getting 2063 with floyd warshall + TSP DP.
by baodog
Thu Apr 10, 2008 4:20 am
Forum: Volume 114 (11400-11499)
Topic: 11443 - Tree in a Grid
Replies: 1
Views: 1051

11443 - Tree in a Grid

I think this requires O(n^2) dp, where n is 200x8 max, with a bitmask approach. However, I can't find the proper recursive relationship. I try to use decompose, but if there is more than one edge coming out of a node, I don't know how to ensure there is no cycle in the rest of the tree. It has to be...
by baodog
Thu Apr 10, 2008 4:14 am
Forum: Volume 114 (11400-11499)
Topic: 11446 - Where is the 'back' button?
Replies: 17
Views: 3232

Re: 11446 - Where is the 'back' button?

Hi,

Nevermind...
by baodog
Tue Apr 01, 2008 7:25 am
Forum: Volume 114 (11400-11499)
Topic: 11439 - Maximizing the ICPC
Replies: 4
Views: 3009

Re: 11439 - Maximizing the ICPC

Nevermind... Heuristics does not work here... have to use matching.
by baodog
Mon Mar 31, 2008 9:59 am
Forum: Volume 114 (11400-11499)
Topic: 11439 - Maximizing the ICPC
Replies: 4
Views: 3009

Since time limit is 10 seconds, maybe some sort of heuristic
search works here as well. btw, anyone have a pointer to
a clean, easy to understand, C++ version of the blossom algorithm
on adjacency lists for weighted graphs?
by baodog
Sun Mar 23, 2008 9:59 pm
Forum: Volume 114 (11400-11499)
Topic: 11432 - Busy Programmer
Replies: 12
Views: 4806

Thanks! Got ac.
by baodog
Sun Mar 23, 2008 8:06 pm
Forum: Volume 114 (11400-11499)
Topic: 11432 - Busy Programmer
Replies: 12
Views: 4806

Test Data

Hi, I keep get wa. Is this i/o correct? 0 0 1 0 1 1 3 2 3 1 3 0 3 3 4 0 4 1 4 2 4 3 4 4 3 10 33 33 33 12 33 0 33 1 -1 -1 Case 1: 1 Case 2: 0 Case 3: 2 Case 4: 10 Case 5: 2 Case 6: 0 Case 7: 12 Case 8: 0 Case 9: 2 Case 10: 22 Case 11: 38 Case 12: 40 Case 13: 12 Case 14: 3665248281885181068 Case 15: 3...
by baodog
Thu Mar 20, 2008 12:28 am
Forum: Volume 114 (11400-11499)
Topic: 11423 - Cache Simulator
Replies: 3
Views: 1517

Nevemind. Got accepted.
by baodog
Sat Mar 08, 2008 5:37 am
Forum: Volume 114 (11400-11499)
Topic: 11406 - Best Trap
Replies: 8
Views: 3423

That's just the result of a weak dataset. The cone has to be inside the room, but the dataset does not test it properly. I think the reason you might have got WA the first time is that your algorithm is not correct, i.e., it missed a way to put the cone in while keeping the cone inside the room. htt...
by baodog
Fri Jan 11, 2008 9:39 am
Forum: Volume 113 (11300-11399)
Topic: 11379 - Chichi's Home Work
Replies: 12
Views: 2895

still struggling...

I can get f(n,k), but not the rest from it. It gets complicated when circles at the ends of the interval [X,Y] intersect with ones before it, or after it. I can not get the right answer using inclusion exclusion principle.
by baodog
Fri Jan 11, 2008 9:30 am
Forum: Volume 106 (10600-10699)
Topic: 10631 - Normals
Replies: 14
Views: 7376

Thanks Darko!
by baodog
Mon Jan 07, 2008 9:17 am
Forum: Volume 113 (11300-11399)
Topic: 11379 - Chichi's Home Work
Replies: 12
Views: 2895

With precomputation f can be computed in O(n^2) dp, which
may or may not be fast enough

Go to advanced search