# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62625 | SpaimaCarpatilor | Simurgh (IOI17_simurgh) | C++17 | 285 ms | 18088 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<bits/stdc++.h>
using namespace std;
int N, M, id[509][509], x[130009], y[130009], ans[130009], q[130009];
bool traversed[130009];
bool anyEdge[509][509];
vector < int > v[509];
namespace edgesFinder
{
bool ap[509];
vector < int > starterPack, currComp;
void dfs (int nod)
{
ap[nod] = 1, currComp.push_back (nod);
for (auto it : v[nod])
if (ap[it] == 0)
starterPack.push_back (id[nod][it]), dfs (it);
}
void findEdges (int nod)
{
memset (ap, 0, sizeof (ap)), ap[nod] = 1;
starterPack.clear ();
vector < vector < int > > currEdges;
vector < int > representative;
for (int i=0; i<N; i++)
if (ap[i] == 0)
{
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... |