# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64461 | zubec | Parachute rings (IOI12_rings) | C++14 | 4029 ms | 44772 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>
//#include "grader.h"
using namespace std;
const int N = 1000100;
vector<int> g[N];
int tin[N], fup[N], tim, ans, n;
bool used[N];
void dfs(int v, int p){
tin[v] = fup[v] = ++tim;
int children = 0;
bool isCutpoint = 0;
for (int i = 0; i < g[v].size(); i++){
int to = g[v][i];
if (to == p)
continue;
if (used[to]){
fup[v] = min(fup[v], tin[to]);
} else {
dfs(to, v);
++children;
fup[v] = min(fup[v], fup[to]);
if (tin[v] <= fup[to] && p != -1 && !isCutpoint){
++ans;
isCutpoint = 0;
}
}
}
if (p == -1 && children > 1){
++ans;
}
}
void Init(int n){
::n = n;
for (int i = 1; i <= n; i++)
g[i].clear();
}
void Link(int a, int b){
++a;
++b;
g[a].push_back(b);
g[b].push_back(a);
}
int CountCritical(){
for (int i = 1; i <= n; i++){
used[i] = tin[i] = fup[i] = 0;
}
tim = 0;
ans = 0;
for (int i = 1; i <= n; i++){
if (!used[i])
dfs(i, 0);
}
return ans;
}
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... |