oj.uz

답안 #576988

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

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

vector<set<int>> neighbors_by_color[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) {
        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(C_MAX);
            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 8 ms 14412 KB Output is correct
2 Correct 9 ms 14548 KB Output is correct
3 Correct 13 ms 15132 KB Output is correct
4 Correct 18 ms 19796 KB Output is correct
5 Correct 18 ms 20312 KB Output is correct
6 Correct 32 ms 24824 KB Output is correct
7 Correct 7 ms 14420 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 18128 KB Output is correct
2 Correct 215 ms 267712 KB Output is correct
3 Correct 139 ms 37124 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 185 ms 58204 KB Output is correct
2 Correct 180 ms 56628 KB Output is correct
3 Correct 214 ms 92844 KB Output is correct
4 Correct 281 ms 231148 KB Output is correct
5 Correct 253 ms 206388 KB Output is correct

Subtask #4
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 42188 KB Output is correct
2 Correct 275 ms 43620 KB Output is correct
3 Correct 723 ms 384488 KB Output is correct
4 Correct 655 ms 461248 KB Output is correct
5 Correct 392 ms 192992 KB Output is correct
6 Correct 275 ms 158284 KB Output is correct
7 Correct 234 ms 121160 KB Output is correct
8 Correct 211 ms 93484 KB Output is correct
9 Correct 313 ms 45232 KB Output is correct