# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
740018 | abczz | Connecting Supertrees (IOI20_supertrees) | C++14 | 204 ms | 28096 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 <iostream>
#include <vector>
#include <array>
#define ll int
using namespace std;
vector <ll> X[1000];
vector <ll> Z;
vector<array<ll, 2>> V[3];
vector<vector<int>> F;
vector <int> tmp;
bool B[1000], D[1000], E[1000], R[1000][1000];
ll n, a, b, z, P[1000];
ll dsu(ll u) {
if (P[u] == u) return u;
else return P[u] = dsu(P[u]);
}
int construct(std::vector<std::vector<int>> p) {
n = p.size();
for (int i=0; i<n; ++i) P[i] = i;
for (int i=0; i<n; ++i) {
F.push_back(tmp);
for (int j=0; j<n; ++j) {
F[i].push_back(0);
if (p[i][j] == 3) return 0;
if (p[i][j]) {
a = dsu(i), b = dsu(j);
if (a != b) P[a] = 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |