ZOJ 3890

BFS

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <queue>
using namespace std;
const int INF = ~0U >> 1;
const int maxn = 20 + 7;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1}; // shang you xia zuo
typedef pair<int, int> P;
int n, T, ans;
char str[maxn][maxn];
int vis[maxn][maxn][5][3];
struct node {
    int x, y;
    int d;
    int ok;
    int type;
    node(int xx, int yy, int dd, int t, int c = 0) : x(xx), y(yy), d(dd), type(t), ok(c) { }
};

int bfs() {
    memset(vis, 0, sizeof(vis));
    queue<node> que;
    que.push(node(0, 0, 0, 1));
    vis[0][0][1][0] = 1;
    while(!que.empty()) {
        struct node u = que.front(); que.pop();
        if(u.type == 0 || u.type == 2) {
            struct node a(u.x, u.y, u.d - 10, 3, u.ok); //zuo
            struct node b(u.x, u.y, u.d - 10, 1, u.ok);
            if(!vis[u.x][u.y][3][u.ok]) {
                que.push(a);
                vis[u.x][u.y][3][u.ok] = 1;
            }
            if(!vis[u.x][u.y][1][u.ok]) {
                que.push(b);
                vis[u.x][u.y][1][u.ok] = 1;
            }
        }
        else if(u.type == 1 || u.type == 3) {
            struct node a(u.x, u.y, u.d - 10, 0, u.ok);
            struct node b(u.x, u.y, u.d - 10, 2, u.ok);
            if(!vis[u.x][u.y][0][u.ok]) {
                que.push(a);
                vis[u.x][u.y][0][u.ok] = 1;
            }
            if(!vis[u.x][u.y][2][u.ok]) {
                que.push(b);
                vis[u.x][u.y][2][u.ok] = 1;
            }
        }
        if(str[u.x][u.y] == '3') {
            struct node v(u.x, u.y, u.d + 990, u.type, 1);
            if(!vis[u.x][u.y][u.type][1]) {
                que.push(v);
                vis[u.x][u.y][u.type][1] = 1;
            }
        }
        int q = u.type;
        int nx = u.x + dx[q], ny = u.y + dy[q];
        if(nx >= 0 && nx < n && ny >= 0 && ny < n && str[nx][ny] != '1' && str[nx][ny] != '2') {
            struct node v(nx, ny, u.d - 10, u.type, u.ok);
            if(!vis[nx][ny][u.type][u.ok]) {
                que.push(v);
                vis[nx][ny][u.type][u.ok] = 1;
            }
        }
        if(u.x == 0 && u.y == 0) {
            if(u.ok == 1) {
                return u.d - 10;
            }
        }
    }
    return -1;
}

int main() {
    scanf("%d", &T);
    while(T--) {
        memset(vis, 0, sizeof(vis));
        memset(str, 0, sizeof(str));
        scanf("%d", &n);
        int a, b, c;
        for(int i = 0; i < n; ++i)
            for(int j = 0; j < n; ++j)
                str[i][j] = '0';
        bool ok = true;
        while(scanf("%d%d%d", &a, &b, &c) != EOF) {
            if(a == -1 && b == -1 && c == -1) break;
            str[c][b] = a + '0';
            if(str[0][0] == '2') ok = false;
        }
        if(!ok) printf("-1\n");
        else {
            int ans = bfs();
            printf("%d\n", ans);
        }
    }
    return 0;
}