Submission #61605

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>

using namespace std;

const int kDx[] = { -1, +1, 0, 0 };
const int kDy[] = { 0, 0, -1, +1 };

const int kMaxN = 100, kMaxM = 100, kMaxL = 100;
const int kInf = (1 << 24) - 1;

int main()
{
    int n, m, l;
    string s;
    cin >> n >> m >> l >> s;

    vector<string> c(n);
    for (int i = 0; i < n; i++) {
        cin >> c[i];
    }

    static int dp[kMaxN][kMaxM][4][kMaxL + 1];

    for (int y = 0; y < n; y++)
    for (int x = 0; x < m; x++) {
        for (int k = 0; k < 4; k++) { dp[y][x][k][0] = 0; }
    }

    for (int i = 0; i < l; i++) {
        for (int y = 0; y < n; y++)
        for (int x = 0; x < m; x++)
        for (int k = 0; k < 4; k++) {
            dp[y][x][k][i + 1] = kInf;
        }
        for (int y = 0; y < n; y++)
        for (int x = 0; x < m; x++)
        for (int k = 0; k < 4; k++) {
            int y1 = y, x1 = x, cost = 0;
            while (true) {
                y1 += kDy[k], x1 += kDx[k], ++cost;
                if (y1 < 0 || y1 >= n || x1 < 0 || x1 >= m) {
                    break;
                }
                if (c[y1][x1] == s[i]) {
                    for (int j = 0; j < 4; ++j) {
                        if (j == k) continue;
                        dp[y1][x1][k][i + 1] = min(dp[y1][x1][k][i + 1], dp[y][x][j][i] + cost);
                    }
                    break;
                }
            }
        }
    }

    int ans = kInf;
    for (int y = 0; y < n; y++)
    for (int x = 0; x < m; x++)
    for (int k = 0; k < 4; k++) {
        ans = min(ans, dp[y][x][k][l]);
    }
    if (ans == kInf) ans = -1;

    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result