結果

問題 No.2112 All 2x2 are Equal
ユーザー 👑 emthrm
提出日時 2022-10-28 22:12:56
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 76 ms / 2,000 ms
コード長 2,898 bytes
コンパイル時間 2,378 ms
コンパイル使用メモリ 203,960 KB
最終ジャッジ日時 2025-02-08 14:35:21
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 34
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
IOSetup() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << fixed << setprecision(20);
}
} iosetup;
vector<vector<int>> solve(const int h, const int w) {
assert(w % 2 == 0);
vector a(h, vector(w, -1));
int cur = 1;
REP(i, h) {
if (i % 2 == 0) {
for (int j = 0; j < w; j += 2) {
a[i][j] = cur++;
}
} else {
for (int j = (w - 1) / 2 * 2; j >= 0; j -= 2) {
a[i][j] = cur++;
}
}
}
for (int i = h - 1; i >= 0; --i) {
if ((h - 1 - i) % 2 == 0) {
for (int j = w - 1; j >= 0; --j) {
if (a[i][j] == -1) a[i][j] = cur++;
}
} else {
REP(j, w) {
if (a[i][j] == -1) a[i][j] = cur++;
}
}
}
return a;
}
template <typename T>
std::vector<std::vector<T>> rotate(const std::vector<std::vector<T>>& grid,
const int angle, const T space = ' ') {
const int h = grid.size(), w = grid.front().size();
std::vector<std::vector<T>> rotated_grid;
if (angle == 45) {
rotated_grid.assign(h + w - 1, std::vector<T>(h + w - 1, space));
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
rotated_grid[i + j][i - j + w - 1] = grid[i][j];
}
}
} else if (angle == 90) {
rotated_grid.assign(w, std::vector<T>(h));
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
rotated_grid[w - 1 - j][i] = grid[i][j];
}
}
} else {
assert(false);
}
return rotated_grid;
}
int main() {
int h, w; cin >> h >> w;
vector<vector<int>> a;
if (h % 2 == 1 && w % 2 == 1) {
a = vector(h, vector(w, 0));
REP(i, h) REP(j, w) {
const int v = i * w + j + 1;
a[i][j] = ((i + j) % 2 == 0 ? v : h * w - v + 1);
}
} else if (w % 2 == 1) {
a = solve(w, h);
a = rotate(a, 90);
} else {
a = solve(h, w);
}
const int s = a[0][0] + a[0][1] + a[1][0] + a[1][1];
REP(i, h - 1) REP(j, w - 1) {
assert(a[i][j] + a[i][j + 1] + a[i + 1][j] + a[i + 1][j + 1] == s);
}
cout << "Yes\n";
REP(i, h) REP(j, w) cout << a[i][j] << " \n"[j + 1 == w];
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0