# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
733934 | ismayil | Connecting Supertrees (IOI20_supertrees) | C++17 | 203 ms | 22140 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 "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e3 + 3;
struct DSU{
int par[MAX];
int find(int u){
if(par[u] < 0) return u;
return par[u] = find(par[u]);
}
bool unite(int u, int v){
u = find(u), v = find(v);
if(u == v) return false;
if(par[u] > par[v]) swap(u, v);
par[u] += par[v];
par[v] = u;
return true;
}
DSU(){
memset(par, -1, sizeof(par));
}
};
int construct(vector<vector<int>> p)
{
DSU dsu1, dsu2;
int n = p.size();
vector<vector<int>> answer(n, vector<int>(n, 0));
int mark[n] = {0};
for (int i = 0; i < n; 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |