oj.uz

Submission #688201

# Submission time Handle Problem Language Result Execution time Memory
688201 2023-01-27T08:30:03 Z sugartheanh Paint (COI20_paint) C++14
39 / 100
 3000 ms 34244 KB 
#include <bits/stdc++.h>
using namespace std;

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

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<vector<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].push_back(i_new * m + j_new);
				}
			}
		}
	}

	vector<vector<set<int>>> neighbors_by_color(n * m);
    vector<bool> in_vector(n * m);
    set<int> big_groups;

    auto normalize = [&](int a) {
        vector<int> neighbors_new;
        for (auto b : neighbors[a]) {
            b = leader[b];
            if (leader[b] != a && !in_vector[b]) {
                neighbors_new.push_back(b);
                in_vector[b] = true;
            }
        }
        swap(neighbors[a], neighbors_new);
    };

	auto update = [&](int a) {
         {
            normalize(a);
            for (auto b : neighbors[a]) in_vector[b] = false;
        }
	};

	auto merge = [&](int a, int b) {
		if (members[a].size() < members[b].size()) swap(a, 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[a].end(), neighbors[b].begin(), neighbors[b].end());
		neighbors[b].clear();
	};

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

        while (true) {
            {
                bool merged = false;
                auto initial_neighbors = neighbors[a];
                for (auto b : initial_neighbors) {
                    b = leader[b];
                    if (b != a && color[b] == c) {
                        merged = true;
                        merge(a, b);
                        a = leader[a];
                    }
                }
                if (!merged) break;
            }
        }

		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
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 448 KB Output is correct
3 Correct 7 ms 1876 KB Output is correct
4 Correct 8 ms 1708 KB Output is correct
5 Correct 401 ms 2004 KB Output is correct
6 Correct 22 ms 2004 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 8636 KB Output is correct
2 Correct 109 ms 17448 KB Output is correct
3 Execution timed out 3072 ms 31072 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 159 ms 31372 KB Output is correct
2 Correct 161 ms 31132 KB Output is correct
3 Correct 153 ms 31456 KB Output is correct
4 Correct 190 ms 32020 KB Output is correct
5 Correct 154 ms 30380 KB Output is correct

Subtask #4
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 24108 KB Output is correct
2 Execution timed out 3068 ms 34244 KB Time limit exceeded
3 Halted 0 ms 0 KB -