# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
159566 | theknife2001 | Konj (COCI19_konj) | C++17 | 76 ms | 4216 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 N=305;
const int M=2e5+55;
char ans[N][N];
int s[N][N];
int par[M];
int find_par(int u)
{
if(u==par[u])
return u;
par[u]=find_par(par[u]);
return par[u];
}
void merge(int u , int v)
{
u=find_par(u);
v=find_par(v);
if(u==v)
return ;
par[v]=u;
}
int main()
{
ios::sync_with_stdio(false);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |