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

提出ソース

結果

問題	No.217 魔方陣を作ろう
ユーザー	hamray
提出日時	2021-04-03 10:50:20
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,571 bytes
コンパイル時間	1,891 ms
コンパイル使用メモリ	175,024 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-06-06 20:06:29
合計ジャッジ時間	2,845 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	WA	-
testcase_04	AC	1 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	WA	-
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	2 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	WA	-
testcase_12	AC	1 ms 5,376 KB
testcase_13	AC	2 ms 5,376 KB
testcase_14	AC	2 ms 5,376 KB
testcase_15	WA	-
testcase_16	AC	2 ms 5,376 KB
testcase_17	AC	2 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>

using namespace std;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, int> pii;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;


#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()

#define MOD 1000000007

template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}
const double EPS = 1e-12, PI = acos(-1);
const double pi = 3.141592653589793238462643383279;
  
typedef string::const_iterator State;
ll GCD(ll a, ll b){
  return (b==0)?a:GCD(b, a%b);
}
ll LCM(ll a, ll b){
  return a/GCD(a, b) * b;
}
template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }

  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }

  ModInt operator-() const { return ModInt(-x); }

  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

  bool operator==(const ModInt &p) const { return x == p.x; }

  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};

using modint = ModInt< 1000000007 >;
template< typename T >
struct Combination {
  vector< T > _fact, _rfact, _inv;

  Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
    _fact[0] = _rfact[sz] = _inv[0] = 1;
    for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;
    _rfact[sz] /= _fact[sz];
    for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);
    for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];
  }

  inline T fact(int k) const { return _fact[k]; }

  inline T rfact(int k) const { return _rfact[k]; }

  inline T inv(int k) const { return _inv[k]; }

  T P(int n, int r) const {
    if(r < 0 || n < r) return 0;
    return fact(n) * rfact(n - r);
  }

  T C(int p, int q) const {
    if(q < 0 || p < q) return 0;
    return fact(p) * rfact(q) * rfact(p - q);
  }

  T H(int n, int r) const {
    if(n < 0 || r < 0) return (0);
    return r == 0 ? 1 : C(n + r - 1, r);
  }
};

ll modpow(ll x, ll n, ll mod) {
  ll res = 1;
  while(n) {
    if(n&1) res = (res * x) % mod;
    x = (x * x) % mod;
    n >>= 1;
  }
  return res;
}

inline long long mod(long long a, long long m) {
    return (a % m + m) % m;
}

int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(12);
  
  int N; cin >> N;
  if(N%2 == 1) {
    vector<vector<int>> ans(N, vector<int>(N));
    int y = 0, x = N/2;
    int now = 1;
    while(now<=N*N) {
      if(ans[y][x] == 0) {
        ans[y][x] = now++;
        y = (y-1+N)%N;
        x = (x+1)%N;
      }else{
        y = (y+1)%N;
        x = (x-1+N)%N;

        y = (y+1)%N;
      }

    }
    REP(i,N) {
      REP(j,N) {
        if(j) cout << " ";
        cout << ans[i][j];
      }
      cout << endl;
    }
  }else if(N%4 == 0) {
    vector<vector<int>> tmp(N, vector<int>(N));
    vector<vector<int>> ans(N, vector<int>(N));
    for(int i=0; i<N; i+=4) {
      for(int j=0; j<N; j+=4) {
        tmp[i][j] = tmp[i][j+3] = tmp[i+1][j+1] = tmp[i+1][j+2] = tmp[i+2][j+1] = tmp[i+2][j+2] = tmp[i+3][j] = tmp[i+3][j+3] = 1;
      }
    }
    REP(i,N) {
      REP(j,N) {
        if(j) cout << " ";
        if(tmp[i][j]) cout << i*N+j+1;
        else cout << N*N-(i*N+j);
      }
      cout << endl;
    }
  }else{
    int n = (N-2)/4;
    n = 2*n+1;
    vector<vector<int>> tmp(n, vector<int>(n));
    vector<vector<int>> ans(N, vector<int>(N));
    int y = 0, x = n/2;
    int now = 1;
    while(now<=n*n) {
      if(tmp[y][x] == 0) {
        tmp[y][x] = now++;
        y = (y-1+n)%n;
        x = (x+1)%n;
      }else{
        y = (y+1)%n;
        x = (x-1+n)%n;

        y = (y+1)%n;
      }

    }
    REP(i,n)REP(j,n) tmp[i][j] = (tmp[i][j]-1)*4;
    REP(i,n) {
      REP(j,n) {
        if(i<=n/2) {
          if(j == n/2) {
            // U
            ans[2*i][2*j] = 1+tmp[i][j];
            ans[2*i][2*j+1] = 4+tmp[i][j];
            ans[2*i+1][2*j] = 2+tmp[i][j];
            ans[2*i+1][2*j+1] = 3+tmp[i][j];
          }else{
            // L
            ans[2*i][2*j] = 4+tmp[i][j];
            ans[2*i][2*j+1] = 1+tmp[i][j];
            ans[2*i+1][2*j] = 2+tmp[i][j];
            ans[2*i+1][2*j+1] = 3+tmp[i][j];
          }
        }else if(i == n/2+1) {
          if(j == n/2) {
            ans[2*i][2*j] = 4+tmp[i][j];
            ans[2*i][2*j+1] = 1+tmp[i][j];
            ans[2*i+1][2*j] = 2+tmp[i][j];
            ans[2*i+1][2*j+1] = 3+tmp[i][j];
          }else{
            ans[2*i][2*j] = 1+tmp[i][j];
            ans[2*i][2*j+1] = 4+tmp[i][j];
            ans[2*i+1][2*j] = 2+tmp[i][j];
            ans[2*i+1][2*j+1] = 3+tmp[i][j];
          }
        }else{
            ans[2*i][2*j] = 1+tmp[i][j];
            ans[2*i][2*j+1] = 4+tmp[i][j];
            ans[2*i+1][2*j] = 3+tmp[i][j];
            ans[2*i+1][2*j+1] = 2+tmp[i][j];
        }
      }
    }
    REP(i,N){
      REP(j,N) {
        if(j)cout << " ";
        cout << ans[i][j];
      }
      cout << endl;
    }
  }
  return 0;
}

yukicoder

結果

テストケース

ソースコード