# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
115867 | zubec | Duathlon (APIO18_duathlon) | C++14 | 225 ms | 26904 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 = 200100;
vector <int> g[N];
vector <int> stck;
vector <vector <int> > cmp;
int tin[N], fup[N], tim, n;
bool used[N];
void findCutpoints(int v, int p){
used[v] = 1;
tin[v] = fup[v] = ++tim;
stck.push_back(v);
for (int i = 0; i < g[v].size(); i++){
int to = g[v][i];
if (to == p)
continue;
if (!used[to]){
findCutpoints(to, v);
fup[v] = min(fup[v], fup[to]);
if (tin[v] <= fup[to]){
cmp.push_back({v});
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... |