#508896 (C++17) No.179 塗り分け

提出ソース

結果

問題	No.179 塗り分け
ユーザー	haruki_K
提出日時	2020-07-10 18:22:02
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,642 ms / 3,000 ms
コード長	5,899 bytes
コンパイル時間	2,387 ms
コンパイル使用メモリ	220,076 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-07-23 15:17:10
合計ジャッジ時間	19,491 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,820 KB
testcase_02	AC	2 ms 6,820 KB
testcase_03	AC	1 ms 6,940 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	33 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	703 ms 6,940 KB
testcase_09	AC	687 ms 6,940 KB
testcase_10	AC	8 ms 6,944 KB
testcase_11	AC	7 ms 6,944 KB
testcase_12	AC	1,190 ms 6,940 KB
testcase_13	AC	4 ms 6,940 KB
testcase_14	AC	2 ms 6,944 KB
testcase_15	AC	2 ms 6,940 KB
testcase_16	AC	1 ms 6,944 KB
testcase_17	AC	2 ms 6,940 KB
testcase_18	AC	9 ms 6,944 KB
testcase_19	AC	8 ms 6,944 KB
testcase_20	AC	1 ms 6,944 KB
testcase_21	AC	2 ms 6,944 KB
testcase_22	AC	1,434 ms 6,940 KB
testcase_23	AC	221 ms 6,940 KB
testcase_24	AC	1,435 ms 6,940 KB
testcase_25	AC	1,020 ms 6,944 KB
testcase_26	AC	91 ms 6,944 KB
testcase_27	AC	1,587 ms 6,940 KB
testcase_28	AC	22 ms 6,944 KB
testcase_29	AC	1,621 ms 6,944 KB
testcase_30	AC	304 ms 6,940 KB
testcase_31	AC	1,642 ms 6,940 KB
testcase_32	AC	191 ms 6,944 KB
testcase_33	AC	1,593 ms 6,940 KB
testcase_34	AC	128 ms 6,940 KB
testcase_35	AC	1,600 ms 6,940 KB
testcase_36	AC	2 ms 6,944 KB
testcase_37	AC	2 ms 6,944 KB
testcase_38	AC	2 ms 6,940 KB
testcase_39	AC	2 ms 6,944 KB
testcase_40	AC	2 ms 6,944 KB
testcase_41	AC	2 ms 6,944 KB
testcase_42	AC	1 ms 6,940 KB
testcase_43	AC	25 ms 6,940 KB
testcase_44	AC	171 ms 6,944 KB
testcase_45	AC	6 ms 6,944 KB

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

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
template <class Int> struct Random {
    mt19937_64 mt{random_device{}()};
    //mt19937_64 mt{(unsigned)time(0)};
    Int a,b; // [a,b]
    Random(Int a, Int b) : a(a), b(b) {}
    Int operator()() { return uniform_int_distribution<Int>(a,b)(mt); }
};
template <class Int> Int rand(Int a, Int b) { // [a,b]
    static mt19937_64 mt{random_device{}()};
    return uniform_int_distribution<Int>(a,b)(mt);
}
// <<<
// >>> RLE for vector
template <class T>
vector<pair<T,int> > RLE(vector<T> const& v) {
    if (v.empty()) return {};
    vector<pair<T,int> > ret;
    int ii = -1, n = v.size();
    rep (i,n) if (i == n-1 || v[i] != v[i+1]) {
        ret.emplace_back(v[i],i-ii);
        ii = i;
    }
    return ret;
}
// <<<

int32_t main() {
    int n,m; cin >> n >> m;
    vector<string> s(n); cin >> s;
    auto valid = [&](int i, int j) {
        return (0 <= i && i < n &&
                0 <= j && j < m);
    };

    int cnt = 0;
    rep (i,n) cnt += count(all(s[i]),'#');
    if (cnt == 0 || cnt%2 == 1) quit("NO");

    rep (_,2) {
        vector<vector<char>> w;
        auto idx = make_v<int,2>(n,m,-1);
        rep1 (x,n-1) loop (y,-(m-1),<m) {
            w.clear();
            rep (i,n) fill(all(idx[i]),-1);
            rep (i,n) rep (j,m) {
                int pi = i-x, pj = j-y;
                if (valid(pi,pj)) {
                    int k = idx[pi][pj];
                    assert(k >= 0);
                    assert(k < sz(w));
                    w[k].eb(s[i][j]);
                    idx[i][j] = k;
                } else {
                    w.eb().eb(s[i][j]);
                    idx[i][j] = sz(w)-1;
                }
            }

            bool ok = true;
            for (auto &v : w) {
                for (auto [c,k] : RLE(v)) {
                    if (c == '#' && k%2 == 1) ok = false;
                }
            }
            if (ok) quit("YES");
        }

        vector<string> t(m,string(n,'-'));
        rep (i,n) rep (j,m) t[j][i] = s[i][j];
        swap(s,t);
        swap(n,m);
    }

    cout << "NO" << endl;
}

yukicoder

結果

テストケース

ソースコード