# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
584846 | eecs | Paint (COI20_paint) | C++17 | 1030 ms | 524288 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010, B = 500;
int r, c, q, bel[maxn], col[maxn];
vector<int> V[maxn], adj[maxn];
vector<unordered_set<int>> S[maxn];
bool mark[maxn];
set<int> big;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> r >> c;
for (int i = 0; i < r * c; i++) {
cin >> col[i];
bel[i] = i, V[i] = {i};
}
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
for (auto dir : {array<int, 2>{-1, 0}, {1, 0}, {0, -1}, {0, 1}}) {
int x = i + dir[0], y = j + dir[1];
if (!~x || x == r || !~y || y == c) continue;
adj[i * c + j].push_back(x * c + y);
}
}
}
auto merge = [&](int u, int v) {
if (V[u].size() < V[v].size()) swap(u, v);
if (V[u].size() < B && V[u].size() + V[v].size() >= B) {
S[u].resize(1e5), big.insert(u);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |