結果

問題 No.2731 Two Colors
ユーザー coindarwcoindarw
提出日時 2024-04-19 21:43:50
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 245 ms / 3,000 ms
コード長 7,454 bytes
コンパイル時間 5,263 ms
コンパイル使用メモリ 315,120 KB
実行使用メモリ 14,080 KB
最終ジャッジ日時 2024-10-11 14:36:05
合計ジャッジ時間 10,022 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 245 ms
11,648 KB
testcase_01 AC 244 ms
11,392 KB
testcase_02 AC 244 ms
11,520 KB
testcase_03 AC 4 ms
6,820 KB
testcase_04 AC 12 ms
6,820 KB
testcase_05 AC 11 ms
6,816 KB
testcase_06 AC 37 ms
6,816 KB
testcase_07 AC 34 ms
6,820 KB
testcase_08 AC 7 ms
6,816 KB
testcase_09 AC 123 ms
10,624 KB
testcase_10 AC 4 ms
6,820 KB
testcase_11 AC 178 ms
12,416 KB
testcase_12 AC 122 ms
10,752 KB
testcase_13 AC 147 ms
11,264 KB
testcase_14 AC 58 ms
7,040 KB
testcase_15 AC 7 ms
6,820 KB
testcase_16 AC 68 ms
7,040 KB
testcase_17 AC 86 ms
8,192 KB
testcase_18 AC 18 ms
6,820 KB
testcase_19 AC 71 ms
7,296 KB
testcase_20 AC 74 ms
8,064 KB
testcase_21 AC 19 ms
6,816 KB
testcase_22 AC 151 ms
11,776 KB
testcase_23 AC 39 ms
6,820 KB
testcase_24 AC 20 ms
6,816 KB
testcase_25 AC 3 ms
6,820 KB
testcase_26 AC 108 ms
9,856 KB
testcase_27 AC 137 ms
11,520 KB
testcase_28 AC 104 ms
9,216 KB
testcase_29 AC 34 ms
6,816 KB
testcase_30 AC 52 ms
6,820 KB
testcase_31 AC 41 ms
6,820 KB
testcase_32 AC 201 ms
14,080 KB
testcase_33 AC 2 ms
6,816 KB
testcase_34 AC 2 ms
6,816 KB
testcase_35 AC 2 ms
6,820 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>

#include <atcoder/all>
#else
#include <mylibs/all.h>
#endif

using ll = long long;
using lll = __int128_t;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define repc2(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define length(v) ((int)(v).size())
constexpr int inf = 2'000'000'000;
constexpr ll linf = 4'000'000'000'000'000'000, M7 = 1'000'000'007, M9 = 998'244'353;
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;
using namespace atcoder;

// clang-format off
#define Vec(type, ...) __make_vec<type>(__VA_ARGS__)
template <class T> vector<T> __make_vec(size_t a) {return vector<T>(a);}template <class T, class... Ts>
auto __make_vec(size_t a, Ts... ts) {return vector<decltype(__make_vec<T>(ts...))>(a, __make_vec<T>(ts...));}
#define VecI(init, type, ...) __make_vecI<type, init>(__VA_ARGS__)
template <class T, T init>vector<T> __make_vecI(size_t a) {return vector<T>(a, init);}
template <class T, T init, class... Ts>
auto __make_vecI(size_t a, Ts... ts) {return vector<decltype(__make_vecI<T, init>(ts...))>(a, __make_vecI<T, init>(ts...));}

template <typename T, typename U>inline ostream& operator<<(ostream& os, const pair<T, U>& p) noexcept {return os << p.first << " " << p.second;}
inline ostream& operator<<(ostream& os, const modint& m) noexcept { return os << m.val(); }
template <int M>inline ostream& operator<<(ostream& os, const static_modint<M>& m) noexcept { return os << m.val(); }

template <typename T> struct is_static_modint : std::false_type {}; template <int MOD> struct is_static_modint<static_modint<MOD>> : std::true_type {};
template <template <typename...> typename C, typename Number>concept MyContainer = std::is_same_v<C<Number>, std::vector<Number>> || std::is_same_v<C<Number>, std::deque<Number>> || std::is_same_v<C<Number>, std::set<Number>> || std::is_same_v<C<Number>, std::unordered_set<Number>> || std::is_same_v<C<Number>, std::unordered_multiset<Number>> || std::is_same_v<C<Number>, std::multiset<Number>>;
template <typename Number>concept MyNumber = std::is_same_v<Number, int> || std::is_same_v<Number, ll> || std::is_same_v<Number, char> || std::is_same_v<Number, modint> || is_static_modint<Number>::value;
template <template <typename...> typename C, typename Number>concept MyContainerNumber = MyContainer<C, Number> && MyNumber<Number>;
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>concept MyNestedContainerNumber = MyContainer<OutCon, InCon<Number>> && MyContainerNumber<InCon, Number>;
template <template <typename...> typename C, typename Number>requires MyContainerNumber<C, Number>std::ostream& operator<<(std::ostream& os, const C<Number>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << ' ' << *itr;}return os;}
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>requires MyNestedContainerNumber<OutCon, InCon, Number>std::ostream& operator<<(std::ostream& os, const OutCon<InCon<Number>>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << '\n' << *itr;}return os;}
template <typename T, typename U>istream& operator>>(istream& is, pair<T, U>& p) {return is >> p.first >> p.second;}
template <typename T>istream& operator>>(istream& is, vector<T>& v) {for (auto& e : v) is >> e;return is;}
void inp() {}
template <typename T, typename... Args>void inp(T& a, Args&... args) {cin >> a, inp(args...);}
template <typename T>void inp1(vector<T>& v, int offset = 1, int len = -1) {if (len == -1) len = int(v.size()) - offset;assert(offset >= 0 && len >= 0);for (int i = offset; i < offset + len; ++i) cin >> v[i];}
template <typename T>void oup(const T& a) {cout << a << "\n";}
template <typename T, typename... Args>void oup(const T& a, const Args&... args) {cout << a << " ", oup(args...);}

inline string YESNO(bool cond) { return cond ? "YES" : "NO"; }inline string yesno(bool cond) { return cond ? "yes" : "no"; }inline string YesNo(bool cond) { return cond ? "Yes" : "No"; }
inline auto add1(auto vec, ll offset = 1) {for (auto& e : vec) e += offset;return vec;}
#ifdef ONLINE_JUDGE
#define debug(...)
#else
#define debug(...) cerr << "<" << #__VA_ARGS__ << ">: ", debug_out(__VA_ARGS__)
template <typename T>void debug_out(T t) {cerr << t << "\n";}
template <typename T, typename... Args>void debug_out(T t, Args... args) {cerr << t << ", ";debug_out(args...);}
#endif

#ifdef ONLINE_JUDGE
#define todo(...) static_assert(false)
#else
#define todo(...)
#endif
// clang-format on

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll h, w;
    inp(h, w);
    vector<vector<int>> a = vector<vector<int>>(h, vector<int>(w));
    inp(a);

    vector<vector<int>> col = vector<vector<int>>(h, vector<int>(w, -1));
    col[0][0] = 1;
    col[h - 1][w - 1] = 0;
    using P = pair<int, int>;
    set<P> st0, st1;
    auto idx = [&](int i, int j) { return i * w + j; };

    const int dx[] = {1, 0, -1, 0};
    const int dy[] = {0, 1, 0, -1};
    rep(i, 4) {
        int ny = 0 + dy[i], nx = 0 + dx[i];
        if (0 <= ny && ny < h && 0 <= nx && nx < w) {
            st1.insert(P{a[ny][nx], idx(ny, nx)});
        }
    }
    rep(i, 4) {
        int ny = h - 1 + dy[i], nx = w - 1 + dx[i];
        if (0 <= ny && ny < h && 0 <= nx && nx < w) {
            st0.insert(P{a[ny][nx], idx(ny, nx)});
        }
    }

    int cnt = 0;
    while (true) {
        cnt++;
        int cur = cnt % 2;
        if (cur == 0) {
            auto [v, mn] = *st0.begin();
            st0.erase(st0.begin());

            auto lb = st1.lower_bound(P{v, -1});
            if (lb != st1.end() && lb->first == v) {
                st1.erase(lb);
            }
            int y = mn / w, x = mn % w;
            col[y][x] = cur;
            bool connect = false;
            rep(i, 4) {
                int ny = y + dy[i], nx = x + dx[i];
                if (0 <= ny && ny < h && 0 <= nx && nx < w) {
                    if (col[ny][nx] == 1 - cur) {
                        connect = true;
                    } else if (col[ny][nx] == -1) {
                        st0.insert({a[ny][nx], idx(ny, nx)});
                    }
                }
            }
            if (connect) break;
        } else {
            auto [v, mn] = *st1.begin();
            st1.erase(st1.begin());

            auto lb = st0.lower_bound(P{v, -1});
            if (lb != st0.end() && lb->first == v) {
                st0.erase(lb);
            }
            int y = mn / w, x = mn % w;
            col[y][x] = cur;
            bool connect = false;
            rep(i, 4) {
                int ny = y + dy[i], nx = x + dx[i];
                if (0 <= ny && ny < h && 0 <= nx && nx < w) {
                    if (col[ny][nx] == 1 - cur) {
                        connect = true;
                    } else if (col[ny][nx] == -1) {
                        st1.insert({a[ny][nx], idx(ny, nx)});
                    }
                }
            }
            if (connect) break;
        }
    }

    oup(cnt);

    return 0;
}
0