# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43016 | RayaBurong25_1 | One-Way Streets (CEOI17_oneway) | C++14 | 153 ms | 21792 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 <stdio.h>
#include <vector>
#include <cassert>
typedef struct edge edge;
struct edge
{
int u, v;
};
std::vector<edge> E;
int inMST[100005];
std::vector<edge> AdjList[100005];
int Pa[100005];
int UF(int u)
{
return (Pa[u] == 0)?u:(Pa[u] = UF(Pa[u]));
}
int vis[100005];
int p[100005][20];
int h[100005];
int pi[100005];
void dfsCyc(int u)
{
// printf("dfsCyc %d\n", u);
int i, v, s = AdjList[u].size();
for (i = 0; i < s; i++)
{
v = AdjList[u][i].u;
if (v != p[u][0])
{
// printf(" v %d\n", v);
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... |