結果
問題 |
No.1974 2x2 Flipper
|
ユーザー |
![]() |
提出日時 | 2022-06-27 19:00:50 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 94 ms / 2,000 ms |
コード長 | 2,762 bytes |
コンパイル時間 | 2,061 ms |
コンパイル使用メモリ | 123,364 KB |
最終ジャッジ日時 | 2025-01-30 01:03:25 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 25 |
ソースコード
#include <algorithm> #include <array> #include <bitset> #include <cassert> #include <ciso646> #include <cmath> #include <complex> #include <cstdio> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <random> #include <set> #include <stack> #include <string> #include <tuple> #include <unordered_map> #include <utility> #include <vector> using namespace std; typedef long long ll; const ll mod = 1000000007; const ll INF = (ll)1000000007 * 1000000007; typedef pair<int, int> P; #define rep(i, n) for (int i = 0; i < n; i++) #define per(i, n) for (int i = n - 1; i >= 0; i--) #define Rep(i, sta, n) for (int i = sta; i < n; i++) #define Per(i, sta, n) for (int i = n - 1; i >= sta; i--) typedef long double ld; const ld eps = 1e-8; const ld pi = acos(-1.0); typedef pair<ll, ll> LP; int dx[8] = {1, -1, 0, 0, 1, 1, -1, -1}; int dy[8] = {0, 0, 1, -1, 1, -1, 1, -1}; template <class T> using max_heap = priority_queue<T>; template <class T> using min_heap = priority_queue<T, vector<T>, greater<>>; template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } int h, w; void solve() { cin >> h >> w; if (h == 1 || w == 1) { cout << 0 << endl; rep(i, h) { rep(j, w) cout << 0 << " "; cout << "" << endl; } return; } if (h % 2 == 0 && w % 2 == 0) { cout << h * w << endl; rep(i, h) { rep(j, w) cout << 1 << " "; cout << "" << endl; } return; } else if (h % 2 == 1 && w % 2 == 0) { cout << (h - 1) * w << endl; rep(i, h - 1) { rep(j, w) { cout << 1 << " "; } cout << "" << endl; } rep(j, w) cout << 0 << " "; cout << "" << endl; return; } else if (h % 2 == 0 && w % 2 == 1) { cout << h * (w - 1) << endl; rep(i, h) { rep(j, w - 1) { cout << 1 << " "; } cout << "0" << endl; } return; } cout << h * w - max(h, w) << endl; if (h >= w) { rep(i, h - w) { rep(j, w - 1) cout << 1 << " "; cout << 0 << endl; } rep(i, w) { rep(j, w) { if (j == w - i - 1) cout << 0 << " "; else cout << 1 << " "; } cout << "" << endl; } } else { rep(i, h) { rep(j, w - h) { if (i == h - 1) cout << 0 << " "; else cout << 1 << " "; } Rep(j, w - h, w) { if (j == w - i - 1) cout << 0 << " "; else cout << 1 << " "; } cout << "" << endl; } } } int main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(50); solve(); }