Search found 3 matches

by owl
Thu Jun 20, 2002 5:22 pm
Forum: Volume 2 (200-299)
Topic: 298 - Race Tracks
Replies: 11
Views: 2066

Thanks everyone

Thanks!
but mine gives the same result as yours(any one of you except the last one).
so still don't know what's wrong!!!!
by owl
Thu Jun 20, 2002 11:39 am
Forum: Volume 2 (200-299)
Topic: 298 - Race Tracks
Replies: 11
Views: 2066

i have checked the bounds you have mentioned. my algorithm is just dp with simple dfs. and here are the test cases i have used. correct answers are given for each test case. 10 5 5 4 0 4 4 1 1 4 2 4 5 5 4 0 4 4 1 1 2 2 4 3 3 0 0 2 2 2 1 1 0 2 0 2 1 1 5 5 0 4 4 4 1 1 4 2 3 30 30 0 0 29 29 1 1 4 2 3 3...
by owl
Thu Jun 20, 2002 6:19 am
Forum: Volume 2 (200-299)
Topic: 298 - Race Tracks
Replies: 11
Views: 2066

help! problems with 298!

[c] #include <string.h> #include <math.h> #include <stdio.h> int dp[30][30][7][7]; char ob[30][30]; int finalx, finaly; int row, col; void hops(int x, int y, int dx, int dy) { int i, j; int temp; int newdx, newdy, newx, newy; dp[x][y][dx][dy] = 50000; if (ob[x][y]) return; for (i = -1; i < 2; i++) f...

Go to advanced search