OJ Board

...any help that i can provide.

Of course, I'll be looking for help in case I need it...

Fayyaz, It was a pleasure to help you. It's cool to see the number 10267 in your personal statistics...

jedihe

Well, I have read your code, I hand-tested it. I found this problem:

when you are looking for a neighbour pixel for the current one, you must do that this way:


.......
...n...
..nRn..
...n...
.......


But, in the 'worst' case, your search is being performed this way:


.......
..nn ...

I sent my solution to this problem, and I got ACC, but the last test case makes my program infinite-looping... that's weird... but I have no time to test that manually.

jedihe

Maybe this could help you:

http://online-judge.uva.es/board/viewto ... 7764#47764

jedihe

I've read most of your code, some sugestions:

First:

I don't like - just a matter of taste ; ) - the cin >> comm; that is preceding the main loop, the structure of my program is like this:


flag = true;
do
{
cin >> comm;
if( comm == 'X' )
flag = false;
if( flag && comm != ' ' ) // process ...

I worked the whole day on this problem!

Your suggestions helped me a lot, though I don't understand absolutely the reason the algorithm is the way it is... I was trying a different approach, but didn't work. I'll have to analyze it later, so I can really understand the idea behind the solution ...