# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
55662 | red1108 | 문명 (KOI17_civilization) | C++17 | 600 ms | 30136 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 <iostream>
#include <utility>
#include <queue>
using namespace std;
typedef pair<int,int> P;
#define x first
#define y second
P t;
queue<P> q;
int table[2010][2010],ans=0,cnt,n,k;
int parent[100010];
int par(int a)
{
if(parent[a]==a) return a;
return parent[a]=par(parent[a]);
}
void uni(int a, int b)
{
if(par(a)!=par(b))
{
parent[par(a)]=par(b);
cnt--;
}
}
bool ch(int a, int b)
{
if(a<1||b<1||a>n||b>n) return 0;
return 1;
}
void view(int a, int b)
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... |