제출 #975238

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
975238		duckindog	Pipes (CEOI15_pipes)	C++17	0 / 100	1522 ms	65536 KiB

pipes

#include <bits/stdc++.h>

using namespace std;

const int N = 100'000 + 1;
int n, m;
vector<int> ad[N];
int low[N], num[N], it;

void dfs(int u, int p = -1) { 
  low[u] = num[u] = ++it;

  for (const auto& v : ad[u]) { 
    if (v == p) continue;

    if (!low[v]) {
      dfs(v, u);
      low[u] = min(low[u], low[v]);
      if (low[v] == num[v]) cout << u << " " << v << "\n";
    } else low[u] = min(low[u], num[v]);
  }
}

int32_t main() { 
  cin.tie(0)->sync_with_stdio(0);

  cin >> n >> m;
  for (int i = 1; i <= m; ++i) { 
    int u, v; cin >> u >> v;
    ad[u].push_back(v);
    ad[v].push_back(u);
  }

  for (int i = 1; i <= n; ++i) if (!low[i]) dfs(i);
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 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