# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1132820 | DangKhoizzzz | Kronican (COCI16_kronican) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pii pair <int , int>
#define arr3 array <int , 3>
using namespace std;
const int INF = 1e9 + 7;
const int maxn = 2e5 + 7;
struct DSU
{
vector <int> parent;
vector <int> sz;
void init(int n)
{
parent.assign(n+5 , 0);
sz.assign(n+5 , 0);
for(int i = 1; i <= n; i++)
{
sz[i] = 1;
parent[i] = i;
}
}
int find_par(int u)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |