結果

問題 No.3092 Tired Queen
コンテスト
ユーザー 👑 binap
提出日時 2025-04-06 15:59:18
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 95 ms / 2,000 ms
コード長 3,561 bytes
コンパイル時間 4,430 ms
コンパイル使用メモリ 253,152 KB
実行使用メモリ 10,496 KB
最終ジャッジ日時 2025-04-06 15:59:27
合計ジャッジ時間 8,459 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}
template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

int main(){
	int n;
	cin >> n;
	
	
	auto solve_even = [&](int n){
		int cnt = 1;
		vector<vector<int>> s(n, vector<int>(n));
		for(int i = 0; i < n / 2; i++){
			if(i % 2 == 0){
				for(int j = 0; j < n / 2; j++){
					s[2 * i][2 * j] = cnt;
					s[2 * i + 1][2 * j + 1] = cnt + 1;
					s[2 * i + 1][2 * j] = cnt + 2;
					s[2 * i][2 * j + 1] = cnt + 3;
					cnt += 4;
				}
			}else{
				for(int j = n / 2 - 1; j >= 0; j--){
					s[2 * i][2 * j + 1] = cnt;
					s[2 * i + 1][2 * j] = cnt + 1;
					s[2 * i + 1][2 * j + 1] = cnt + 2;
					s[2 * i][2 * j] = cnt + 3;
					cnt += 4;
				}
			}
		}
		return s;
	};
	
	auto solve_odd = [&](int n){
		auto s = solve_even(n - 1);
		vector<vector<int>> t(n, vector<int>(n));
		rep(i, n - 1) rep(j, n - 1) t[i][j] = s[i][j] + (n * n - (n - 1) * (n - 1));
		int cnt = (n * n - (n - 1) * (n - 1));
		if((n - 1) % 4 == 0){
			for(int i = 0; i < (n - 1) / 2; i++){
				t[n - 1][2 * i] = cnt;
				t[2 * i][n - 1] = cnt - 1;
				t[2 * i + 1][n - 1] = cnt - 2;
				t[n - 1][2 * i + 1] = cnt - 3;
				cnt -= 4;
			}
			t[n - 1][n - 1] = cnt;
		}else{
			for(int i = 0; i < (n - 1) / 2; i++){
				t[2 * i][n - 1] = cnt;
				t[n - 1][2 * i] = cnt - 1;
				t[n - 1][2 * i + 1] = cnt - 2;
				t[2 * i + 1][n - 1] = cnt - 3;
				cnt -= 4;
			}
			t[n - 1][n - 1] = cnt;
		}
		return t;
	};
	
	if(n % 2 == 0){
		auto s = solve_even(n);
		cout << s;
	}else{
		auto t = solve_odd(n);
		cout << t;
	}
	return 0;
}
0