Search found 5 matches

by Diablos
Fri Oct 27, 2006 8:36 pm
Forum: Volume 100 (10000-10099)
Topic: 10060 - A hole to catch a man
Replies: 22
Views: 6529

10060 - please help

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 <cstdlib>...
by Diablos
Fri Oct 13, 2006 5:49 pm
Forum: Volume 100 (10000-10099)
Topic: 10068 - The Treasure Hunt
Replies: 31
Views: 6671

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

North, East, West, South ?
by Diablos
Wed Oct 11, 2006 7:35 pm
Forum: Volume 100 (10000-10099)
Topic: 10068 - The Treasure Hunt
Replies: 31
Views: 6671

10068 - WA

#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, pickup, xL...
by Diablos
Wed Oct 11, 2006 7:25 pm
Forum: Volume 100 (10000-10099)
Topic: 10000 - Longest Paths
Replies: 160
Views: 38772

Correcte, finally got the AC,,,

Just with some memoization....
by Diablos
Thu Oct 05, 2006 5:08 pm
Forum: Volume 100 (10000-10099)
Topic: 10000 - Longest Paths
Replies: 160
Views: 38772

10000 - TLE

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 <fstream> #...

Go to advanced search