# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
424925 | Mlxa | Connecting Supertrees (IOI20_supertrees) | C++14 | 305 ms | 31988 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;
using ll = long long;
#define all(x) x.begin(), x.end()
#define mp make_pair
#define mt make_tuple
#define x first
#define y second
#include "supertrees.h"
namespace my {
const int N = 1010;
int n, g[N][N], res[N][N];
void edge(int v, int u) {
res[v][u] = true;
res[u][v] = true;
}
vector<int> get_comp(int v, int msk) {
static int lst[N], timer = 0;
++timer;
lst[v] = timer;
queue<int> q;
vector<int> ret;
q.push(v);
while (q.size()) {
v = q.front(); q.pop();
ret.push_back(v);
# | 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... |