Submission #948338

#	Time	Username	Problem	Language	Result	Execution time	Memory
948338		vjudge1	Pipes (CEOI15_pipes)	C++17	20 / 100	900 ms	65536 KiB

pipes

#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
const int N=1e5+5;
vector <int> g[N];
int vis[N],tin[N],low[N];
int t=0;
map <pair <int,int>,int> mp;
vector <pair <int,int> > ans;
void dfs(int v,int p){
    vis[v]=1;
    t++;
    tin[v]=t;
    low[v]=t;
    for(auto to : g[v]){
        if(to!=p){
            if(vis[to])low[v]=min(low[v],tin[to]);
            else{
                dfs(to,v);
                low[v]=min(low[v],low[to]);
                if(low[to]>tin[v]){
                    ans.pb({v,to});
                }
            }
        }
    }
    
}
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);cout.tie(0);
    int n,m;
    cin>>n>>m;
    for(int i=0;i<m;i++){
        int u,v;
        cin>>u>>v;
        g[u].pb(v);
        g[v].pb(u);
        mp[{u,v}]++;
        mp[{v,u}]++;
    }
    for(int i=1;i<=n;i++){
        if(!vis[i])dfs(i,0);
        
    }
    for(auto x : ans){
        if(mp[x]==1)cout<<x.ff<<" "<<x.ss<<"\n";
    }
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10