oj.uz

답안 #667491

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
667491 2022-12-01T15:14:16 Z Alish Pipes (CEOI15_pipes) C++17
0 / 100
 5000 ms 6828 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long int	ll;
typedef long double	ld;

#define F		first
#define S		second
#define pb		push_back
#define endl            '\n'
#define Mp		make_pair
#define all(x) x.begin(), x.end()
#define debug(x)  cerr << #x << " = " << x << endl
#define set_dec(x)	cout << fixed << setprecision(x);
#define fast_io                     ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io                     freopen("in.txt" , "r+" , stdin) ; freopen("out.txt" , "w+" , stdout);


ll mod = 1e9+7;

ll power(ll a, ll b)
{
    return (!b ? 1 : (b & 1 ? a * power(a * a % mod, b / 2) % mod : power(a * a % mod, b / 2) % mod));
}
const int N= 1e5+23;
vector<int> g[N] ;
int mn[N] , h[N] , par1[N] , par2[N] , vis[N];
int getPar1(int v){
    return (par1[v]==-1)?v: getPar1(par1[v]);
}
int getPar2(int v){
    return (par2[v]==-1)? v: getPar2(par2[v]);
}
bool Union1(int v, int u){
    v= getPar1(v); u = getPar1(u);
    if(u==v) return 0;
    par1[u]=v;
    return 1;
}
bool Union2(int v, int u){
    v= getPar2(v); u = getPar2(u);
    if(u==v) return 0;
    par2[u]=v;
    return 1;
}

void dfs(int v, int p ){
    vis[v]=1;
    mn[v]=h[v];
    for(int u: g[v]){
        if(u==p) continue;
        if(!vis[u]){

            h[u]= h[v]+1;
            dfs(u,v);
            mn[v]= min (mn[v], mn[u]);

        }
        else{
            mn[v]= min(mn[v] , h[u]);
        }
    }
    if(p && mn[v]==h[v]) cout<<p<<" "<<v<<endl;
}

int main(){
    fast_io
    int n , m; cin>>n>>m;
    for(int i=1; i<=n; i++) par1[i]=par2[i]=-1;

    for(int i=1 ;i<=m; i++){
        int u ,v; cin>>v>>u;
        if(Union1(v,u)){
            g[v].pb(u); g[u].pb(v);
        }
        else if(Union2(u,v)){
            g[v].pb(u); g[u].pb(v);
        }
    }
    for(int i=1; i<=n; i++) if(!vis[i]) dfs(i,0);

}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Incorrect 2 ms 2644 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 3128 KB Output is correct
2 Incorrect 10 ms 2876 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2222 ms 2980 KB Output is correct
2 Incorrect 405 ms 2840 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5094 ms 3108 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5092 ms 3844 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5033 ms 5940 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5018 ms 6288 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5044 ms 6828 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5046 ms 6780 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5038 ms 6568 KB Time limit exceeded
2 Halted 0 ms 0 KB -