#811986 (C++17) No.2112 All 2x2 are Equal

提出ソース

結果

問題	No.2112 All 2x2 are Equal
ユーザー	packer_jp
提出日時	2022-10-28 22:08:10
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	112 ms / 2,000 ms
コード長	12,106 bytes
コンパイル時間	2,264 ms
コンパイル使用メモリ	214,376 KB
実行使用メモリ	11,136 KB
最終ジャッジ日時	2024-07-06 01:17:06
合計ジャッジ時間	7,790 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	5 ms 5,376 KB
testcase_03	AC	4 ms 5,376 KB
testcase_04	AC	46 ms 6,400 KB
testcase_05	AC	60 ms 7,424 KB
testcase_06	AC	106 ms 10,624 KB
testcase_07	AC	34 ms 5,632 KB
testcase_08	AC	85 ms 9,216 KB
testcase_09	AC	7 ms 5,376 KB
testcase_10	AC	39 ms 5,888 KB
testcase_11	AC	27 ms 5,376 KB
testcase_12	AC	32 ms 5,376 KB
testcase_13	AC	94 ms 9,728 KB
testcase_14	AC	6 ms 5,376 KB
testcase_15	AC	67 ms 7,936 KB
testcase_16	AC	2 ms 5,376 KB
testcase_17	AC	83 ms 9,088 KB
testcase_18	AC	4 ms 5,376 KB
testcase_19	AC	8 ms 5,376 KB
testcase_20	AC	5 ms 5,376 KB
testcase_21	AC	80 ms 8,704 KB
testcase_22	AC	6 ms 5,376 KB
testcase_23	AC	5 ms 5,376 KB
testcase_24	AC	12 ms 5,376 KB
testcase_25	AC	15 ms 5,376 KB
testcase_26	AC	11 ms 5,376 KB
testcase_27	AC	22 ms 5,376 KB
testcase_28	AC	52 ms 6,656 KB
testcase_29	AC	9 ms 5,376 KB
testcase_30	AC	33 ms 5,376 KB
testcase_31	AC	63 ms 7,552 KB
testcase_32	AC	112 ms 11,136 KB
testcase_33	AC	111 ms 11,008 KB
testcase_34	AC	112 ms 11,008 KB
testcase_35	AC	112 ms 11,008 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;

#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define uniq(a) (a).erase(unique(all(a)), (a).end())
#define t0 first
#define t1 second
using ll = long long;
using ull = unsigned long long;
using pll = pair<ll, ll>;
using vll = vector<ll>;
constexpr double pi = 3.14159265358979323846;
constexpr ll dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr ll dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
constexpr ll sign(ll a) { return (a > 0) - (a < 0); }
constexpr ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
constexpr ll cdiv(ll a, ll b) { return -fdiv(-a, b); }
constexpr ll pw(ll n) { return 1ll << n; }
constexpr ll flg(ll n) { return 63 - __builtin_clzll(n); }
constexpr ll clg(ll n) { return flg(n - 1) + 1; }
constexpr ll safemod(ll x, ll mod) { return (x % mod + mod) % mod; }
template <typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
template <typename T> constexpr T sq(const T &a) { return a * a; }
template <typename T, typename U> constexpr bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }
template <typename T, typename U> constexpr bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &a) {
    os << "(" << a.first << ", " << a.second << ")";
    return os;
}
template <typename T, typename U, typename V> ostream &operator<<(ostream &os, const tuple<T, U, V> &a) {
    os << "(" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ")";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &a) {
    os << "(";
    for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : "");
    os << ")";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &a) {
    os << "(";
    for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : "");
    os << ")";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &a) {
    os << "(";
    for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : "");
    os << ")";
    return os;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &a) {
    os << "(";
    for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : "");
    os << ")";
    return os;
}
#ifdef ONLINE_JUDGE
#define dump(...) (void(0))
#else
void debug() { cerr << endl; }
template <typename Head, typename... Tail> void debug(Head &&head, Tail &&... tail) {
    cerr << head;
    if (sizeof...(Tail)) cerr << ", ";
    debug(tail...);
}
#define dump(...) cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ", debug(__VA_ARGS__)
#endif
struct rep {
    struct itr {
        ll v;
        itr(ll v) : v(v) {}
        void operator++() { ++v; }
        ll operator*() const { return v; }
        bool operator!=(itr i) const { return v < *i; }
    };
    ll l, r;
    rep(ll l, ll r) : l(l), r(r) {}
    rep(ll r) : rep(0, r) {}
    itr begin() const { return l; };
    itr end() const { return r; };
};
struct per {
    struct itr {
        ll v;
        itr(ll v) : v(v) {}
        void operator++() { --v; }
        ll operator*() const { return v; }
        bool operator!=(itr i) const { return v > *i; }
    };
    ll l, r;
    per(ll l, ll r) : l(l), r(r) {}
    per(ll r) : per(0, r) {}
    itr begin() const { return r - 1; };
    itr end() const { return l - 1; };
};
struct io_setup {
    static constexpr int PREC = 20;
    io_setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} iOS;

template <typename M> struct modint {
    ll val;
    modint(ll val = 0) : val(val >= 0 ? val % M::mod : (M::mod - (-val) % M::mod) % M::mod) {}
    static ll mod() { return M::mod; }
    modint inv() const {
        ll a = val, b = M::mod, u = 1, v = 0, t;
        while (b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return u;
    }
    modint pow(ll k) const {
        modint ret = 1, mul = val;
        while (k) {
            if (k & 1) ret *= mul;
            mul *= mul;
            k >>= 1;
        }
        return ret;
    }
    modint &operator+=(const modint &a) {
        if ((val += a.val) >= M::mod) val -= M::mod;
        return *this;
    }
    modint &operator-=(const modint &a) {
        if ((val += M::mod - a.val) >= M::mod) val -= M::mod;
        return *this;
    }
    modint &operator*=(const modint &a) {
        (val *= a.val) %= M::mod;
        return *this;
    }
    modint &operator/=(const modint &a) { return *this *= a.inv(); }
    modint operator+() const { return *this; }
    modint operator-() const { return modint(-val); }
    friend bool operator==(const modint &a, const modint &b) { return a.val == b.val; }
    friend bool operator!=(const modint &a, const modint &b) { return rel_ops::operator!=(a, b); }
    friend modint operator+(const modint &a, const modint &b) { return modint(a) += b; }
    friend modint operator-(const modint &a, const modint &b) { return modint(a) -= b; }
    friend modint operator*(const modint &a, const modint &b) { return modint(a) *= b; }
    friend modint operator/(const modint &a, const modint &b) { return modint(a) /= b; }
    friend istream &operator>>(istream &is, modint &a) {
        ll val;
        is >> val;
        a = modint(val);
        return is;
    }
    friend ostream &operator<<(ostream &os, const modint &a) { return os << a.val; }
};

struct _998244353 {
    constexpr static ll mod = 998244353;
};
struct _1000000007 {
    constexpr static ll mod = 1000000007;
};
using modint998244353 = modint<_998244353>;
using modint1000000007 = modint<_1000000007>;

struct arbitrary {
    static ll mod;
};
ll arbitrary::mod;

template <typename V> struct fenwick_tree {
    vector<V> data;
    fenwick_tree(ll n) : data(n + 1, V()) {}
    void add(ll i, const V &x) {
        for (++i; i < (ll)data.size(); i += i & -i) data[i] += x;
    }
    V sum(ll i) const {
        V ret = V();
        for (; i > 0; i -= i & -i) ret += data[i];
        return ret;
    }
    V sum(ll l, ll r) const { return sum(r) - sum(l); }
};
template <typename P> struct unionfind {
    using V = typename P::V;
    ll n;
    vector<ll> ps;
    vector<V> val;
    unionfind(const vector<V> &val) : n(val.size()), ps(n, -1), val(val) {}
    unionfind(ll n, const V &a = {}) : unionfind(vector<V>(n, a)) {}
    ll find(ll i) {
        if (ps[i] < 0) return i;
        return ps[i] = find(ps[i]);
    }
    ll size(ll i) { return -ps[find(i)]; }
    void unite(ll i, ll j) {
        if ((i = find(i)) == (j = find(j))) return;
        if (-ps[i] < -ps[j]) swap(i, j);
        ps[i] += ps[j];
        P::merge(val[i], val[j]);
        ps[j] = i;
    }
    bool same(ll i, ll j) { return find(i) == find(j); }
    V &operator[](ll i) { return val[find(i)]; }
    vector<vector<ll>> groups() {
        vector<vector<ll>> ret(n);
        for (ll i : rep(n)) ret[find(i)].push_back(i);
        ret.erase(remove_if(all(ret), [](const vector<ll> &v) { return v.empty(); }), ret.end());
        return ret;
    }
};
struct normal_uf {
    using V = struct {};
    static void merge(V &a, const V &b) {}
};
template <typename V> V xor64(V lb, V ub) {
    static ull x = 88172645463325252ull;
    x ^= x << 7;
    return lb + (x ^= x >> 9) % (ub - lb);
}
template <typename V> vector<V> prime_factorize(V n) {
    vector<V> ret;
    for (V i = 2; i * i <= n; ++i) {
        while (n % i == 0) {
            ret.push_back(i);
            n /= i;
        }
    }
    if (n != 1) ret.push_back(n);
    return ret;
}
template <typename F> ll bisect(ll ok, ll ng, F f) {
    while (abs(ok - ng) > 1) {
        ll mid = (ok + ng) / 2;
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}
vector<bool> prime_table(ll n) {
    vector<bool> ret(n + 1, true);
    if (n >= 0) ret[0] = false;
    if (n >= 1) ret[1] = false;
    for (ll i = 2; i * i <= n; ++i) {
        if (!ret[i]) continue;
        for (ll j = i << 1; j <= n; j += i) ret[j] = false;
    }
    return ret;
}

struct rational {
    long long num, den;
    static long long gcd(long long a, long long b) {
        if (a < 0) { a = -a; }
        if (b < 0) { b = -b; }
        while (b) { std::swap(a %= b, b); }
        return a;
    }
    void reduce() {
        long long g = gcd(num, den);
        num /= g, den /= g;
    }
    rational(long long num_ = 0, long long den_ = 1, bool reduction = true) : num(num_), den(den_) {
        if (reduction) { reduce(); }
        if (den < 0) { num = -num, den = -den; }
    }
    rational &operator+=(const rational &a) {
        num = num * a.den + a.num * den, den *= a.den;
        reduce();
        return *this;
    }
    rational &operator-=(const rational &a) { return *this += -a; }
    rational &operator*=(const rational &a) {
        num *= a.num, den *= a.den;
        reduce();
        return *this;
    }
    rational &operator/=(const rational &a) { return *this *= a.inv(); }
    rational operator+() const { return *this; }
    rational operator-() const { return rational(-num, den, false); }
    friend bool operator==(const rational &a, const rational &b) { return a.num == b.num && a.den == b.den; }
    friend bool operator!=(const rational &a, const rational &b) { return std::rel_ops::operator!=(a, b); }
    friend bool operator<(const rational &a, const rational &b) { return a.num * b.den < b.num * a.den; }
    friend bool operator>(const rational &a, const rational &b) { return std::rel_ops::operator>(a, b); }
    friend bool operator<=(const rational &a, const rational &b) { return std::rel_ops::operator<=(a, b); }
    friend bool operator>=(const rational &a, const rational &b) { return std::rel_ops::operator>=(a, b); }
    friend rational operator+(rational a, const rational &b) { return a += b; }
    friend rational operator-(rational a, const rational &b) { return a -= b; }
    friend rational operator*(rational a, const rational &b) { return a *= b; }
    friend rational operator/(rational a, const rational &b) { return a /= b; }
    rational inv() const { return rational(den, num, false); }
    rational pow(long long n) const {
        if (n < 0) { return pow(-n).inv(); }
        rational ret(1, 1, false), mul = *this;
        while (n > 0) {
            if (n & 1) { ret.num *= mul.num, ret.den *= mul.den; }
            mul.num *= mul.num, mul.den *= mul.den;
            n >>= 1;
        }
        return ret;
    }
    double to_double() const { return (double)num / den; }
    friend std::istream &operator>>(std::istream &is, rational &rhs) {
        long long n, d;
        char s;
        is >> n >> s >> d;
        rhs = rational(n, d);
        return is;
    }
    friend std::ostream &operator<<(std::ostream &os, const rational &rhs) { return os << rhs.num << " / " << rhs.den; }
};
int main() {
    ll h, w;
    cin >> h >> w;
    cout << "Yes" << endl;
    vector ans(h, vll(w));
    ll cur = 1;
    auto place = [&](ll i, ll j) -> void { ans[i][j] = cur++; };
    for (ll i = 0; i < h; i += 2) {
        for (ll j : rep(w)) place(i, j);
    }
    for (ll i = h - 1 - ((h - 1) % 2 == 0); i >= 0; i -= 2) {
        for (ll j : per(w)) place(i, j);
    }
    for (ll i = 0; i < h; i += 2) {
        ll j = h - 1 - (h - 1) % 2 - i;
        dump(i, j);
        if (i >= j) break;
        for (ll k = 0; k < w; k += 2) { swap(ans[i][k], ans[j][k]); }
    }
    for (ll i = 1; i < h; i += 2) {
        ll j = h - ((h - 1) % 2 == 0) - i;
        if (i >= j) break;
        for (ll k = 0; k < w; k += 2) { swap(ans[i][k], ans[j][k]); }
    }
    for (ll i : rep(h)) {
        for (ll j : rep(w)) { cout << ans[i][j] << " "; }
        cout << endl;
    }
    set<ll> s;
    for (ll i : rep(h - 1)) {
        for (ll j : rep(w - 1)) s.insert(ans[i][j] + ans[i + 1][j] + ans[i][j + 1] + ans[i + 1][j + 1]);
    }
    dump(s);
}

yukicoder

結果

テストケース

ソースコード