# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
118520 | zubec | One-Way Streets (CEOI17_oneway) | C++14 | 572 ms | 25424 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;
typedef long long ll;
typedef long double ld;
const int N = 100100;
vector <pair<int, int > > g[N];
int tin[N], fup[N], tim, tout[N], n, m;
int up[20][N];
bool used[N], isBridge[N];
void dfs(int v, int p){
used[v] = 1;
tin[v] = fup[v] = ++tim;
for (int i = 0; i < g[v].size(); i++){
int to = g[v][i].first, id = g[v][i].second;
if (id == p)
continue;
if (!used[to]){
dfs(to, id);
fup[v] = min(fup[v], fup[to]);
if (tin[v] < fup[to]){
isBridge[id] = 1;
}
} else {
fup[v] = min(fup[v], tin[to]);
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... |