#140843 (C++14) No.217 魔方陣を作ろう

• 問題: No.217 魔方陣を作ろう
• ユーザー: pekempey
• 提出日時: 2016-12-23 01:16:25
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 2 ms / 5,000 ms
• コード長: 1,984 bytes
• コンパイル時間: 1,798 ms
• コンパイル使用メモリ: 179,852 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-12-14 14:59:25
• 合計ジャッジ時間: 2,883 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

ファイルパターン	結果
other	AC * 18

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> oddMagicSquare(int n) {
    assert(n % 2 == 1);
    vector<vector<int>> a(n, vector<int>(n));
    int y = 0;
    int x = n / 2;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            a[y][x] = i * n + j + 1;
            x = (x + 1) % n;
            y = (y + n - 1) % n;
        }
        x = (x + n - 1) % n;
        y = (y + 2) % n;
    }
    return a;
}
vector<vector<int>> fourMagicSquare(int n) {
    assert(n % 4 == 0);
    vector<vector<int>> a(n, vector<int>(n));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (((i + 1) / 2 + (j + 1) / 2) % 2 == 0) {
                a[i][j] = i * n + j + 1;
            } else {
                a[n - 1 - i][n - 1 - j] = i * n + j + 1;
            }
        }
    }
    return a;
}
vector<vector<int>> fourTwoMagicSquare(int n) {
    assert(n % 4 == 2);
    auto b = oddMagicSquare(n / 2);
    for (int i = 0; i < n / 2; i++) {
        for (int j = 0; j < n / 2; j++) {
            b[i][j] = (b[i][j] - 1) * 4;
        }
    }
    vector<vector<int>> L = { { 4, 1 }, { 2, 3 } };
    vector<vector<int>> U = { { 1, 4 }, { 2, 3 } };
    vector<vector<int>> X = { { 1, 4 }, { 3, 2 } };
    vector<vector<int>> a(n, vector<int>(n));
    for (int i = 0; i < n / 2; i++) {
        for (int j = 0; j < n / 2; j++) {
            vector<vector<int>> A;
            if (i < n / 4) {
                A = L;
            } else if (i == n / 4) {
                if (j == n / 4) {
                    A = U;
                } else {
                    A = L;
                }
            } else if (i == n / 4 + 1) {
                if (j == n / 4) {
                    A = L;
                } else {
                    A = U;
                }
            } else {
                A = X;
            }
            for (int ii = 0; ii < 2; ii++) {
                for (int jj = 0; jj < 2; jj++) {
                    a[i * 2 + ii][j * 2 + jj] = b[i][j] + A[ii][jj];
                }
            }
        }
    }
    return a;
}
vector<vector<int>> magicSquare(int n) {
    if (n % 2 == 1) {
        return oddMagicSquare(n);
    } else if (n % 4 == 0) {
        return fourMagicSquare(n);
    } else {
        return fourTwoMagicSquare(n);
    }
}
int main() {
    int n;
    cin >> n;
    auto a = magicSquare(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cout << a[i][j] << " ";
        }
        cout << endl;
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX