## Search found 38 matches

Fri Jun 12, 2009 5:09 pm
Forum: Bugs and suggestions
Topic: Special Corrector Problem - Always PE
Replies: 10
Views: 5031

### Re: Special Corrector Problem - Always PE

I have found a couple of problems with a special corrector where I get PE.

I get always PE in this problem 10372 Leaps Tall Buildings (in a single bound).
Sat Jun 21, 2008 2:53 pm
Forum: Volume 114 (11400-11499)
Topic: 11459 - Snakes and Ladders
Replies: 33
Views: 15262

### Re: 11459 - Snakes and Ladders

Yes, there is something definitely wrong with the testcases.
Sat Dec 29, 2007 10:08 pm
Forum: Volume 113 (11300-11399)
Topic: 11372 - Arranging a Contest
Replies: 13
Views: 4735
Could you post some test case, I don't know what's wrong with my code.
Sun Nov 25, 2007 11:16 pm
Forum: Volume 113 (11300-11399)
Topic: 11359 - Guards, Imbecile Guards
Replies: 6
Views: 2872
An example is the following:

X - enemy

.....
.PX..
.....

X's direction is to the left and you decide to go to the right:

.....
.XP..
.....

This is forbidden because you jump over X and he jumps over you.
Sun Nov 25, 2007 5:40 pm
Forum: Volume 113 (11300-11399)
Topic: 11357 - Ensuring Truth
Replies: 12
Views: 4469
SAT is formulated as: (a|b|c)&(c|d|~d) .... etc

This problem is formulated as (a&b&c)|(c&d&~d) .... etc
Sun Nov 25, 2007 11:57 am
Forum: Volume 113 (11300-11399)
Topic: 11354 - Bond
Replies: 13
Views: 6758

### I've not coded it yet.

Hi, I've have not coded it yet but what I thought was the following.

First compute the min spanning tree.
Apply an algorithm similar to LCA to the tree as in problem QTREE of http://www.spoj.pl. (http://www.spoj.pl/problems/QTREE/)
Sat Nov 24, 2007 11:50 pm
Forum: Bugs and suggestions
Replies: 3
Views: 2452
By the way it would be nice if the problem statements could be viewed in a bigger window.
Sat Nov 24, 2007 1:04 am
Forum: Bugs and suggestions
Replies: 3
Views: 2452

Hi,

It would be great if it were possible to download our own accepted code directly from the judge in the same way as acm.tju.edu.cn.
Mon Oct 01, 2007 4:52 pm
Forum: Volume 112 (11200-11299)
Topic: 11298 - Dissecting a Hexagon
Replies: 25
Views: 8630
There is a test case

Code: Select all

``````Input
0

Output
0
``````
I don't know why but I finally got AC after taking care of this exception.
So the matter is that there is no way of dissecting an hexagon in 0 parallelograms ...
Wed Sep 05, 2007 10:08 pm
Forum: Volume 112 (11200-11299)
Topic: 11265 - The Sultan's Problem
Replies: 13
Views: 6311
I get exactly the same output but still WA.

I'm getting crazy with this problem.

Thanks Jan.
Wed Sep 05, 2007 8:41 pm
Forum: Volume 112 (11200-11299)
Topic: 11265 - The Sultan's Problem
Replies: 13
Views: 6311
Hi sclo,

I used exactly the algorithm you mentioned but I'm getting WA. How did you handle precision errors?
Wed Sep 05, 2007 3:18 pm
Forum: Volume 112 (11200-11299)
Topic: 11261 - Bishops
Replies: 13
Views: 3809
Well I used an O(n) algorithm which iterates over diagonals rather than square by square.
Wed Sep 05, 2007 2:53 pm
Forum: Volume 112 (11200-11299)
Topic: 11265 - The Sultan's Problem
Replies: 13
Views: 6311
I'm getting tons of WA. I have tried this problem using rationals so in case the line intersects one of the vertexes of the polygon I don't get any precision errors. I used the method described above. Could you post some tricky test cases?

Tue Sep 04, 2007 2:42 pm
Forum: Volume 112 (11200-11299)
Topic: 11264 - Coin Collector
Replies: 14
Views: 5652
Pfff, Silly mistake just an integer overflow.
Mon Sep 03, 2007 5:20 pm
Forum: Volume 112 (11200-11299)
Topic: 11264 - Coin Collector
Replies: 14
Views: 5652
I have the same results but still WA. I don't know what I am doing wrong.