Submission #576378

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
576378	2022-06-13T05:12:57 Z	timmyfeng	Paint (COI20_paint)	C++17	0 / 100	466 ms	152712 KB

paint

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

const int D[] = {0, 1, 0, -1};
const int MAGIC = 128;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

	int n, m; cin >> n >> m;

	vector<int> color(n * m);
	for (auto &i : color) cin >> i;

    vector<unordered_set<int>> neighbors(n * m);
	vector<vector<int>> members(n * m);
	vector<int> leader(n * m);

	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			int id = i * m + j;
			leader[id] = id;
			members[id].push_back(id);
			for (int dir = 0; dir < 4; ++dir) {
				int i_new = i + D[dir], j_new = j + D[(dir + 1) % 4];
				if (0 <= i_new && i_new < n && 0 <= j_new && j_new < m) {
                    neighbors[id].insert(i_new * m + j_new);
				}
			}
		}
	}

	vector<vector<unordered_set<int>>> neighbors_by_color(n * m);
    unordered_set<int> big_groups;

    auto normalize = [&](int a) {
        unordered_set<int> neighbors_new;
        for (auto b : neighbors[a]) {
            if (leader[b] != a)
                neighbors_new.insert(leader[b]);
        }
        neighbors[a] = neighbors_new;
    };

	auto update = [&](int a) {
        if ((int) members[a].size() >= MAGIC) {
            for (auto b : big_groups) {
                if (a != b && neighbors_by_color[a][color[b]].count(b))
                    neighbors_by_color[b][color[a]].insert(a);
            }
        } else {
            normalize(a);
            for (auto b : big_groups) {
                if (neighbors[a].count(b))
                    neighbors_by_color[b][color[a]].insert(a);
            }
        }
	};

	auto merge = [&](int a, int b) {
		if (members[a].size() < members[b].size()) swap(a, b);

        if ((int) members[a].size() < MAGIC && (int) (members[a].size() + members[b].size()) >= MAGIC) {
            normalize(a);
            for (auto u : neighbors[a])
                neighbors_by_color[a][color[u]].insert(u);
            neighbors_by_color[a].resize(1e5);
            big_groups.insert(a);
        }

        if ((int) (members[a].size() + members[b].size()) >= MAGIC) {
            normalize(b);
            for (auto u : neighbors[b])
                neighbors_by_color[a][color[u]].insert(u);
            neighbors_by_color[b].clear();
            big_groups.erase(b);
        }

		for (auto i : members[b]) leader[i] = a;

		members[a].insert(members[a].end(), members[b].begin(), members[b].end());
		members[b].clear();

		neighbors[a].insert(neighbors[b].begin(), neighbors[b].end());
		neighbors[b].clear();
	};

	auto fill = [&](int a, int c) {
		a = leader[a];

        while (true) {
            if ((int) members[a].size() < MAGIC) {
                normalize(a);
                bool merged = false;
                auto initial_neighbors = neighbors[a];
                for (auto b : initial_neighbors) {
                    if (color[b] == c) {
                        merged = true;
                        merge(a, b);
                        a = leader[a];
                    }
                }
                if (!merged) break;
            } else {
                if (neighbors_by_color[a][c].empty()) break;

                int b = *neighbors_by_color[a][c].begin();
                neighbors_by_color[a][c].erase(b);
                b = leader[b];

                if (b != a && color[b] == c) {
                    merge(a, b);
                    a = leader[a];
                }
            }
        }

		color[a] = c;
		update(a);
	};

	for (int i = 0; i < n * m; ++i)
		fill(i, color[i]);

	int q; cin >> q;

	while (q--) {
		int i, j, c; cin >> i >> j >> c; --i, --j;
		fill(i * m + j, c);
	}

	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			cout << color[leader[i * m + j]] << " ";
		}
		cout << "\n";
	}
}

Subtask #1

0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	596 KB	Output is correct
2	Correct	5 ms	876 KB	Output is correct
3	Correct	20 ms	4024 KB	Output is correct
4	Runtime error	30 ms	6604 KB	Execution killed with signal 11
5	Halted	0 ms	0 KB	-

Subtask #2

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	182 ms	16224 KB	Output is correct
2	Runtime error	283 ms	64400 KB	Execution killed with signal 11
3	Halted	0 ms	0 KB	-

Subtask #3

0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	413 ms	152712 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 52.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	466 ms	112332 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-