# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155126 | Akashi | Duathlon (APIO18_duathlon) | C++14 | 210 ms | 28380 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.
#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
using namespace std;
int n, m, nrc;
bool viz[100005];
int id[100005], h[100005], low[100005];
vector <int> v[100005];
set <int> v2[100005];
vector <int> ctc[100005];
stack <int> st;
void dfs(int nod, int papa = 0){
st.push(nod);
viz[nod] = 1;
for(auto it : v[nod]){
if(papa == it) continue ;
if(!viz[it]){
h[it] = low[it] = h[nod] + 1;
dfs(it, nod);
low[nod] = min(low[nod], low[it]);
}
else low[nod] = min(low[nod], low[it]);
}
if(low[nod] == h[nod]){
int x;
++nrc;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |