| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 918358 | habel | One-Way Streets (CEOI17_oneway) | C++17 | 0 ms | 348 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;
#define int long long
#define INF (LLONG_MAX/2)
#pragma GCC optimize ("O3")
vector<vector<pair<int, int> > > g, g2;
vector<int> tin, l, comp;
vector<char> elirany;
int t = 1;
int mincomp=1;
void dfs(int v, int p = -1) {
tin[v] = t++;
l[v] = tin[v];
for (auto [u, i] : g[v]) {
if (u != p) {
if (!tin[u]) {
comp[u]=comp[v];
dfs(u, v);
l[v] = min(l[v], l[u]);
if (l[u] > tin[v]) {
mincomp++;
comp[u]=mincomp;
g2[comp[v]].push_back(make_pair(comp[u], i));
g2[comp[u]].push_back(make_pair(comp[v], -i));
}
} else {
l[v] = min(l[v], tin[u]);
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||