# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1108456 | simona1230 | Duathlon (APIO18_duathlon) | C++17 | 277 ms | 20552 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;
vector<int> v[200001];
int n,m;
void read()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;
cin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
}
int in[200001],low[200001];
int used[200001];
int hey;
int art[200001];
void dfs(int i,int p)
{
in[i]=hey++;
low[i]=in[i];
used[i]=1;
for(int j=0;j<v[i].size();j++)
{
int nb=v[i][j];
if(!used[nb])
{
dfs(nb,i);
low[i]=min(low[i],low[nb]);
}
else if(nb!=p)
{
low[i]=min(low[i],in[nb]);
}
}
cout<<i<<" "<<in[i]<<" "<<low[i]<<endl;
if(low[i]>=in[i])art[i]=1;
}
int main()
{
read();
for(int i=1;i<=n;i++)
if(!used[i])
{
dfs(i,-1);
if(v[i].size()==1)
art[i]=1;
}
for(int i=1;i<=n;i++)
cout<<art[i]<<" ";
cout<<endl;
return 0;
}
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... |