OJ Board

Thank you very much, finally I got AC with your input

Could ne1 give me some input ? my program seems to be ok but i can't get AC.

Please ne1 who got AC could post me the output for this input ?

8
6 1
6 2
7 7
8 4
9 9
10 10
11 11
12 6

Thank you in advance

I got runtime error until I tried this input:
the node CC doesn's exists so mi program looked for this and didn't find it.
if start node or end nod doesn's exists print No route

I hope it can help you to get AC

The problem with signed char is due to a special spanish character used in the input whose value is greater than 127.

This is the character:

ok shamim, thank you

I'm trying to solve 704 but I'm gettin time limit.
I'm using an iterative backtracking but I think I cannot optimize it more.

Do you have any idea about solving this problem ?
any other way ?

Thank you in advance :)

This is my code:


#include <stdio.h>
#include <string.h>

/* Final state of the ...

I've found the problem.
The queue got very big very soon because I did not check to expand a node just if it wasn't expanded previously.

Jus added this:

bool expandedNodes = new bool[n];



Thank you for helping me asif_rahman0!

First of all sorry about mi English cause is not very good :)
I'm trying to solve the problem called "The mysterious X network", you can see it here: http://acmicpc-live-archive.uva.es/nuevoportal/data/problem.php?p=3502

I'm using BFS but the judge doesn't accept the problem because of the memory ...