OJ Board

I've found the bug, and got Aced.

I use backtrack to get the path, and pruning the nodes that cannot get to the dest. But I always get WA, could anybody give me some critical I/O?
here is my code below:

could somebody give some more critical I/O? I just cannot find where am wrong!

Could anybody help me? I've passed all the test case in this post, but still get WA. I use dp and assumu N < 20000
here is my code.
#include <stdio.h>
#include <string.h>

int track[21];
int N,cnt;
int d[20000][21];

int dp(int cur, int s)
{
int& ans = d[cur][s];
if(ans)return ans;

if(s == cnt ...

I submit several times, but the state is always "in judge queue". Is there something down?