結果

問題 No.1974 2x2 Flipper
ユーザー k1suxu
提出日時 2022-06-10 23:34:21
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 2,651 bytes
コンパイル時間 2,795 ms
コンパイル使用メモリ 246,684 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-21 06:59:50
合計ジャッジ時間 6,308 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 21 WA * 4
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define pb push_back
#define m0(x) memset(x,0,sizeof(x))
#define fill(x,y) memset(x,y,sizeof(x))
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vs vector<string>
#define vvs vector<vs>
#define vc vector<char>
#define vvc vector<vc>
#define pii pair<int,int>
#define pllll pair<ll,ll>
#define vpii vector<pair<int,int>>
#define vpllll vector<pair<ll,ll>>
#define vpis vector<pair<int,string>>
#define vplls vector<pair<ll, string>>
#define vpsi vector<pair<string, int>>
#define vpsll vector<pair<string, ll>>
template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}
using ll = long long;
using ld = long double;
using ull = unsigned long long;
const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[] = {0, -1, 0, 1, -1, 1, -1, 1};
#define int long long
void solve() {
int h, w;
cin >> h >> w;
if(h<2 || w<2) {
cout << 0 << endl;
rep(i, h) {
rep(j, w) cout << 0 << " ";
cout << "\n";
}
return;
}
if(h%2==0 && w%2==0) {
cout << h*w << endl;
FOR(h) {
rep(j, w) cout << 1 << " "; cout << "\n";
}
}else if(h%2==1 && w%2==0) {
cout << h*w-w << endl;
FOR(h) {
rep(j, w) {
if(i==h-1) cout << 0 << " ";
else cout << 1 << " ";
} cout << "\n";
}
}else if(h%2==0 && w%2==1) {
cout << h*w-h << endl;
FOR(h) {
rep(j, w) {
if(j==w-1) cout << 0 << " ";
else cout << 1 << " ";
} cout << "\n";
}
}else {
cout << h*w-(h+w-1)-1+3 << endl;
FOR(h) {
rep(j, w) {
if(
(i==h-2 && j==w-1) ||
(i==h-1 && j==w-1) ||
(i==h-1 && j==w-2)
) cout << 1 << " ";
else if(i==h-1 || j==w-1 || (i==h-2&&j==w-2)) cout << 0 << " ";
else cout << 1 << " ";
} cout << "\n";
}
}
}
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0