# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
140683 | khrbuddy03 | 문명 (KOI17_civilization) | C++14 | 1058 ms | 54092 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 inf = 2e3 + 9;
const int dx[4] = {-1, 1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
struct ds {
int par[inf * inf], siz[inf * inf];
inline int find(int u) {
if (u == par[u]) return u;
return par[u] = find(par[u]);
}
inline void merge(int u, int v) {
u = find(u); v = find(v);
if (u == v) return;
par[u] = v;
siz[v] += siz[u];
siz[u] = 0;
}
} cul;
int n, m;
int vis[inf][inf];
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> m;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |