#571483 (C++17) No.307 最近色塗る問題多くない？

• 問題: No.307 最近色塗る問題多くない？
• ユーザー: iiljj
• 提出日時: 2020-10-25 11:48:51
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 300 ms / 4,000 ms
• コード長: 10,373 bytes
• コンパイル時間: 2,318 ms
• コンパイル使用メモリ: 213,800 KB
• 実行使用メモリ: 4,380 KB
• 最終ジャッジ日時: 2023-09-28 23:00:13
• 合計ジャッジ時間: 7,746 ms
• ジャッジサーバーID （参考情報）: judge12 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 4,376 KB
testcase_01	AC	1 ms; 4,380 KB
testcase_02	AC	2 ms; 4,380 KB
testcase_03	AC	1 ms; 4,380 KB
testcase_04	AC	5 ms; 4,380 KB
testcase_05	AC	2 ms; 4,376 KB
testcase_06	AC	2 ms; 4,380 KB
testcase_07	AC	17 ms; 4,376 KB
testcase_08	AC	102 ms; 4,380 KB
testcase_09	AC	54 ms; 4,376 KB
testcase_10	AC	19 ms; 4,376 KB
testcase_11	AC	47 ms; 4,380 KB
testcase_12	AC	2 ms; 4,376 KB
testcase_13	AC	10 ms; 4,380 KB
testcase_14	AC	9 ms; 4,376 KB
testcase_15	AC	14 ms; 4,380 KB
testcase_16	AC	10 ms; 4,380 KB
testcase_17	AC	51 ms; 4,376 KB
testcase_18	AC	99 ms; 4,380 KB
testcase_19	AC	110 ms; 4,380 KB
testcase_20	AC	8 ms; 4,376 KB
testcase_21	AC	115 ms; 4,376 KB
testcase_22	AC	111 ms; 4,376 KB
testcase_23	AC	237 ms; 4,380 KB
testcase_24	AC	150 ms; 4,380 KB
testcase_25	AC	174 ms; 4,380 KB
testcase_26	AC	254 ms; 4,376 KB
testcase_27	AC	297 ms; 4,380 KB
testcase_28	AC	226 ms; 4,376 KB
testcase_29	AC	7 ms; 4,376 KB
testcase_30	AC	263 ms; 4,380 KB
testcase_31	AC	300 ms; 4,376 KB
testcase_32	AC	111 ms; 4,376 KB
testcase_33	AC	100 ms; 4,380 KB
testcase_34	AC	109 ms; 4,376 KB
testcase_35	AC	110 ms; 4,380 KB

ソースコード

/* #region Head */

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

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#define DEBUG_

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                                                                 \
    type __VA_ARGS__;                                                                                                  \
    cin >> __VA_ARGS__;

template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = true;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

/* #region BFS */

/**
 * @param N ノード数
 * @param delta 隣接行列を生成する関数．delta(Node v, fn(Node t)).
 *              fn は現在の頂点 current と隣接する頂点を探索する関数．
 * @param index 頂点→頂点インデックス，のマップ関数．（index(Node v) -> int）
 */
template <class Node, class Delta, class Index> vll bfs(ll N, Node start, Delta delta, Index index) {
    vll dist(N, -1);        // 距離テーブル
    queue<Node> que;        // 「訪問予定」頂点リスト
    dist[index(start)] = 0; // 初期条件 (頂点 idx1 を初期頂点とする)
    que.push(start);
    // BFS 開始 (キューが空になるまで探索を行う)
    while (!que.empty()) {
        Node current = que.front();
        que.pop();
        // 隣接ノードに関するループは外に出す
        delta(current, [&](Node dst) -> bool {
            if (dist[index(dst)] == -1) {
                dist[index(dst)] = dist[index(current)] + 1;
                que.push(dst);
                return true;
            }
            return false;
        });
    }
    return dist;
}

/* #endregion */

/* #region Lattice */

const static vll dx{1, 0, -1, 0};

// 格子グラフ用ライブラリ
template <class FDiscriminant> struct lattice_delta {
    ll H, W;
    FDiscriminant discriminant;

    /**
     * @param H 高さ
     * @param W 幅
     * @param discriminant (current, dst, transit(dst)).
     *                     current→dst の遷移が可能か判定し，可能なら transit(dst) を呼び出す．
     */
    lattice_delta(ll H, ll W, FDiscriminant discriminant) : H(H), W(W), discriminant(discriminant) {}

    /**
     * @param current ノード
     * @param transit (pll dst)->void. 遷移実行関数．
     */
    template <class FTransit> void operator()(pll current, FTransit transit) {
        auto [i, j] = current;
        // 隣接ノードに関するループ
        for (ll q = 0; q < 4; q++) {
            ll x = i + dx[q];
            ll y = j + dx[q ^ 1];
            if (0 <= x && x < H && 0 <= y && y < W) {
                discriminant(current, pll(x, y), transit);
            }
        }
    }
};

/**
 * @param H 高さ
 * @param W 幅
 * @param f (current, dst, func(dst)).
 *          current→dst の遷移を行うか判定し，行う場合に func(dst) を呼び出す．
 */
template <class FDiscriminant> lattice_delta<FDiscriminant> make_lattice_delta(ll H, ll W, FDiscriminant f) {
    return lattice_delta<FDiscriminant>(H, W, f); //
}

struct lattice_index {
    ll H, W;
    lattice_index(ll H, ll W) : H(H), W(W) {}
    ll operator()(pll v) { return v.first * W + v.second; }
};

/* #endregion */

// Problem
void solve() {
    VAR(ll, h, w);
    vc<vc<int>> a(h, vc<int>(w));
    cin >> a;

    int sum = 0;
    REP(i, 0, h) sum += accumulate(ALL(a[i]), 0);

    // 隣接行列生成関数
    auto delta = make_lattice_delta(h, w, [&](pll current, pll dst, auto transit) {
        if (a[current.first][current.second] != a[dst.first][dst.second]) {
            sum += (a[current.first][current.second] - a[dst.first][dst.second]);
            a[dst.first][dst.second] = a[current.first][current.second];
            transit(dst); // 行き先が同じ色なら遷移関数を呼ぶ
        }
    });
    // インデックス生成関数
    auto index = lattice_index(h, w);

    VAR(ll, q);
    int lastcolor = -1;
    REP(i, 0, q) {
        VAR(int, r, c, x);
        --r, --c;
        lastcolor = x;
        if (a[r][c] == x) continue;
        if (sum == 0 || sum == h * w) continue;
        sum += (x - a[r][c]);
        a[r][c] = x;
        pll start = {r, c};
        // dump(i, sum, h * w);
        bfs(h * w, start, delta, index);
    }
    // dump(a);
    if (sum == 0 || sum == h * w) {
        REP(i, 0, h) REP(j, 0, w) cout << lastcolor << (j == w - 1 ? '\n' : ' ');
    } else {
        REP(i, 0, h) cout >> a[i];
    }
}

// entry point
int main() {
    solve();
    return 0;
}