# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
928606 | jojo | One-Way Streets (CEOI17_oneway) | C++14 | 4 ms | 18264 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;
vector < int > E[100001], TE[100001];
int n, m, p;
pair < int, int > edges[100001], pairs[100001];
vector < int > order;
int fa[100001], vi[100001], dep[100001], covered[100001], com[100001], C, fa2[100001], dep2[100001], J2[17][100001], JC[17][100001];
void DFS(int p, int f, int d)
{
vi[p] = 1;
fa[p] = f;
dep[p] = d;
order.push_back(p);
for (int v : E[p])
if (!vi[v])
DFS(v, p, d + 1);
else if (v != fa[p] && dep[v] < dep[p])
{
covered[p]++;
covered[v]--;
}
}
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++)
{
scanf("%d%d", &edges[i].first, &edges[i].second);
E[edges[i].first].push_back(edges[i].second);
E[edges[i].second].push_back(edges[i].first);
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... |