OJ Board

Hello All,

I'm writing a program in which the user selects lots of rectangles. The problem is that when the user clicks the canvas, I'd like to quickly determine which rectangle has been selected. Any ideas as for the algorithm and data structure? TIA

Hello All,

I'm writing a program in which the user selects lots of rectangles. The problem is that when the user clicks the canvas, I'd like to quickly determine which rectangle has been selected. Any ideas as for the algorithm and data structure? TIA

The problem I was mentioning (Super Toy Soldiers), took me one week, some 50 WA and still didn't solve it, so I simply gave up.

BTW 1 / 4 ACs is not that bad, so don't brag

Do you think it is just to give the solutions in source code? I faced many problems that I haven't solved, though I tried veerrry hard, and the forum didn't help, either. I know the frustration.

I've recently got those two messages

[quote]
Hello, I

Abednego wrote:No, there are always exactly 3 pieces. I checked it with an assert().

That's right, thank you. My problems lied in oversimplificated understanding of the problem. Now I managed to solve it with some nice time.

Hello, having some troubles with this problem, too.. Is it possible that pieces of the same color are disconnected?

What approach did you use? For me, it's very convoluted problem, and I can't even figure out how to start.

Hello all, I have an algorithmic problem of making pairs between elements of two multisets (let's call them P and Q) based on a function A: P x Q -> N (N - natural numbers + {0}). Those two multisets are of the same size. Each p must be paired with exactly one q and vice versa. The outcome should be...

Look at: http://acm.uva.es/board/viewtopic.php?t=7179

Thanks for the tips man, you are my Idol now :) The mistakes were rather stupid. Test cases helped me the most. The real source of the problem was that variable "I" in ShortestPath that I used to index Lengts and Colors arrays was declared as Word, and therefore it couldn't span all the el...

I'm having a real trouble with this problem. My solution is based on Dijkstra's algorithm. I think I've tested it thouroughly, but I always get Wrong Answer after a very short time. Could you please give me some hints or test cases that could be tricky? Here's the prog, for the interested, I've put ...