# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
114790 | luciocf | Pipes (BOI13_pipes) | C++14 | 269 ms | 17016 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;
const int maxn = 1e5+10;
typedef long long ll;
typedef pair<int, int> pii;
int n, m;
int c[maxn];
int ans[maxn];
int pai[maxn], nivel[maxn], edgePai[maxn];
int firstCycle=-1, lastCycle=-1, lastEdge=-1;
bool mark[maxn], inCycle[maxn], ok=1;
vector<pii> grafo[maxn];
void dfs(int u, int p)
{
mark[u] = true;
for (auto pp: grafo[u])
{
int v = pp.first, e = pp.second;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |