OJ Board

Thanks remerson! Got AC using Union-Find Disjoint Sets And the fault in the DFS solution was initializing ppamax by -2147483647.

Thanks a lot lbv! It was such a silly mistake in my code.

Some one can help me out here please? Getting WA.

Thanks lbv! Sorted out the problem.

Anybody can give me some hints about this problem please?

Thanks ! Didn't know this info!

Thanks Brianfry713! I thought any ordering of the routes would be fine as in the problem statement there's no mentioning of sorting the routes.

Or my updated code is : #include<cstdio> using namespace std; #define DIST(a, b, c, d) ((a>=c ? (a-c) : (c-a)) + (b>=d ? (b-d) : (d-b))) int n, m, gridNum, check1, check2, check3, r1, c1, r2, c2, r3, c3, soln; bool isVisited[9][9], isReachable[9][9]; void dfs(int i, int j) { isReachable[i][j] = true...

Someone can help me please with the pruning? Getting continuously TLE #include<cstdio> using namespace std; #define DIST(a, b, c, d) ((a>=c ? (a-c) : (c-a)) + (b>=d ? (b-d) : (d-b))) int n, m, gridNum, check1, check2, check3, r1, c1, r2, c2, r3, c3, soln; bool isVisited[9][9]; void backtrack(int i, ...

AC

Thanks! Got AC!

Thanks tiendaotd for your reply! But can you please explain a bit more?

someone can help me please? getting WA

I used bitmasking and backtracking for the solution. And getting TLE. In my PC, the program runs for about 4s for n = 14. And for n<14, runs fast. So, a bit of pruning may get it AC. Someone can help me speeding up the program a bit? #include<cstdio> using namespace std; int n, r, ld, rd, soln; char...

still WA. please help me find the bug in the code brianfry713. import java.io.*; import java.util.*; class Main { public static void main(String[] args) throws Exception { int count, i; double lg, E_T; String line, s, words[]; TreeMap<String, Integer> map = new TreeMap<String, Integer>(); Set<Map.En...