結果

問題 No.3092 Tired Queen
コンテスト
ユーザー Jinapetto
提出日時 2025-04-06 17:18:59
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 59 ms / 2,000 ms
コード長 3,724 bytes
コンパイル時間 3,422 ms
コンパイル使用メモリ 281,856 KB
実行使用メモリ 7,844 KB
最終ジャッジ日時 2025-04-06 17:19:06
合計ジャッジ時間 6,943 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
//using mint = modint998244353;

//多倍長整数//
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
//using bint = mp::cpp_int;

const int INF = 1e9;
const int MOD = 998244353;
const long long LINF = 4e18;

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vvvvi = vector<vector<vector<vector<int>>>>;
using vvl = vector<vector<long long>>;
using vvvl = vector<vector<vector<long long>>>;
using vvvvl = vector<vector<vector<vector<long long>>>>;
using vvc = vector<vector<char>>;
using vvb = vector<vector<bool>>;
using vvvb = vector<vector<vector<bool>>>;
using vvvvb = vector<vector<vector<vector<bool>>>>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define dump(x)  cout << #x << " = " << (x) << endl;
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define ALL(obj) (obj).begin(),(obj).end()

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vvi a(n, vi(n, -1));
    if(n == 1){
        cout << 1 << endl;
        return 0;
    }
    if(n%2 == 0){
        int cur = 1;
        rep(i,n/2){
            a[i][i] = cur;
            rep(j,n - 2 - 2*i){
                if(j%2 == 0) a[i + j + 1][i] = a[i + j][i] + 3;
                else a[i + j + 1][i] = a[i + j][i] + 1;
            }
            a[n - 1 - i][n - 1 - i] = cur + 1;
            rep(j,n - 1 - 2*i){
                if(j%2 == 0) a[n - 1 - i][n - 2 - i - j] = a[n - 1 - i][n - 1 - i - j] + 1;
                else a[n - 1 - i][n - 2 - i - j] = a[n - 1 - i][n - 1 - i - j] + 3;
            }
            a[i][i + 1] = cur + (n - 2*i - 1)*4 - 1;
            rep(j,n - 2 - 2*i){
                if(j%2 == 0) a[i][j + 2 + i] = a[i][j + 1 + i] - 3;
                else a[i][j + 2 + i] = a[i][j + 1 + i] - 1;
            }
            if(a[n - 2 - i][n - 1 - i] == -1) a[n - 2 - i][n - 1 - i] = cur + (n - 2*i - 1)*4 - 2;
            rep(j,n - 3 - 2*i){
                if(j%2 == 0) a[n - 3 - i - j][n - 1 - i] = a[n - 2 - i - j][n - 1 - i] - 1;
                else a[n - 3 - i - j][n - 1 - i] = a[n - 2 - i - j][n - 1 - i] - 3;
            }
            cur += (n - 2*i - 1)*4;
        }
    }else{
        int cur = 1;
        rep(i,n/2 + 1){
            if(a[i][i] == -1) a[i][i] = cur;
            rep(j,n - 1 - 2*i){
                if(j%2 == 0) a[i + j + 1][i] = a[i + j][i] + 3;
                else a[i + j + 1][i] = a[i + j][i] + 1;
            }
            if(a[n - 1 - i][n - 1 - i] == -1) a[n - 1 - i][n - 1 - i] = cur + 1;
            rep(j,n - 2 - 2*i){
                if(j%2 == 0) a[n - 1 - i][n - 2 - i - j] = a[n - 1 - i][n - 1 - i - j] + 1;
                else a[n - 1 - i][n - 2 - i - j] = a[n - 1 - i][n - 1 - i - j] + 3;
            }
            if(a[i][i + 1] == -1) a[i][i + 1] = cur + (n - 2*i - 1)*4 - 1;
            rep(j,n - 3 - 2*i){
                if(j%2 == 0) a[i][j + 2 + i] = a[i][j + 1 + i] - 3;
                else a[i][j + 2 + i] = a[i][j + 1 + i] - 1;
            }
            if(a[n - 2 - i][n - 1 - i] == -1) a[n - 2 - i][n - 1 - i] = cur + (n - 2*i - 1)*4 - 2;
            rep(j,n - 2 - 2*i){
                if(j%2 == 0) a[n - 3 - i - j][n - 1 - i] = a[n - 2 - i - j][n - 1 - i] - 1;
                else a[n - 3 - i - j][n - 1 - i] = a[n - 2 - i - j][n - 1 - i] - 3;
            }
            cur += (n - 2*i - 1)*4;
        }
    }
    rep(i,n){
        rep(j,n) cout << a[i][j] << (j == n - 1 ? '\n' : ' ');
    }
    return 0;
}
0