oj.uz

Submission #527694

# Submission time Handle Problem Language Result Execution time Memory
527694 2022-02-18T03:36:20 Z beepbeepsheep Pipes (CEOI15_pipes) C++17
10 / 100
 1025 ms 19012 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ii pair<ll,ll>
#define endl '\n'
const ll inf=1e15;
const ll mod=1e9+7;
const ll maxn=1e5+5;

vector<ll> adj[maxn];
ll cnt[maxn],depth[maxn],low[maxn];
ll par[maxn][2];
int root(ll x, ll l){
    if (par[x][l]==x) return x;
    return par[x][l]=root(par[x][l],l);
}
bool connect(ll a, ll b, ll l){
    if (root(a,l)==root(b,l)) return 0;
    par[root(a,l)][l]=root(b,l);
    return 1;
}
void dfs(ll node, ll p){
    for (auto u:adj[node]){
        if (depth[u]==-1){
            depth[u]=depth[node]+1;
            dfs(u,node);
            if (low[u]>depth[node]){
                cout<<node<<' '<<u<<endl;
            }
            low[node]=min(low[node],low[u]);
        } else if (u!=p){
            low[node]=min(low[node],depth[u]);
        }
    }
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n,e,a,b;
    cin>>n>>e;
    for (int i=0;i<maxn;i++) low[i]=inf;
    memset(depth,-1,sizeof(depth));
    for (int i=0;i<maxn;i++){
        par[i][0]=i;
        par[i][1]=i;
    }
    for (int i=0;i<e;i++){
        cin>>a>>b;
        if (connect(a,b,0) || connect(a,b,1)){
            adj[a].emplace_back(b);
            adj[b].emplace_back(a);
        }
    }
    for (int i=1;i<=n;i++){
        if (depth[i]!=-1) continue;
        depth[i]=1;
        dfs(i,-1);
    }
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5708 KB Output is correct
2 Incorrect 3 ms 5708 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6348 KB Output is correct
2 Incorrect 6 ms 6092 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 7536 KB Output is correct
2 Incorrect 91 ms 7384 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 157 ms 8320 KB Wrong number of edges
2 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 242 ms 9880 KB Output is correct
2 Correct 202 ms 8604 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 374 ms 15412 KB Output is correct
2 Incorrect 347 ms 12020 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 540 ms 16768 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 816 ms 19012 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 876 ms 18892 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1025 ms 18440 KB Memory limit exceeded
2 Halted 0 ms 0 KB -