CodeForces - 590C Three States

博主的 BiBi 时间

我真的好菜啊。。。

感觉都是老套路了，还是不会。。。

Solution

枚举中介点。预处理出每个点与三个城市的最短距离（注意这里用优先队列存储，因为增添步数并不是顺次增加的）然后累加即可。

注意特判为 ‘.’ 的情况：会被两个城市计算重复。

Code

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

const int N = 1005, inf = 0x7f7f7f7f;

int n, m, dir[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}, d[N][N][3];
char g[N][N];
bool vis[N][N];
struct node {
    int x, y, s;

    bool operator < (const node a) const {return s > a.s;}
};
priority_queue <node> q;

int read() {
    int x = 0, f = 1; char s;
    while((s = getchar()) > '9' || s < '0') if(s == '-') f = -1;
    while(s >= '0' && s <= '9') x = (x << 1) + (x << 3) + (s ^ 48), s = getchar();
    return x * f;
}

void bfs(const int op) {
    memset(vis, 0, sizeof vis);
    for(int i = 0; i < n; ++ i)
        for(int j = 0; j < m; ++ j)
            if(g[i][j] == op + '1')
                q.push((node) {i, j, 0}), d[i][j][op] = 0, vis[i][j] = 1;
    while(! q.empty()) {
        node t = q.top(); q.pop(); 
        for(int i = 0; i < 4; ++ i) {
            int tx = t.x + dir[i][0];
            int ty = t.y + dir[i][1];
            if(tx < 0 || tx >= n || ty < 0 || ty >= m || g[tx][ty] == '#' || vis[tx][ty]) continue;
			int step = t.s;
            if(g[tx][ty] == '.') ++ step;
            vis[tx][ty] = 1; d[tx][ty][op] = step;
            q.push((node) {tx, ty, step});
        }
    }
}

int main() {
	int ans = inf;
    memset(d, 0x7f, sizeof d);
    n = read(), m = read();
    for(int i = 0; i < n; ++ i) scanf("%s", g[i]);
    for(int i = 0; i < 3; ++ i) bfs(i);
    for(int i = 0; i < n; ++ i)
        for(int j = 0; j < m; ++ j)
            if(d[i][j][0] != inf && d[i][j][1] != inf && d[i][j][2] != inf)
            	ans = min(ans, g[i][j] == '.' ? d[i][j][0] + d[i][j][1] + d[i][j][2] - 2 : d[i][j][0] + d[i][j][1] + d[i][j][2]);
    printf("%d\n", ans == inf ? -1 : ans);
    return 0;
}