結果

問題 No.1974 2x2 Flipper
ユーザー SnowBeenDidingSnowBeenDiding
提出日時 2022-06-10 22:00:00
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,488 bytes
コンパイル時間 5,553 ms
コンパイル使用メモリ 315,604 KB
実行使用メモリ 13,568 KB
最終ジャッジ日時 2024-09-21 06:17:59
合計ジャッジ時間 8,498 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 11 ms
9,608 KB
testcase_01 AC 18 ms
9,856 KB
testcase_02 AC 12 ms
9,600 KB
testcase_03 AC 45 ms
12,160 KB
testcase_04 AC 28 ms
10,684 KB
testcase_05 WA -
testcase_06 AC 37 ms
11,388 KB
testcase_07 AC 29 ms
10,624 KB
testcase_08 AC 15 ms
9,728 KB
testcase_09 AC 36 ms
11,392 KB
testcase_10 WA -
testcase_11 AC 32 ms
11,032 KB
testcase_12 AC 45 ms
12,032 KB
testcase_13 AC 32 ms
11,136 KB
testcase_14 AC 23 ms
10,496 KB
testcase_15 AC 50 ms
12,484 KB
testcase_16 WA -
testcase_17 AC 41 ms
11,612 KB
testcase_18 AC 15 ms
9,828 KB
testcase_19 AC 15 ms
9,804 KB
testcase_20 AC 26 ms
10,728 KB
testcase_21 AC 65 ms
13,568 KB
testcase_22 AC 62 ms
13,420 KB
testcase_23 AC 62 ms
13,532 KB
testcase_24 WA -
testcase_25 AC 12 ms
9,600 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
// using mint = modint998244353;
// using mint = modint;//mint::set_mod(MOD);

const long long MOD = 1000000007;
// const long long MOD = 998244353;

#include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repeq(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); i++)
#define repreq(i, a, b) for (ll i = (ll)(a); i >= (ll)(b); i--)
#define each(a, b) for (auto &(a) : (b))
#define endl '\n'  // fflush(stdout);
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define sortr(v) sort(v, greater<>())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define tget(a, b) get<b>(a)
#define FI first
#define SE second
#define ALL(v) (v).begin(), (v).end()
#define INFLL 3000000000000000100LL
#define INF 1000000100
#define PI acos(-1.0L)
#define TAU (PI * 2.0L)

using namespace std;

typedef long long ll;
typedef pair<ll, ll> Pll;
typedef tuple<ll, ll, ll> Tlll;
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef vector<ll> Vl;
typedef vector<Vl> VVl;
typedef vector<VVl> VVVl;
typedef vector<Tlll> VTlll;
typedef vector<mint> Vm;
typedef vector<Vm> VVm;
typedef vector<string> Vs;
typedef vector<double> Vd;
typedef vector<char> Vc;
typedef vector<bool> Vb;
typedef vector<Pll> VPll;
typedef priority_queue<ll> PQl;
typedef priority_queue<ll, vector<ll>, greater<ll>> PQlr;

/* print */
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &V) {
    int N = V.size();
    if (N == 0) {
        os << endl;
        return os;
    }
    rep(i, 0, N - 1) { os << V[i] << ' '; }
    os << V[N - 1] << endl;
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &V) {
    int N = V.size();
    rep(i, 0, N) os << V[i];
    return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, pair<T, S> const &P) {
    os << P.FI << ' ' << P.SE;
    return os;
}
ostream &operator<<(ostream &os, mint const &M) {
    os << M.val();
    return os;
}

/* useful */
template <typename T>
void Vin(vector<T> &v) {
    int n = v.size();
    rep(i, 0, n) cin >> v[i];
}
template <typename T>
int SMALLER(vector<T> &a, T x) {
    return lower_bound(a.begin(), a.end(), x) - a.begin();
}
template <typename T>
int orSMALLER(vector<T> &a, T x) {
    return upper_bound(a.begin(), a.end(), x) - a.begin();
}
template <typename T>
int BIGGER(vector<T> &a, T x) {
    return a.size() - orSMALLER(a, x);
}
template <typename T>
int orBIGGER(vector<T> &a, T x) {
    return a.size() - SMALLER(a, x);
}
template <typename T>
int COUNT(vector<T> &a, T x) {
    return upper_bound(ALL(a), x) - lower_bound(ALL(a), x);
}
template <typename T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
void press(T &v) {
    v.erase(unique(ALL(v)), v.end());
}
template <typename T>
vector<int> zip(vector<T> b) {
    pair<T, int> p[b.size() + 10];
    int a = b.size();
    vector<int> l(a);
    for (int i = 0; i < a; i++) p[i] = mp(b[i], i);
    sort(p, p + a);
    int w = 0;
    for (int i = 0; i < a; i++) {
        if (i && p[i].first != p[i - 1].first) w++;
        l[p[i].second] = w;
    }
    return l;
}
template <typename T>
vector<T> vis(vector<T> &v) {
    vector<T> S(v.size() + 1);
    rep(i, 1, S.size()) S[i] += v[i - 1] + S[i - 1];
    return S;
}

ll dem(ll a, ll b) { return ((a + b - 1) / (b)); }
ll dtoll(double d, int g) { return round(d * pow(10, g)); }

const double EPS = 1e-10;

void init() {
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(12);
}

// Comm + K -> Comm + 0
// Comm + K -> Comm + C = add//
// Comm + K -> Comm + U = del//

/********************************** START **********************************/

// MOD ver.
struct Comb {
    vector<mint> fact, ifact;
    int MAX_COM;
    Comb() {}
    Comb(int n) {
        MAX_COM = n;  // ここでMAX入力を調整
        init(MOD, MAX_COM);
    }
    void init(long long MOD, long long MAX_COM) {
        int n = MAX_COM;
        assert(n < MOD);
        fact = vector<mint>(n + 1);
        ifact = vector<mint>(n + 1);
        fact[0] = 1;
        for (int i = 1; i <= n; ++i) fact[i] = fact[i - 1] * i;
        ifact[n] = fact[n].inv();
        for (int i = n; i >= 1; --i) ifact[i - 1] = ifact[i] * i;
    }
    mint operator()(long long n, long long k) {
        if (k < 0 || k > n) return 0;
        return fact[n] * ifact[k] * ifact[n - k];
    }
};
Comb comb(800010);

vector<pair<long long, long long>> fact(long long n) {  // 素因数分解O(√N)
    vector<pair<long long, long long>> r;
    for (ll i = 2; i * i <= n; ++i) {
        if (n % i) continue;
        r.emplace_back(i, 0);
        while (n % i == 0) {
            n /= i;
            r.back().second++;
        }
    }
    if (n != 1) r.emplace_back(n, 1);
    return r;
}

void sol() {
    int h, w;
    cin >> h >> w;
    ll ct = 0;
    VVi ans(h, Vi(w, 1));
    if (h == 1) {
        rep(i, 0, w) ans[0][i] = 0;
        rep(i, 0, h) rep(j, 0, w) if (ans[i][j]) ct++;
        cout << ct << endl;
        cout << ans;
        return;
    }
    if (w == 1) {
        rep(i, 0, h) ans[i][0] = 0;
        rep(i, 0, h) rep(j, 0, w) if (ans[i][j]) ct++;
        cout << ct << endl;
        cout << ans;
        return;
    }
    if (h % 2 == 0 && w % 2 == 0) {
        rep(i, 0, h) rep(j, 0, w) if (ans[i][j]) ct++;
        cout << ct << endl;
        cout << ans;
        return;
    } else if (h % 2 == 1 && w % 2 == 0) {
        rep(i, 0, w) ans[0][i] = 0;
        rep(i, 0, h) rep(j, 0, w) if (ans[i][j]) ct++;
        cout << ct << endl;
        cout << ans;
        return;
    } else if (h % 2 == 0 && w % 2 == 1) {
        rep(i, 0, h) ans[i][0] = 0;
        rep(i, 0, h) rep(j, 0, w) if (ans[i][j]) ct++;
        cout << ct << endl;
        cout << ans;
        return;
    }
    rep(i, 0, h) ans[i][0] = 0;
    rep(i, 0, w) ans[0][i] = 0;
    rep(i, 0, 2) {
        rep(j, 0, 2) {
            if (ans[i][j] == 1)
                ans[i][j] = 0;
            else
                ans[i][j] = 1;
        }
    }
    rep(i, 0, h) rep(j, 0, w) if (ans[i][j]) ct++;
    cout << ct << endl;
    cout << ans;
}

int main() {
    init();
    int q = 1;
    // cin >> q;
    while (q--) sol();
    return 0;
}
0