oj.uz

Submission #467298

# Submission time Handle Problem Language Result Execution time Memory
467298 2021-08-22T12:41:00 Z phathnv Paint (COI20_paint) C++11
48 / 100
 3000 ms 25652 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 200000;
const int BLOCKSIZE = 1;

int m, n, q, curInd;
vector<vector<int>> ind;
vector<int> adj[N];
map<int, vector<int>> s[N];
int root[N], sz[N], col[N];

void MergeMap(int u, int v) {
    for (auto &p : s[u]) {
        if (s[v].find(p.first) != s[v].end()) {
            auto &q = s[v][p.first];
            if (p.second.size() < q.size())
                swap(p.second, q);
            for (int x : q)
                p.second.push_back(x);
            s[v].erase(p.first);
        }
    }
    for (auto &p : s[v]) {
        assert(s[u].find(p.first) == s[u].end());
        s[u][p.first] = p.second;
    }
    s[v].clear();
}

int FindRoot(int u) {
    if (u == root[u])
        return u;
    return root[u] = FindRoot(root[u]);
}

void Merge(int u, int v) {
    u = FindRoot(u);
    v = FindRoot(v);
    if (u == v)
        return;
    assert(col[u] == col[v]);
    if (sz[u] < sz[v])
        swap(u, v);
    for (int x : adj[v])
        adj[u].push_back(FindRoot(x));
    adj[v].clear();
    MergeMap(u, v);
    root[v] = u;
    sz[u] += sz[v];
    if (sz[u] >= BLOCKSIZE) {
        vector<int> newAdj;
        for (int x : adj[u]) {
            x = FindRoot(x);
            if (x == u)
                continue;
            if (sz[x] >= BLOCKSIZE) {
                newAdj.push_back(x);
                if (sz[u] - sz[v] < BLOCKSIZE)
                    adj[x].push_back(u);
            } else {
                s[u][col[x]].push_back(x);
            }
        }
        adj[u] = newAdj;
    } else {
        vector<int> newAdj;
        for (int x : adj[u]) {
            x = FindRoot(x);
            if (x == u)
                continue;
            newAdj.push_back(x);
            if (sz[x] >= BLOCKSIZE)
                s[x][col[u]].push_back(u);
        }
        adj[u] = newAdj;
    }
}

void Color(int u, int c) {
    u = FindRoot(u);
    col[u] = c;
    vector<pair<int, int>> shouldMerge, shouldDel;
    for (int v : adj[u]) {
        v = FindRoot(v);
        if (col[u] == col[v])
            shouldMerge.push_back({u, v});
    }
    if (s[u].find(c) != s[u].end()) {
        vector<int> &a = s[u][c];
        for (int v : a) {
            v = FindRoot(v);
            if (col[u] == col[v])
                shouldMerge.push_back({u, v});
        }
        s[u].erase(c);
    }
    for (auto p : shouldMerge)
        Merge(p.first, p.second);
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> m >> n;
    ind.assign(m, vector<int>(n, 0));
    for (int i = 0; i < m; i++)
        for (int j = 0; j < n; j++)
            ind[i][j] = curInd++;
    for (int i = 0; i < m; i++)
        for (int j = 0; j < n; j++) {
            if (i + 1 < m) {
                adj[ind[i][j]].push_back(ind[i + 1][j]);
                adj[ind[i + 1][j]].push_back(ind[i][j]);
            }
            if (j + 1 < n) {
                adj[ind[i][j]].push_back(ind[i][j + 1]);
                adj[ind[i][j + 1]].push_back(ind[i][j]);
            }
        }
    for (int i = 0; i < m * n; i++) {
        root[i] = i;
        sz[i] = 1;
        col[i] = -1;
    }
    for (int u = 0; u < m * n; u++) {
        int c;
        cin >> c;
        Color(u, c);
    }
    cin >> q;
    while (q--) {
        int x, y, c;
        cin >> x >> y >> c;
        x--, y--;
        Color(ind[x][y], c);
    }
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++)
            cout << col[FindRoot(ind[i][j])] << ' ';
        cout << '\n';
    }
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14412 KB Output is correct
2 Correct 10 ms 14488 KB Output is correct
3 Correct 18 ms 14932 KB Output is correct
4 Correct 21 ms 14944 KB Output is correct
5 Correct 198 ms 15064 KB Output is correct
6 Correct 55 ms 15096 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 16868 KB Output is correct
2 Correct 125 ms 19240 KB Output is correct
3 Correct 137 ms 25652 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 575 ms 24860 KB Output is correct
2 Correct 509 ms 25092 KB Output is correct
3 Correct 633 ms 25072 KB Output is correct
4 Correct 259 ms 25272 KB Output is correct
5 Correct 199 ms 24784 KB Output is correct

Subtask #4
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 734 ms 23564 KB Output is correct
2 Execution timed out 3090 ms 24388 KB Time limit exceeded
3 Halted 0 ms 0 KB -