結果
問題 | No.217 魔方陣を作ろう |
ユーザー | heno239 |
提出日時 | 2020-08-15 20:26:01 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,129 bytes |
コンパイル時間 | 1,427 ms |
コンパイル使用メモリ | 128,828 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-10 22:42:10 |
合計ジャッジ時間 | 2,293 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | WA | - |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 2 ms
5,248 KB |
testcase_13 | WA | - |
testcase_14 | AC | 2 ms
5,248 KB |
testcase_15 | AC | 2 ms
5,248 KB |
testcase_16 | AC | 2 ms
5,248 KB |
testcase_17 | WA | - |
ソースコード
#include<iostream>#include<string>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>#include<functional>#include<iomanip>#include<queue>#include<ciso646>#include<random>#include<map>#include<set>#include<bitset>#include<stack>#include<unordered_map>#include<utility>#include<cassert>#include<complex>#include<numeric>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;constexpr ll mod =1000000007;const ll INF = mod * mod;typedef pair<int, int>P;#define stop char nyaa;cin>>nyaa;#define rep(i,n) for(int i=0;i<n;i++)#define per(i,n) for(int i=n-1;i>=0;i--)#define Rep(i,sta,n) for(int i=sta;i<n;i++)#define rep1(i,n) for(int i=1;i<=n;i++)#define per1(i,n) for(int i=n;i>=1;i--)#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)#define all(v) (v).begin(),(v).end()typedef pair<ll, ll> LP;typedef double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-12;const ld pi = acos(-1.0);ll mod_pow(ll x, ll n, ll m = mod) {ll res = 1;while (n) {if (n & 1)res = res * x % m;x = x * x % m; n >>= 1;}return res;}struct modint {ll n;modint() :n(0) { ; }modint(ll m) :n(m) {if (n >= mod)n %= mod;else if (n < 0)n = (n % mod + mod) % mod;}operator int() { return n; }};bool operator==(modint a, modint b) { return a.n == b.n; }modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }modint operator+(modint a, modint b) { return a += b; }modint operator-(modint a, modint b) { return a -= b; }modint operator*(modint a, modint b) { return a *= b; }modint operator^(modint a, ll n) {if (n == 0)return modint(1);modint res = (a * a) ^ (n / 2);if (n % 2)res = res * a;return res;}ll inv(ll a, ll p) {return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);}modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }ll gcd(ll a, ll b) {if (a < b)swap(a, b);while (b) {ll r = a % b; a = b; b = r;}return a;}vector<vector<int>> ad[3] = { {{4,1},{2,3}},{{1,4},{2,3}},{{1,4},{3,2}} };vector<vector<int>> make_s(int n) {if (n % 2) {vector<vector<int>> res(n, vector<int>(n));vector<vector<bool>> used(n, vector<bool>(n, false));int x = 0, y = n / 2;rep1(i, n * n) {res[x][y] = i; used[x][y] = true;if (i < n * n) {int nx = x - 1, ny = y + 1;if (nx < 0)nx += n;if (ny == n)ny = 0;if (used[nx][ny]) {nx = x + 1, ny = y;if (nx == n)nx = 0;}x = nx, y = ny;}}return res;}if (n % 4 == 0) {vector<vector<int>> res(n, vector<int>(n));if (n == 4) {res = { {16,9,7,2},{3,6,12,13},{10,15,1,8},{5,4,14,11} };return res;}vector<vector<int>> col(n, vector<int>(n,0));int d = n / 2;rep(ax, 2)rep(ay, 2) {rep(i, d) {col[ax * d + i][ay * d + i] = 1;col[ax * d + i][ay * d + d - 1 - i] = 1;}}rep(i, n)rep(j, n) {if (col[i][j]) {res[i][j] = i * n + j + 1;}}per(i, n)per(j, n) {if (!col[i][j]) {res[i][j] = (n - 1 - i) * n + (n - 1 - j) + 1;}}return res;}int d = n / 2;vector<vector<int>> res(n, vector<int>(n));vector<vector<int>> p = make_s(d);rep(i, d)rep(j, d) {p[i][j] = (p[i][j] - 1) * 4;}rep(i, d)rep(j, d) {int lx = 2 * i, ly = 2 * j;int col = 0;if (i > d / 2 + 1)col = 2;else if (i < d / 2 + 1) {col = 0;if (i == d / 2 && j == d / 2)col = 1;}else {col = 1;if (j == d / 2)col = 0;}rep(s, 2)rep(t, 2) {res[lx + s][ly + t] = p[i][j]+ad[col][s][t];}}return res;}void solve() {int n; cin >> n;vector<vector<int>> ans = make_s(n);rep(i, n) {rep(j, n) {if (j > 0)cout << " ";cout << ans[i][j];}cout << "\n";}}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(15);//init_f();//init();//expr();//int t; cin >> t; rep(i, t)solve();return 0;}