結果

問題 No.217 魔方陣を作ろう
ユーザー fumiphysfumiphys
提出日時 2019-10-06 15:42:39
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,006 bytes
コンパイル時間 1,744 ms
コンパイル使用メモリ 171,316 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2024-10-10 03:46:09
合計ジャッジ時間 2,771 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 WA -
testcase_04 AC 2 ms
6,820 KB
testcase_05 AC 2 ms
6,820 KB
testcase_06 AC 2 ms
6,816 KB
testcase_07 WA -
testcase_08 AC 2 ms
6,820 KB
testcase_09 AC 2 ms
6,816 KB
testcase_10 AC 2 ms
6,816 KB
testcase_11 WA -
testcase_12 AC 2 ms
6,816 KB
testcase_13 AC 2 ms
6,824 KB
testcase_14 AC 2 ms
6,820 KB
testcase_15 WA -
testcase_16 AC 2 ms
6,816 KB
testcase_17 AC 2 ms
6,820 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

int r[21][21];
int c[21][21];

int main(int argc, char const* argv[])
{
  int n; cin >> n;
  if(n & 1){
    int x = 0, y = n / 2;
    rep(i, n * n){
      r[x][y] = i + 1;
      x = (x - 1 + n) % n;
      y = (y + 1) % n;
      if(r[x][y] > 0){
        x = (x + 2) % n;
        y = (y - 1 + n) % n;
      }
    }
  }else if(n % 4 == 0){
    vector<bool> used(n * n, false);
    for(int i = 0; i < n; i++){
      for(int j = 0; j < n; j++){
        if(i % 4 == 0 || i % 4 == 3){
          if(j % 4 == 0 || j % 4 == 3){
            r[i][j] = i * n + j + 1;
            used[i * n + j] = true;
          }
        }else{
          if(j % 4 == 1 || j % 4 == 2){
            r[i][j] = i * n + j + 1;
            used[i * n + j] = true;
          }
        }
      }
    }
    for(int i = n - 1; i >= 0; i--){
      for(int j = n - 1; j >= 0; j--){
        if(r[i][j] > 0)continue;
        for(int k = 0; k < n * n; k++){
          if(!used[k]){
            r[i][j] = k + 1;
            used[k] = true;
            break;
          }
        }
      }
    }
  }else{
    int m = n / 2;
    int x = 0, y = m / 2;
    rep(i, m * m){
      c[x][y] = i + 1;
      x = (x - 1 + m) % m;
      y = (y + 1) % m;
      if(c[x][y] > 0){
        x = (x + 2) % m;
        y = (y - 1 + m) % m;
      }
    }
    rep(i, m)rep(j, m){
      c[i][j] = 4 * (c[i][j] - 1);
    }
    rep(i, m){
      rep(j, m){
        if((i <= m / 2 && j != m / 2) || (i == m / 2 + 1 && j == m / 2)){
          r[2*i][2*j] = c[i][j] + 4;
          r[2*i+1][2*j] = c[i][j] + 2;
          r[2*i][2*j+1] = c[i][j] + 1;
          r[2*i+1][2*j+1] = c[i][j] + 3;
        }else if((i == m / 2 + 1 && j != m / 2) || (i == m / 2 && j == m / 2)){
          r[2*i][2*j] = c[i][j] + 1;
          r[2*i+1][2*j] = c[i][j] + 2;
          r[2*i][2*j+1] = c[i][j] + 4;
          r[2*i+1][2*j+1] = c[i][j] + 3;
        }else{
          r[2*i][2*j] = c[i][j] + 1;
          r[2*i+1][2*j] = c[i][j] + 3;
          r[2*i][2*j+1] = c[i][j] + 4;
          r[2*i+1][2*j+1] = c[i][j] + 2;
        }
      }
    }
  }
  rep(i, n)rep(j, n){
    cout << r[i][j] << "\n "[j + 1 != n];
  }
  return 0;
}
0