# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
53730 | fallingstar | Simurgh (IOI17_simurgh) | C++14 | 359 ms | 7136 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 "simurgh.h"
#include <cassert>
#include <iostream>
#include <vector>
#include <set>
using namespace std;
const int N = 240 + 2;
int n;
int eid[N][N];
bool royal[N][N];
struct TEdge { int u, v, id; };
vector<TEdge> el;
vector<TEdge*> SpanningTree(const vector<TEdge*> &elist)
{
vector<int> cpn(n);
for (int i = 0; i < n; ++i) cpn[i] = i;
vector<TEdge*> ret;
for (auto e: elist)
if (cpn[e->u] != cpn[e->v])
{
int old_cpn = cpn[e->v];
for (int i = 0; i < n; ++i)
if (cpn[i] == old_cpn) cpn[i] = cpn[e->u];
ret.push_back(e);
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... |