# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
576347 | timmyfeng | Paint (COI20_paint) | C++17 | 3068 ms | 72704 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 D[] = {0, 1, 0, -1};
const int MAGIC = 1e9;
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<unordered_set<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].insert(i_new * m + j_new);
}
}
# | 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... |