提出 #59278779

---

ソースコード 拡げる

#include <iostream>
#include <vector>

using namespace std;

#define in(a)                                                                  \
    for (auto &x : a)                                                          \
        cin >> x;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define out(a)                                                                 \
    for (auto x : a)                                                           \
        cout << x;
#define pb push_back
#define int long long
typedef vector<int> vi;
typedef pair<int, int> pii;

vector<vector<char>> rotate(vector<vector<char>> v)
{
    int n = v.size();
    vector<vector<char>> cp(n, vector<char>(n, 'a'));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cp[j][n - i - 1] = v[i][j];
        }
    }
    return cp;
}
void solve()
{
    int n;
    cin >> n;
    vector<vector<char>> v(n, vector<char>(n));
    for (auto &x : v) {
        for (auto &y : x) {
            cin >> y;
        }
    }

    vector<vector<char>> one = rotate(v);
    vector<vector<char>> two = rotate(one);
    vector<vector<char>> three = rotate(two);

    vector<vector<vector<char>>> ans{v, one, two, three};

    for (int i = 0; i < n / 2; i++) {
        int cnt = (i + 1) % 4;
        for (int t = i; t < n - i; t++) {
            v[i][t] = ans[cnt][i][t];
            v[t][i] = ans[cnt][t][i];
            v[n-1-i][t] = ans[cnt][n-1-i][t];
            v[t][n-1-i]= ans[cnt][t][n-1-i];
        }
    }

    for (auto x : v) {
        out(x);
        cout << '\n';
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    // cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}

提出情報

ジャッジ結果