oj.uz

답안 #576425

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
576425 2022-06-13T05:53:04 Z timmyfeng Paint (COI20_paint) C++17
100 / 100
 1211 ms 174440 KB 
#include <bits/stdc++.h>
using namespace std;
 
const int D[] = {0, 1, 0, -1};
const int MAGIC = 1024;
 
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) {
        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 (in_vector[b])
                    neighbors_by_color[b][color[a]].insert(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);
 
        if ((int) members[a].size() < MAGIC && (int) (members[a].size() + members[b].size()) >= MAGIC) {
            neighbors_by_color[a].resize(1e5);
            for (auto u : neighbors[a])
                neighbors_by_color[a][color[leader[u]]].insert(leader[u]);
            big_groups.insert(a);
        }
 
        if ((int) (members[a].size() + members[b].size()) >= MAGIC) {
            for (auto u : neighbors[b])
                neighbors_by_color[a][color[leader[u]]].insert(leader[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[a].end(), 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) {
                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;
            } 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
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 7 ms 1748 KB Output is correct
4 Correct 10 ms 6228 KB Output is correct
5 Correct 11 ms 6868 KB Output is correct
6 Correct 25 ms 6656 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 7504 KB Output is correct
2 Correct 175 ms 157260 KB Output is correct
3 Correct 131 ms 36896 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 186 ms 43908 KB Output is correct
2 Correct 190 ms 46948 KB Output is correct
3 Correct 223 ms 78936 KB Output is correct
4 Correct 252 ms 159916 KB Output is correct
5 Correct 228 ms 143880 KB Output is correct

Subtask #4
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 166 ms 33388 KB Output is correct
2 Correct 273 ms 43492 KB Output is correct
3 Correct 689 ms 156188 KB Output is correct
4 Correct 1211 ms 174440 KB Output is correct
5 Correct 363 ms 72336 KB Output is correct
6 Correct 291 ms 156620 KB Output is correct
7 Correct 256 ms 119676 KB Output is correct
8 Correct 212 ms 91824 KB Output is correct
9 Correct 352 ms 39472 KB Output is correct