提出 #1624552

---

ソースコード 拡げる

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;
using ll = long long;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
constexpr ll TEN(int n) { return (n==0) ? 1 : 10*TEN(n-1); }

const int MN = 103;

V<int> g[MN*MN];
int dist[MN*MN], dist_buf[MN*MN];

void cdist(int s) {
    fill_n(dist, MN*MN, TEN(9));
    bool vis[MN*MN] = {};
    queue<int> q;
    q.push(s);
    dist[s] = 0;
    while (!q.empty()) {
        int p = q.front(); q.pop();
        if (vis[p]) continue;
        vis[p] = true;
        for (int d: g[p]) {
            dist[d] = min(dist[d], dist[p] + 1);
            q.push(d);
        }
    }
}

int main() {
    int n;
    cin >> n;
    int m = 2*(n*n-n);
    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b; a--; b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    for (int i = 0; i < n*n; i++) {
        if (g[i].size() == 2) {
//            cout << "ONE " << i << endl;
            cdist(i);
            break;
        }
    }
    copy_n(dist, n*n, dist_buf);
    for (int i = 0; i < n*n; i++) {
        if (g[i].size() == 2 && dist[i] == (n-1)) {
//            cout << "TWO " << i << endl;
            cdist(i);
            break;
        }
    }
    int mp[MN][MN];
    for (int i = 0; i < n*n; i++) {
        int a = dist_buf[i];
        int b = dist[i];
        int x = (a+b-(n-1))/2;
        int y = (a-b+n-1)/2;
//        cout << "map " << i << " " << a << " " << b << " " << x << " " << y << endl;
        mp[x][y] = i;
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cout << 1+mp[i][j];
            if (j < n-1) cout << " ";
        }
        cout << endl;
    }
    return 0;
}

提出情報

ジャッジ結果