OJ Board

Please heeeelp, I am trying to solve 10060 a hole to catch a man, and it gives me TLE :S :S :S

I tried to compare the last point with the first point with a very small error Epsilon ( I put 0.0000000000000001 ), and it was then giving WA :S :S :S

please help :S

#include <iostream>
#include ...

is it about the order of the movement ??!!!!!!
which is first and what's the order please ???

North, East, West, South ?

#include <string>
#include <iostream>
#include <climits>
#include <string.h>
#include <queue>
#include <string>
using namespace std;

#define isNum(a) (a >= '0' && a <= ';')

#ifndef ONLINE_JUDGE
#include <fstream>
#define cin in
ifstream in("10068.in");
#endif

struct Treasure
{
int Carry ...

Correcte, finally got the AC,,,

Just with some memoization....

I coded the problem "Longest Path" with DFS but it still gives me TLE, although I saw posts on the board that solved DFS with muuucccchhhh gooooood time....

anyway, here's my code::
#include <iostream>
#include <string.h>
#include <list>
using namespace std;

#ifndef ONLINE_JUDGE
#include ...