oj.uz

답안 #577000

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
577000 2022-06-13T21:25:17 Z timmyfeng Paint (COI20_paint) C++17
0 / 100
 184 ms 61784 KB 
#include <bits/stdc++.h>
using namespace std;
 
const int D[] = {0, 1, 0, -1};
const int MAGIC = 512;
const int C_MAX = 1e5;
const int N = 2e5;

vector<int> neighbors[N], members[N];
int color[N], leader[N];

vector<vector<int>> neighbors_by_color[N];
vector<bool> neighbors_big[N];
bool in_vector[N];
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
 
    int n, m; cin >> n >> m;
 
    for (int i = 0; i < n * m; ++i) cin >> color[i];
 
    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);
                }
            }
        }
    }
 
    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 : big_groups) {
            if (in_vector[b])
                neighbors_by_color[b][color[a]].push_back(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(C_MAX);
            neighbors_big[a].resize(n * m);
            for (auto u : neighbors[a]) {
                u = leader[u];
                if ((int) members[u].size() < MAGIC)
                    neighbors_by_color[a][color[u]].push_back(u);
                else
                    neighbors_big[a][u] = true;
            }
            big_groups.insert(a);
        }
 
        if ((int) (members[a].size() + members[b].size()) >= MAGIC) {
            for (auto u : neighbors[b]) {
                u = leader[u];
                if ((int) members[u].size() < MAGIC)
                    neighbors_by_color[a][color[u]].push_back(u);
                else
                    neighbors_big[a][u] = true;
            }
            neighbors_by_color[b].clear();
            neighbors_big[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()) {
                    bool merged = false;
                    for (auto b : big_groups) {
                        if (b != a && color[b] == c) {
                            merge(a, b);
                            merged = true;
                            break;
                        }
                    }
                    if (!merged) break;
                } else {
                    int b = neighbors_by_color[a][c].back();
                    neighbors_by_color[a][c].pop_back();
                    b = leader[b];
    
                    if (b != a && color[b] == c) {
                        merge(a, b);
                        a = leader[a];
                    }
                }
            }
        }

        if ((int) members[a].size() < MAGIC) {
            update(a);
        } 
        color[a] = c;
 
    };
 
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 22228 KB Output is correct
2 Correct 12 ms 22288 KB Output is correct
3 Correct 17 ms 22996 KB Output is correct
4 Correct 20 ms 25244 KB Output is correct
5 Incorrect 23 ms 25684 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 25900 KB Output is correct
2 Incorrect 138 ms 61784 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 161 ms 49272 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 184 ms 44120 KB Output isn't correct
2 Halted 0 ms 0 KB -