結果

問題 No.1974 2x2 Flipper
ユーザー 👑 AngrySadEightAngrySadEight
提出日時 2023-03-02 12:36:47
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 78 ms / 2,000 ms
コード長 4,397 bytes
コンパイル時間 20,984 ms
コンパイル使用メモリ 354,080 KB
最終ジャッジ日時 2025-02-11 01:05:44
ジャッジサーバーID
(参考情報)
judge4 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

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

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int,int>
#define pil pair<int,ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define vvpii vector<vector<pair<int,int>>>
#define vvpll vector<vector<pair<ll,ll>>>
template<typename T> void debug(T e){
cerr << e << endl;
}
template<typename T> void debug(vector<T> &v){
rep(i, v.size()){
cerr << v[i] << " ";
}
cerr << endl;
}
template<typename T> void debug(vector<vector<T>> &v){
rep(i, v.size()){
rep(j, v[i].size()){
cerr << v[i][j] << " ";
}
cerr << endl;
}
}
template<typename T> void debug(vector<pair<T, T>> &v){
rep(i,v.size()){
cerr << v[i].first << " " << v[i].second << endl;
}
}
template<typename T> void debug(set<T> &st){
for (auto itr = st.begin(); itr != st.end(); itr++){
cerr << *itr << " ";
}
cerr << endl;
}
template<typename T> void debug(multiset<T> &ms){
for (auto itr = ms.begin(); itr != ms.end(); itr++){
cerr << *itr << " ";
}
cerr << endl;
}
template<typename T> void debug(map<T, T> &mp){
for (auto itr = mp.begin(); itr != mp.end(); itr++){
cerr << itr->first << " " << itr->second << endl;
}
}
void debug_out(){
cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
cerr << H << " ";
debug_out(T...);
}
int main(){
int H, W;
cin >> H >> W;
if (H == 1 || W == 1){
cout << 0 << endl;
for (int i = 0; i < H; i++){
for (int j = 0; j < W; j++){
cout << 0;
if (j != W - 1) cout << " ";
}
cout << endl;
}
}
else if (H % 2 == 0 && W % 2 == 0){
cout << H * W << endl;
for (int i = 0; i < H; i++){
for (int j = 0; j < W; j++){
cout << 1;
if (j != W - 1) cout << " ";
}
cout << endl;
}
}
else if (H % 2 == 0 && W % 2 == 1){
cout << H * (W - 1) << endl;
for (int i = 0; i < H; i++){
for (int j = 0; j < W; j++){
if (j == W - 1){
cout << 0;
}
else{
cout << 1 << " ";
}
}
cout << endl;
}
}
else if (H % 2 == 1 && W % 2 == 0){
cout << (H - 1) * W << endl;
for (int i = 0; i < H; i++){
for (int j = 0; j < W; j++){
if (i == H - 1){
cout << 0;
}
else{
cout << 1;
}
if (j != W - 1) cout << " ";
}
cout << endl;
}
}
else{
vvi ans(H, vi(W, 1));
int min_val = min(H, W);
for (int i = 0; i <= min_val - 1; i++){
ans[H - 1 - i][W - (min_val - i)] = 0;
}
for (int i = 0; i < H - 1; i++){
if (ans[i][W - 1] == 0) break;
ans[i][W - 1] = 0;
}
for (int j = 0; j < W - 1; j++){
if (ans[H - 1][j] == 0) break;
ans[H - 1][j] = 0;
}
int cnt = 0;
rep(i,H){
rep(j,W){
cnt += ans[i][j];
}
}
cout << cnt << endl;
for (int i = 0; i < H; i++){
for (int j = 0; j < W; j++){
cout << ans[i][j];
if (j < W - 1) cout << " ";
}
cout << endl;
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0