oj.uz

답안 #873577

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
873577 2023-11-15T10:13:41 Z Ghulam_Junaid Pipes (CEOI15_pipes) C++17
100 / 100
 971 ms 14416 KB 
#include <bits/stdc++.h>
using namespace std;
 
const int N = 1e5 + 1;
int n, m, h[N], mnh[N], edges, u, v, i, r1, r2, rut, cur, nxt;
bool vis[N];
vector<pair<int, int>> g[N];
 
int root1(int& v){
	rut = v;
    cur = v;
	while (h[rut]!=-1)
    	rut = h[rut];
	while (h[cur]!=-1){
        nxt = h[cur];
    	h[cur] = rut;
        cur = nxt;
    }
    return rut;
}
 
int root2(int& v){
    rut = v;
    cur = v;
	while (mnh[rut]!=-1)
    	rut = mnh[rut];
	while (mnh[cur]!=-1){
        nxt = mnh[cur];
    	mnh[cur] = rut;
        cur = nxt;
    }
  	return rut;
}
 
void merge1(int& u, int& v){    
    r1 = root1(v);
    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){
    r1 = root2(u);
    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:84:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
pipes.cpp:90:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |         scanf("%d%d", &u, &v);
      |         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 3156 KB Output is correct
2 Correct 85 ms 3004 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 3684 KB Output is correct
2 Correct 163 ms 3428 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 237 ms 5464 KB Output is correct
2 Correct 203 ms 4948 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 343 ms 10872 KB Output is correct
2 Correct 275 ms 8016 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 510 ms 12112 KB Output is correct
2 Correct 496 ms 8788 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 667 ms 14416 KB Output is correct
2 Correct 616 ms 10328 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 785 ms 14400 KB Output is correct
2 Correct 878 ms 10560 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 938 ms 13804 KB Output is correct
2 Correct 971 ms 10228 KB Output is correct