LightOJ 1046 Rider

搜一搜即可

#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;

struct P
{
    int r, c;
    P(){}
    P(int _r, int _c){r = _r; c = _c;}
};

int n, m;
int num, step[105][12][12];
int rm[8] = {1, 1, 2, 2, -1, -1, -2, -2};
int cm[8] = {2, -2, 1, -1, 2, -2, 1, -1};
char maze[12][12];

void init(int k, P start, int t)
{
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            step[k][i][j] = INF;
    queue<P> q;
    q.push(start);
    step[k][start.r][start.c] = 0;
    while(!q.empty())
    {
        P p = q.front(); q.pop();
        for(int i = 0; i < 8; i++)
        {
            int nr = p.r + rm[i], nc = p.c + cm[i];
            if(maze[nr][nc] != '\0' && step[k][p.r][p.c] + 1 < step[k][nr][nc])
            {
                step[k][nr][nc] = step[k][p.r][p.c] + 1;
                q.push(P(nr, nc));
            }
        }
    }
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            if(step[k][i][j] != INF)
                step[k][i][j] = ceil(1.0 * step[k][i][j] / t);
}
int solve()
{
    int Min = INF;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
        {
            int sum = 0;
            for(int k = 0; k < num; k++)
                sum = min(INF, sum + step[k][i][j]);
            Min = min(Min, sum);
        }
    if(Min == INF) return -1;
    return Min;
}

int main()
{
    int T;
    scanf("%d", &T);

    for(int ca = 1; ca <= T; ca++)
    {
        memset(maze, 0, sizeof(maze));
        scanf("%d%d", &n, &m);
        for(int i = 1; i <= n; i++)
            scanf("%s", maze[i] + 1);

        num = 0;
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++)
                if(maze[i][j] != '.') 
                    init(num++, P(i, j), maze[i][j] - '0');

        printf("Case %d: %d\n", ca, solve());
    }

    return 0;
}