# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
132973 | ae04071 | Duathlon (APIO18_duathlon) | C++11 | 162 ms | 28932 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;
int n,m,cut[100001],dfn[100001],low[100001],o,dn;
int bsz[200001];
vector<int> adj[100001],badj[200001];
stack<int> stk;
int ts;
void addEdge(int u,int v) {
badj[u].push_back(v);
badj[v].push_back(u);
}
void dfs(int cur,int p) {
ts++;
dfn[cur] = low[cur] = ++dn;
stk.push(cur);
for(auto &it:adj[cur]) if(it!=p) {
if(dfn[it]) low[cur] = min(low[cur],low[it]);
else {
dfs(it,cur);
low[cur] = min(low[cur],low[it]);
if(low[it]>=dfn[cur]) {
++n;
cut[cur] = 1;
while(!stk.empty()) {
int v=stk.top();
bsz[n]++;
if(cut[v]) addEdge(n, v);
if(v==cur) break;
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... |