結果
| 問題 |
No.3335 ReCT
|
| コンテスト | |
| ユーザー |
 cn_449
|
| 提出日時 | 2025-11-03 15:10:04 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 10,585 bytes |
| コンパイル時間 | 7,192 ms |
| コンパイル使用メモリ | 312,112 KB |
| 実行使用メモリ | 10,880 KB |
| 最終ジャッジ日時 | 2025-11-07 20:42:10 |
| 合計ジャッジ時間 | 12,153 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | WA * 2 |
| other | WA * 97 |
ソースコード
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <array>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <random>
#include <unordered_set>
#include <unordered_map>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define req(i, a, b) for (ll i = (a); i < (b); i++)
#define pb push_back
#define debug(x) cerr << __LINE__ << ' ' << #x << ':' << (x) << '\n'
#define debug2(x, y) cerr << __LINE__ << ' ' << #x << ':' << (x) << ',' << #y << ':' << (y) << '\n'
#define debug3(x, y, z) cerr << __LINE__ << ' ' << #x << ':' << (x) << ',' << #y << ':' << (y) << ',' << #z << ':' << (z) << '\n'
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long double ld;
template<class T> using P = pair<T, T>;
template<class T> using pri_l = priority_queue<T>;
template<class T> using pri_s = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = 1000000010;
constexpr int inf2 = 2000000010;
constexpr ll INF = 1000000000000000010;
constexpr ll INF4 = 4000000000000000010;
constexpr int mod1e9 = 1000000007;
constexpr int mod998 = 998244353;
constexpr ld eps = 1e-12;
constexpr ld pi = 3.141592653589793238;
constexpr ll ten(int n) { return n ? 10 * ten(n - 1) : 1; };
int dx[] = { 1,0,-1,0,1,1,-1,-1,0 }; int dy[] = { 0,1,0,-1,1,-1,1,-1,0 };
ll mul(ll a, ll b) { return (b != 0 && a > INF / b ? INF : a * b); }
void fail() { cout << "-1\n"; exit(0); } void no() { cout << "No\n"; exit(0); }
template<class T> void er(T a) { cout << a << '\n'; exit(0); }
template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return true; } return false; }
template<class T> istream& operator >>(istream& s, vector<T>& v) { for (auto& e : v) s >> e; return s; }
template<class T> ostream& operator <<(ostream& s, const vector<T>& v) { for (auto& e : v) s << e << ' '; return s; }
template<class T, class U> ostream& operator << (ostream& s, const pair<T, U>& p) { s << p.first << ' ' << p.second; return s; }
struct fastio {
fastio() {
cin.tie(0); cout.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
cerr << fixed << setprecision(20);
}
}fastio_;
namespace rdv {
random_device seed_gen;
mt19937_64 engine(seed_gen());
ll rnum(ll r) { return engine() % r; } // [0, r)
ll rnum(ll l, ll r) { return rnum(r - l) + l; } // [l, r)
ll rng(ll l, ll r) { return rnum(l, r + 1); } // [l, r]
double rng01() { return engine() * pow(2, -64); }
template<class T> void shuf(vector<T>& v) { shuffle(all(v), engine); }
void shuf(string& s) { shuffle(all(s), engine); }
}
using namespace rdv;
template<class T> vector<int> compress(vector<T> v) {
int n = v.size();
vector<T> tmp = v;
sort(tmp.begin(), tmp.end());
tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());
vector<int> res(n);
for (int i = 0; i < n; i++) res[i] = lower_bound(tmp.begin(), tmp.end(), v[i]) - tmp.begin();
return res;
}
#include <atcoder/all>
using namespace atcoder;
constexpr ll mod = mod998;
using mint = static_modint<mod>;
istream& operator >>(istream& s, mint& m) { ll y; s >> y; m = y; return s; }
ostream& operator <<(ostream& s, mint& m) { return s << m.val(); }
ostream& operator <<(ostream& s, const vector<mint>& v) { for (auto& e : v) s << e.val() << ' '; return s; }
vector<mint> fac, inv, facinv;
void modcalc(int n) {
fac.resize(n); inv.resize(n); facinv.resize(n);
fac[0] = 1; fac[1] = 1; inv[1] = 1;
facinv[0] = 1; facinv[1] = 1;
for (ll i = 2; i < n; i++) {
fac[i] = fac[i - 1] * i;
inv[i] = -inv[mod % i] * (mod / i);
facinv[i] = facinv[i - 1] * inv[i];
}
}
mint comb(ll n, ll k) {
if (n < 0 || k < 0 || n < k) return 0;
return fac[n] * facinv[k] * facinv[n - k];
}
mint perm(ll n, ll k) {
if (n < 0 || k < 0 || n < k) return 0;
return fac[n] * facinv[n - k];
}
mint hom(ll n, ll k) {
if (n < 0 || k < 0 || n == 0 && k > 0) return 0;
if (n == 0 && k == 0) return 1;
return fac[n + k - 1] * facinv[k] * facinv[n - 1];
}
// ひとまずセットとして 1 回走る, 16:40-
int main() {
bool DEBUG = false;
int TEST = 1;
if (DEBUG) cin >> TEST;
while (TEST--) {
int h, w;
cin >> h >> w;
if (h == 2 or w == 2) {
cout << "-1\n";
cout << "-1\n";
cout << "-1\n";
continue;
}
bool rev = false;
if (h > w) {
rev = true;
swap(h, w);
}
auto F = [&](auto F, int n, int m, int mode) -> pair<int, vector<vector<int>>> {
// 1 : C, 2 : T, 3 : CT
int mx = -1;
vector a(n, vector<int>(m, -1));
assert(n <= m);
if (mode == 1) {
if (n == 3) {
if (m % 2 != 0) return { mx, a };
else {
if (m % 4 == 0) {
rep(i, m / 4) {
a[0][4 * i] = a[0][4 * i + 1] = a[0][4 * i + 2] = a[1][4 * i] = a[1][4 * i + 2] = a[2][4 * i] = 2 * i + 1;
a[0][4 * i + 3] = a[1][4 * i + 1] = a[1][4 * i + 3] = a[2][4 * i + 1] = a[2][4 * i + 2] = a[2][4 * i + 3] = 2 * i + 2;
}
}
else {
assert(m >= 6);
assert(m % 4 == 2);
rep(i, (m - 6) / 4) {
a[0][4 * i] = a[0][4 * i + 1] = a[0][4 * i + 2] = a[1][4 * i] = a[1][4 * i + 2] = a[2][4 * i] = 2 * i + 1;
a[0][4 * i + 3] = a[1][4 * i + 1] = a[1][4 * i + 3] = a[2][4 * i + 1] = a[2][4 * i + 2] = a[2][4 * i + 3] = 2 * i + 2;
}
mx = (m - 6) / 4 * 2;
a[0][m - 6] = a[0][m - 5] = a[0][m - 4] = a[1][m - 6] = a[1][m - 4] = a[2][m - 6] = mx + 1;
a[0][m - 3] = a[0][m - 2] = a[0][m - 1] = a[1][m - 3] = a[1][m - 1] = a[2][m - 1] = mx + 2;
a[1][m - 5] = a[1][m - 2] = a[2][m - 5] = a[2][m - 4] = a[2][m - 3] = a[2][m - 2] = mx + 3;
}
rep(i, n) rep(j, m) chmax(mx, a[i][j]);
return { mx, a };
}
}
else if (n == 4) {
rep(i, m) a[0][i] = 1;
a[1][0] = 1;
for (int i = 1; i < m; i++) a[1][i] = 2;
rep(i, m - 1) a[2][i] = 1;
a[2][m - 1] = 2;
rep(i, m) a[3][i] = 2;
rep(i, n) rep(j, m) chmax(mx, a[i][j]);
return { mx, a };
}
else if (n == 5 && m % 2 == 0) {
auto pre = F(F, n - 2, m - 2, 1);
mx = pre.first;
rep(i, m) {
if (i < 3) {
a[0][i] = mx + 1;
a[n - 1][i] = mx + 1;
}
else {
a[0][i] = mx + 2;
a[n - 1][i] = mx + 2;
}
}
for (int i = 1; i < n - 1; i++) {
a[i][0] = mx + 1;
for (int j = 1; j < m - 1; j++) a[i][j] = pre.second[i - 1][j - 1];
a[i][m - 1] = mx + 2;
}
mx += 2;
return { mx, a };
}
else {
auto pre = F(F, n - 2, m - 1, 1);
mx = pre.first;
rep(i, m) {
a[0][i] = mx + 1;
a[n - 1][i] = mx + 1;
}
for (int i = 1; i < n - 1; i++) {
a[i][0] = mx + 1;
for (int j = 1; j < m; j++) a[i][j] = pre.second[i - 1][j - 1];
}
mx++;
return { mx, a };
}
}
else if (mode == 2) {
if (n == 3) {
if (m <= 5) {
return { mx, a };
}
else {
a[0][0] = a[1][0] = a[1][1] = a[2][0] = 1;
a[1][2] = 2;
a[1][3] = 3;
for (int j = 4; j < m; j++) a[1][j] = 4;
for (int j = 1; j < m - 1; j++) {
a[0][j] = 2;
a[2][j] = 3;
}
a[0][m - 1] = 4;
a[2][m - 1] = 4;
return { 4, a };
}
}
else if (n == 4) {
a[0][0] = 1;
rep(j, m - 2) a[1][j] = 1;
a[2][0] = 1;
for (int j = 1; j < m; j++) a[0][j] = 2;
a[1][m - 2] = 2;
a[2][1] = 3;
rep(j, m - 1) a[3][j] = 3;
a[1][m - 1] = 4;
for (int j = 2; j < m; j++) a[2][j] = 4;
a[3][m - 1] = 4;
return { 4, a };
}
else if (n == 5) {
a[0][0] = 1;
rep(j, m - 2) a[1][j] = 1;
a[2][0] = 1;
for (int j = 1; j < m; j++) a[0][j] = 2;
a[1][m - 2] = 2;
a[2][1] = 3;
rep(j, m - 2) a[3][j] = 3;
a[1][m - 1] = 4;
for (int j = 2; j < m; j++) a[2][j] = 4;
a[3][m - 1] = 4;
a[3][m - 2] = 5;
rep(j, m) a[4][j] = 5;
return { 5, a };
}
else {
assert(m >= 6);
auto p0 = F(F, n - 3, m, 2);
auto p1 = F(F, 3, m, 2);
rep(i, n - 3) rep(j, m) a[i][j] = p0.second[i][j];
mx = p0.first;
rep(i, 3) rep(j, m) a[n - 3 + i][j] = p1.second[i][j] + mx;
mx += p1.first;
return { mx, a };
}
}
else {
if (n == 3) {
rep(i, m - 1) {
a[0][i] = 1;
a[1][i + 1] = 2;
a[2][i] = 1;
}
a[0][m - 1] = 2;
a[1][0] = 1;
a[2][m - 1] = 2;
return { 2, a };
}
else if (n == 4) {
rep(i, m - 1) {
a[0][i] = 1;
a[1][i + 1] = 2;
if (i != m - 2) a[2][i] = 1;
}
rep(i, m) a[3][i] = 3;
a[0][m - 1] = 2;
a[1][0] = 1;
a[2][m - 2] = 3;
a[2][m - 1] = 2;
return { 3, a };
}
else if (n == 5) {
rep(i, m) {
a[0][i] = 1;
a[4][i] = 4;
}
rep(i, m - 2) {
a[1][i] = 2;
a[3][i] = 2;
}
for (int i = 1; i < m; i++) {
a[2][i] = 3;
}
a[1][m - 2] = 1;
a[1][m - 1] = 3;
a[2][0] = 2;
a[3][m - 2] = 4;
a[3][m - 1] = 3;
return { 4, a };
}
else {
auto p0 = F(F, n - 3, m, 3);
auto p1 = F(F, 3, m, 3);
rep(i, n - 3) rep(j, m) a[i][j] = p0.second[i][j];
mx = p0.first;
rep(i, 3) rep(j, m) a[n - 3 + i][j] = p1.second[i][j] + mx;
mx += p1.first;
return { mx, a };
}
}
};
auto C = F(F, h, w, 1).second;
auto T = F(F, h, w, 2).second;
auto CT = F(F, h, w, 3).second;
if (rev) {
{
vector res(w, vector<int>(h));
rep(i, h) rep(j, w) res[j][i] = C[i][j];
C = res;
}
{
vector res(w, vector<int>(h));
rep(i, h) rep(j, w) res[j][i] = T[i][j];
T = res;
}
{
vector res(w, vector<int>(h));
rep(i, h) rep(j, w) res[j][i] = CT[i][j];
CT = res;
}
swap(h, w);
}
int c = -1, t = -1, ct = -1;
rep(i, h) rep(j, w) {
chmax(c, C[i][j]);
chmax(t, T[i][j]);
chmax(ct, CT[i][j]);
}
cout << c << '\n';
if (c != -1) rep(i, h) rep(j, w) cout << C[i][j] << " \n"[j == w - 1];
cout << t << '\n';
if (t != -1) rep(i, h) rep(j, w) cout << T[i][j] << " \n"[j == w - 1];
cout << ct << '\n';
if (ct != -1) rep(i, h) rep(j, w) cout << CT[i][j] << " \n"[j == w - 1];
}
cout << "-\n";
}