# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
85984 | tjdgus4384 | 문명 (KOI17_civilization) | C++14 | 922 ms | 43716 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<cstdio>
#include<string.h>
#include<queue>
using namespace std;
queue<pair<pair<int, int>, pair<int, int> > > q;
int pa[100001], sz[100001], rk[100001], ar[2001][2001];
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
int find(int u)
{
if(pa[u] == u) return u;
return pa[u] = find(pa[u]);
}
void merge(int u, int v)
{
u = find(u); v = find(v);
if(u == v) return;
if(rk[u] > rk[v]) swap(u, v);
pa[u] = v;
sz[v] += sz[u];
if(rk[u] == rk[v]) rk[v]++;
}
int main()
{
int n, k;
scanf("%d %d", &n, &k);
for(int i = 1;i <= k;i++)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |