Submission #63039216

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
using pii = pair<int, int>;

const int N = 105;

int n, d[N][N];
char e[N][N];
queue<pii> q;
bool b[N][N];

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cin >> n;
  memset(d, 0x3f, sizeof d);
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      cin >> e[i][j];
      if (e[i][j] != '-') {
        q.emplace(i, j), d[i][j] = 1;
      }
    }
  }
  for (int i = 1; i <= n; ++i) {
    q.emplace(i, i), d[i][i] = 0;
  }
  while (!q.empty()) {
    int x = q.front().first, y = q.front().second;
    q.pop();
    if (b[x][y]) {
      continue;
    }
    b[x][y] = 1;
    for (int i = 1; i <= n; ++i) {
      for (int j = 1; j <= n; ++j) {
        if (e[i][x] == e[y][j] && e[i][x] != '-') {
          if (d[i][j] > d[x][y] + 2) {
            d[i][j] = d[x][y] + 2, q.emplace(i, j);
          }
        }
      }
    }
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      cout << (d[i][j] > 1e9 ? -1 : d[i][j]) << ' ';
    }
    cout << '\n';
  }
  return 0;
}

Submission Info

Judge Result