问题标题: 哪位大神给我看看哪里错了？C++酷丁堂2085

#include<iostream>
#include<cstring>
#include<queue>
using namespace std;

const int dir[12][12] = {
    {-2,-2},{-1,-2},{-2,-1},
    {-2,2},{-2,1},{-1,2},
    {2,-2},{1,-2},{2,-1},
    {2,2},{2,1},{1,2},
};

struct coord {
    int x,y,count;  
};

queue<coord> q;
bool visited[101][101];

bool canJump(int x,int y)
{
    if(x>=1 && x<=100 && y>=1 && y<=100) return true;
    return false;
}

int bfs(int x, int y) {
    q.push((coord){x,y,0});
    while(!q.empty())
    {
        coord now =q.front();
        q.pop();
        if(now.x == 1 && now.y == 1) return now.count;
        for(int i=0;i<12;i++)
        {
            int nx = now.x + dir[i][0];
            int ny = now.y + dir[i][1];
            if(canJump(nx,ny) && !visited[nx][ny]) {
                visited[nx][ny]=true;
                q.push((coord){nx,ny,now.count+1});
            }
        }
    }
    //return
}
int main()
{
    int a,b,c,d;
    cin>>a>>b;
    cin>>c>>d;
    memset(visited,false,sizeof(visited));
    visited[a][b] = true;
    cout<<bfs(a,b)<<endl;
    memset(visited,false,sizeof(visited));
    visited[c][d] = true;
    cout<<bfs(c,d)<<endl;
    return 0;
}

先到先得，AC100者 @BFS内队列怎么清空（方法）？