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

• 問題: No.307 最近色塗る問題多くない？
• ユーザー: mai
• 提出日時: 2019-02-03 14:01:18
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 71 ms / 4,000 ms
• コード長: 9,929 bytes
• コンパイル時間: 3,608 ms
• コンパイル使用メモリ: 244,608 KB
• 実行使用メモリ: 11,520 KB
• 最終ジャッジ日時: 2024-05-09 18:14:19
• 合計ジャッジ時間: 5,421 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,812 KB
testcase_01	AC	2 ms; 6,944 KB
testcase_02	AC	2 ms; 6,944 KB
testcase_03	AC	2 ms; 6,940 KB
testcase_04	AC	2 ms; 6,940 KB
testcase_05	AC	2 ms; 6,940 KB
testcase_06	AC	2 ms; 6,940 KB
testcase_07	AC	5 ms; 6,944 KB
testcase_08	AC	26 ms; 7,168 KB
testcase_09	AC	14 ms; 6,940 KB
testcase_10	AC	5 ms; 6,940 KB
testcase_11	AC	8 ms; 6,940 KB
testcase_12	AC	2 ms; 6,944 KB
testcase_13	AC	3 ms; 6,944 KB
testcase_14	AC	3 ms; 6,940 KB
testcase_15	AC	4 ms; 6,944 KB
testcase_16	AC	4 ms; 6,940 KB
testcase_17	AC	14 ms; 6,940 KB
testcase_18	AC	29 ms; 8,192 KB
testcase_19	AC	34 ms; 9,088 KB
testcase_20	AC	2 ms; 6,940 KB
testcase_21	AC	37 ms; 11,008 KB
testcase_22	AC	62 ms; 10,728 KB
testcase_23	AC	41 ms; 10,880 KB
testcase_24	AC	40 ms; 11,008 KB
testcase_25	AC	44 ms; 10,880 KB
testcase_26	AC	40 ms; 11,264 KB
testcase_27	AC	21 ms; 11,392 KB
testcase_28	AC	71 ms; 11,520 KB
testcase_29	AC	3 ms; 6,940 KB
testcase_30	AC	50 ms; 11,392 KB
testcase_31	AC	22 ms; 11,520 KB
testcase_32	AC	16 ms; 11,392 KB
testcase_33	AC	9 ms; 7,680 KB
testcase_34	AC	10 ms; 8,172 KB
testcase_35	AC	10 ms; 8,292 KB

ソースコード

#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define debugos cout
#define debug(v) {printf("L%d %s > ",__LINE__,#v);debugos<<(v)<<endl;}
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){debugos<<e<<" ";}debugos<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){debugos<<(m)[x]<<" ";}debugos<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){debugos<<(m)[y][x]<<" ";}debugos<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=decltype(l)();(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
inline void assert_call(bool assertion, function<void()> f) { if (!assertion) { cerr << "assertion fault:" << endl; f(); abort(); } }
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename Vec> inline ostream& _ostream_vecprint(ostream& os, const Vec& a) {
    os << '['; for (const auto& e : a) os << ' ' << e << ' '; os << ']'; return os;
}
template<typename T> inline ostream& operator<<(ostream& o, const vector<T>& v) { return _ostream_vecprint(o, v); }
template<typename T, size_t S> inline ostream& operator<<(ostream& o, const array<T, S>& v) { return _ostream_vecprint(o, v); }
template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }
template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }

#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif defined(__GNUC__)
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) noexcept {
            var = 0; T sign = 1;
            int cc = getchar_unlocked();
            for (; cc < '0' || '9' < cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var * sign;
        }
        inline int c() noexcept { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) noexcept { input_integer<int>(var); return *this; }
        inline MaiScanner& operator>>(long long& var) noexcept { input_integer<long long>(var); return *this; }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
    };
    class MaiPrinter {
    public:
        template<typename T>
        void output_integer(T var) noexcept {
            if (var == 0) { putchar_unlocked('0'); return; }
            if (var < 0)
                putchar_unlocked('-'),
                var = -var;
            char stack[32]; int stack_p = 0;
            while (var)
                stack[stack_p++] = '0' + (var % 10),
                var /= 10;
            while (stack_p)
                putchar_unlocked(stack[--stack_p]);
        }
        inline MaiPrinter& operator<<(char c) noexcept { putchar_unlocked(c); return *this; }
        inline MaiPrinter& operator<<(int var) noexcept { output_integer<int>(var); return *this; }
        inline MaiPrinter& operator<<(long long var) noexcept { output_integer<long long>(var); return *this; }
        inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
        inline MaiPrinter& operator<<(const string& str) {
            const char* p = str.c_str();
            const char* l = p + str.size();
            while (p < l) putchar_unlocked(*p++);
            return *this;
        }
        template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
    };
}
MaiScanner scanner;
MaiPrinter printer;


template<typename T>
// using T = int;
class LeftistHeap {
    struct Node {
        T value;
        unique_ptr<Node> left, right;
        int dist = 0;
        inline Node(const T& _value) :value(_value) { }
        template<typename ...Args>
        inline Node(Args&&... args) : value(args...) { }
    };
    static inline unique_ptr<Node>&& meldNode(unique_ptr<Node>&& heap1, unique_ptr<Node>&& heap2) {
        if (!heap1) return move(heap2);
        if (!heap2) return move(heap1);
        if (!(heap1->value < heap2->value)) heap1.swap(heap2);
        heap1->right = meldNode(move(heap1->right), move(heap2));
        if (!heap1->left || heap1->left->dist < heap1->right->dist)
            heap1->left.swap(heap1->right);
        heap1->dist = heap1->right ? heap1->right->dist + 1 : 1;
        return move(heap1);
    }
    unique_ptr<Node> root;

public:
    inline LeftistHeap() {}
    inline LeftistHeap(LeftistHeap<T>&& h):root(move(h.root)) {}
    inline LeftistHeap<T>& operator=(LeftistHeap<T>&& h) { root = move(h.root); return *this; }

    inline bool empty() const { return !root; }
    inline const T& top() const { return root->value; }
    inline void push(const T& val) {
        root = meldNode(move(root), make_unique<Node>(val));
    }
    template<typename ...Args>
    inline void emplace(Args&&... args) {
        root = meldNode(move(root), make_unique<Node>(args...));
    }
    inline void pop() {
        root = meldNode(move(root->left), move(root->right));
    }
    inline void meld(LeftistHeap<T>&& another) {
        root = meldNode(move(root), move(another.root));
    }
};


class Unionfind {
public:
    vector<int> data;
    Unionfind(size_t size) : data(size, -1) { }
    bool connect(size_t x, size_t y) {
        x = root(x); y = root(y);
        if (x != y) {
            if (data[y] < data[x]) swap(x, y);
            data[x] += data[y]; data[y] = (int)x;
        }
        return x != y;
    }
    inline bool same(size_t x, size_t y) {
        return root(x) == root(y);
    }
    inline size_t root(size_t x) {
        return (size_t)(data[x] < 0 ? x : data[x] = root(data[x]));
    }
    inline int size(size_t x) {
        return -data[root(x)];
    }
};


struct YX {
    int y, x;
};


// 


int H, W;
Unionfind unionfind(0);
bool colorMtx[200][200];
LeftistHeap<int> adjacents[40000];


inline bool valid(int y, int x) noexcept {
    return 0 <= y && 0 <= x && y < H && x < W;
}

inline int yx2i(int y, int x) noexcept {
    return x + y * W;
}
inline pair<int, int> i2pair(int i) noexcept {
    return make_pair(i / W, i%W);
}


//


void preprocess() {
    repeat(y, H) {
        repeat(x, W) {
            if (y < H - 1 && colorMtx[y][x] == colorMtx[y + 1][x])
                unionfind.connect(yx2i(y, x), yx2i(y + 1, x));
            if (x < W - 1 && colorMtx[y][x] == colorMtx[y][x + 1])
                unionfind.connect(yx2i(y, x), yx2i(y, x + 1));
        }
    }
    repeat(y, H) {
        repeat(x, W) {
            int r1 = unionfind.root(yx2i(y, x));
            if (y < H - 1 && colorMtx[y][x] != colorMtx[y + 1][x]) {
                int r2 = unionfind.root(yx2i(y + 1, x));
                adjacents[r1].push(r2);
                adjacents[r2].push(r1);
            }
            if (x < W - 1 && colorMtx[y][x] != colorMtx[y][x + 1]) {
                int r2 = unionfind.root(yx2i(y, x + 1));
                adjacents[r1].push(r2);
                adjacents[r2].push(r1);
            }
        }
    }
}


inline bool& pickColor(int y, int x) {
    int i = unionfind.root(yx2i(y, x));
    return colorMtx[i / W][i%W];
}


void query(int py, int px, bool pcolor) {
    if (pcolor == pickColor(py, px)) return;
    pickColor(py, px) = pcolor;

    int r = unionfind.root(yx2i(py, px));
    LeftistHeap<int> new_adjacents;
    int alast = -1;
    while (!adjacents[r].empty()) {
        int a = adjacents[r].top(); adjacents[r].pop();
        if (a == alast) continue;
        alast = a;
        int r2 = unionfind.root(a);
        if (unionfind.same(r, r2)) continue;
        new_adjacents.meld(move(adjacents[r2]));
        unionfind.connect(r, r2);
    }
    //debugv(*new_adjacents);
    r = unionfind.root(yx2i(py, px));
    //debug(r);
    adjacents[r] = move(new_adjacents);
}


int main() {
    scanner >> H >> W;
    unionfind = Unionfind(H*W);

    repeat(y, H) {
        repeat(x, W) {
            int a; scanner >> a;
            colorMtx[y][x] = a;
        }
    }

    preprocess();

    int q;
    scanner >> q;
    repeat(i, q) {
        int r, c, x;
        scanner >> r >> c >> x;
        query(r - 1, c - 1, x);
    }

    repeat(y, H) {
        repeat(x, W) {
            printer << (int)(pickColor(y, x)) << ' ';
        }
        printer << '\n';
    }

    return 0;
}