oj.uz

답안 #873186

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
873186 2023-11-14T15:29:46 Z Ghulam_Junaid Pipes (CEOI15_pipes) C++17
100 / 100
 878 ms 14420 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 1;
int n, m, h[N], mnh[N], edges, u, v, i;
bool vis[N];
vector<pair<int, int>> g[N];

int root1(int& v){
    return (h[v] == -1 ? v : h[v] = root1(h[v]));
}

int root2(int& v){
    return (mnh[v] == -1 ? v : mnh[v] = root2(mnh[v]));
}

void merge1(int& u, int& v){    
    int r1 = root1(v);
    int r2 = root1(u);

    h[r1] = r2;

    edges++;
    g[v].push_back({u, edges});
    g[u].push_back({v, edges});
}

void merge2(int& u, int& v){
    int r1 = root2(u);
    int r2 = root2(v);

    mnh[r1] = r2;

    edges++;
    g[v].push_back({u, edges});
    g[u].push_back({v, edges});
}

void dfs(int& v, pair<int, int> prev = {-1, -1}){
    vis[v] = 1;
    if (prev.first == -1)
        h[v] = 0;
    mnh[v] = h[v];

    for (auto& [u, id] : g[v]){
         if (prev.first == u and prev.second == id)
            continue;

        mnh[v] = min(mnh[v], h[u]);

        if (vis[u])
            continue;

        h[u] = h[v] + 1;
        dfs(u, {v, id});
        mnh[v] = min(mnh[v], mnh[u]);

        if (mnh[u] >= h[u])
            printf("%d %d\n", u, v);
            
    }
}

int main(){

    scanf("%d%d", &n, &m);

    for (i=1; i<=n; i++)
        h[i] = mnh[i] = -1;

    for (i=0; i<m; i++){
        scanf("%d%d", &u, &v);

        if (root1(u) != root1(v))
            merge1(u, v);
        else if (root2(u) != root2(v))
            merge2(u, v);
    }

    for (i=1; i<=n; i++)
        h[i] = mnh[i] = n + 100;

    for (v = 1; v <= n; v++)
        if (!vis[v])
            dfs(v);
}

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
pipes.cpp:72:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |         scanf("%d%d", &u, &v);
      |         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3164 KB Output is correct
2 Correct 4 ms 3096 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 3028 KB Output is correct
2 Correct 77 ms 3024 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 134 ms 3920 KB Output is correct
2 Correct 187 ms 3436 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 212 ms 5460 KB Output is correct
2 Correct 191 ms 5220 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 302 ms 10832 KB Output is correct
2 Correct 250 ms 8016 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 437 ms 12112 KB Output is correct
2 Correct 438 ms 8884 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 577 ms 14420 KB Output is correct
2 Correct 543 ms 10320 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 744 ms 14416 KB Output is correct
2 Correct 683 ms 10404 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 878 ms 13808 KB Output is correct
2 Correct 852 ms 10464 KB Output is correct