結果

問題 No.2958 Placing Many L-s
ユーザー ecottea
提出日時 2024-10-23 00:30:42
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 25 ms / 2,000 ms
コード長 10,972 bytes
コンパイル時間 4,961 ms
コンパイル使用メモリ 275,624 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-11-08 20:50:42
合計ジャッジ時間 7,789 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 29
権限があれば一括ダウンロードができます

ソースコード

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

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; using ull = unsigned long long; // -2^63 2^63 = 9e18int -2^31 2^31 = 2e9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
int DX[4] = { 1, 0, -1, 0 }; // 4
int DY[4] = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d
#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) //
//
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
template <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }
template <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // mod
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
using mint = modint998244353;
//using mint = static_modint<1000000009>;
//using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(...)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE MLE
#endif
// 0:00
// 0:01 4x2
// T
//T-O(?)
/*
* h×w T-
* i i
*
*
*/
vvvi enumerate_Ttetromino_tiling(int h, int w) {
// board[i][j] : (i, j) -1
vvi board(h, vi(w, -1));
vvvi boards;
// board[i][j] -2
auto get = [&](int i, int j) {
if (i < 0 || j < 0 || i >= h || j >= w) return -2;
return board[i][j];
};
// 使
// {0, 0}
vector<vector<pii>> pieces{
{ {0, 0}, {1, 0}, {1, 1}, {1, 2} }, // ┬
{ {0, 0}, {1, 0}, {2, 0}, {2, 1} }, // ├
{ {0, 0}, {0, 1}, {0, 2}, {1, 2} }, // ┴
{ {0, 0}, {0, 1}, {1, 1}, {2, 1} }, // ┤
{ {0, 0}, {0, 1}, {0, 2}, {1, 0} },
{ {0, 0}, {0, 1}, {1, 0}, {2, 0} },
{ {0, 0}, {1, 0}, {2, 0}, {2, -1} },
{ {0, 0}, {1, 0}, {1, -1}, {1, -2} }
};
// (i, j):
function<void(int, int, int)> dfs = [&](int i, int j, int id) {
//
if (i == h) {
boards.push_back(board);
return;
}
// 1
if (j == w) {
dfs(i + 1, 0, id);
return;
}
// 1
if (get(i, j) >= 0) {
dfs(i, j + 1, id);
return;
}
//
repe(piece, pieces) {
bool ok = true;
for (auto& [di, dj] : piece) {
if (get(i + di, j + dj) != -1) {
ok = false;
break;
}
}
if (!ok) continue;
for (auto& [di, dj] : piece) board[i + di][j + dj] = id;
dfs(i, j + 1, id + 1);
for (auto& [di, dj] : piece) board[i + di][j + dj] = -1;
}
};
dfs(0, 0, 0);
return boards;
}
void zikken() {
int lim = 10;
repi(h, 1, lim) repi(w, 1, lim) {
auto res = enumerate_Ttetromino_tiling(h, w);
if (!res.empty()) dump(h, w, ":", sz(res));
}
exit(0);
}
/*
1 1 : 0
1 2 : 0
1 3 : 0
1 4 : 0
1 5 : 0
2 1 : 0
2 2 : 0
2 3 : 0
2 4 : 2
2 5 : 0
3 1 : 0
3 2 : 0
3 3 : 0
3 4 : 0
3 5 : 0
4 1 : 0
4 2 : 2
4 3 : 0
4 4 : 10
4 5 : 0
5 1 : 0
5 2 : 0
5 3 : 0
5 4 : 0
5 5 : 0
// 0:07
2 4 : 2
2 8 : 4
3 8 : 4 // 0:09 !!!!
4 2 : 2
4 4 : 10
4 6 : 42
4 8 : 182
4 10 : 790
5 8 : 436
6 4 : 42
6 8 : 4340
7 8 : 16708
8 2 : 4
8 3 : 4
8 4 : 182
8 5 : 436
8 6 : 4340
8 7 : 16708
8 8 : 141970
8 9 : 611468
8 10 : 4417084
9 8 : 611468
*/
void zikken2() {
int h = 4, w = 6;
auto res = enumerate_Ttetromino_tiling(h, w);
dumpel(res[0]);
exit(0);
}
/*
0: 0 1 1 1 2 2 2 3
1: 0 1 4 5 5 5 2 3
2: 0 0 4 4 4 5 3 3
*/
//O(h w)
/*
* a[0..h)[0..w)
*/
template <class T>
vector<vector<T>> transpose(const vector<vector<T>>& a) {
// verify : https://yukicoder.me/problems/no/1974
int h = sz(a), w = sz(a[0]);
vector<vector<T>> b(w, vector<T>(h));
rep(i, h) rep(j, w) b[j][i] = a[i][j];
return b;
}
void Main() {
int h, w;
cin >> h >> w;
bool swap_flag = false;
if ((h % 4 == 0 && w % 2 == 0) || (h % 8 == 0 && w % 2 == 1 && w >= 3)) {
swap_flag = true;
swap(h, w);
}
vvi a(h, vi(w, -1));
// 0:16
// × 4
// 3 x 8
//
int id = 1;
if (h % 2 == 0 && w % 4 == 0) {
rep(i, h / 2) rep(j, w / 4) {
a[2 * i + 0][4 * j + 0] = id;
a[2 * i + 0][4 * j + 1] = id;
a[2 * i + 0][4 * j + 2] = id;
a[2 * i + 1][4 * j + 0] = id;
id++;
a[2 * i + 1][4 * j + 1] = id;
a[2 * i + 1][4 * j + 2] = id;
a[2 * i + 1][4 * j + 3] = id;
a[2 * i + 0][4 * j + 3] = id;
id++;
}
}
else if (h % 2 == 1 && h >= 3 && w % 8 == 0) {
rep(j, w / 8) {
a[0][8 * j + 0] = id;
a[1][8 * j + 0] = id;
a[2][8 * j + 0] = id;
a[2][8 * j + 1] = id;
id++;
a[0][8 * j + 1] = id;
a[0][8 * j + 2] = id;
a[0][8 * j + 3] = id;
a[1][8 * j + 1] = id;
id++;
a[1][8 * j + 2] = id;
a[2][8 * j + 2] = id;
a[2][8 * j + 3] = id;
a[2][8 * j + 4] = id;
id++;
a[1][8 * j + 3] = id;
a[1][8 * j + 4] = id;
a[1][8 * j + 5] = id;
a[2][8 * j + 5] = id;
id++;
a[0][8 * j + 4] = id;
a[0][8 * j + 5] = id;
a[0][8 * j + 6] = id;
a[1][8 * j + 6] = id;
id++;
a[0][8 * j + 7] = id;
a[1][8 * j + 7] = id;
a[2][8 * j + 7] = id;
a[2][8 * j + 6] = id;
id++;
}
repi(i, 0, (h - 3) / 2 - 1) rep(j, w / 4) {
a[3 + 2 * i + 0][4 * j + 0] = id;
a[3 + 2 * i + 0][4 * j + 1] = id;
a[3 + 2 * i + 0][4 * j + 2] = id;
a[3 + 2 * i + 1][4 * j + 0] = id;
id++;
a[3 + 2 * i + 1][4 * j + 1] = id;
a[3 + 2 * i + 1][4 * j + 2] = id;
a[3 + 2 * i + 1][4 * j + 3] = id;
a[3 + 2 * i + 0][4 * j + 3] = id;
id++;
}
}
else {
cout << -1 << "\n";
return;
}
if (swap_flag) {
swap(h, w);
a = transpose(a);
}
cout << id - 1 << "\n";
rep(i, h) {
rep(j, w) cout << a[i][j] << " \n"[j == w - 1];
}
// 0:29
}
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
// zikken2();
int t = 1;
cin >> t; //
while (t--) {
dump("------------------------------");
Main();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0