末日塔后传(Doomsday Tower Sequel) 题解

思路分析

按题目要求使用对应数据结构与算法模拟/递推求解，注意数据范围边界与时间复杂度。

参考代码

#include <iostream>
#include <vector>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    if (!(cin >> n)) return 0;
    if (n == 2 || n == 4) {
        cout << "NO\n";
        return 0;
    }
    cout << "YES\n";
    if (n == 1) {
        cout << "0\n";
        return 0;
    }
    vector<vector<int>> d(n, vector<int>(n, 0));
    if (n % 2 == 1) {
        int k = (n - 1) / 2;
        for (int i = 0; i < n; ++i) {
            for (int step = 1; step <= k; ++step) {
                d[i][(i + step) % n] = 1;
            }
        }
    } else {
        int m = n - 1;
        int k = (m - 1) / 2;
        for (int i = 0; i < m; ++i) {
            for (int step = 1; step <= k; ++step) {
                d[i][(i + step) % m] = 1;
            }
        }
        for (int i = 0; i < m; ++i) {
            if (i % 2 == 0) d[m][i] = 1;
            else d[i][m] = 1;
        }
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cout << d[i][j] << (j + 1 == n ? "\n" : " ");
        }
    }
    return 0;
}