oj.uz

답안 #690039

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
690039 2023-01-30T03:35:00 Z sugartheanh Paint (COI20_paint) C++14
8 / 100
 3000 ms 45312 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 6 ms 1868 KB Output is correct
4 Correct 7 ms 1748 KB Output is correct
5 Correct 329 ms 2244 KB Output is correct
6 Correct 112 ms 2572 KB Output is correct
7 Correct 0 ms 320 KB Output is correct

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 8916 KB Output is correct
2 Correct 149 ms 21408 KB Output is correct
3 Execution timed out 3064 ms 31676 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1346 ms 42140 KB Output is correct
2 Correct 329 ms 39284 KB Output is correct
3 Correct 387 ms 43476 KB Output is correct
4 Execution timed out 3023 ms 45312 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 188 ms 26564 KB Output is correct
2 Execution timed out 3060 ms 34584 KB Time limit exceeded
3 Halted 0 ms 0 KB -