tests/aoj/brides.brides.test.cpp

View this file on GitHub
Last update: 2020-10-29 16:58:23+01:00
Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_3_B

Depends on

Code

#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_3_B"

#include "../../code/graphs/bridges.cc"

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);

  int V, E;
  cin >> V >> E;

  adj.resize(V);

  F0R(i, E) {
      int u, v;
      cin >> u >> v;
      adj[u].eb(v);
      adj[v].eb(u);
  }

  vii res = findBridges();
  for(auto& [a, b] : res) if(a > b) swap(a, b);
  sort(ALL(res));
  for(auto [a, b] : res)
      cout << a << ' ' << b << endl;
}

#line 1 "tests/aoj/brides.brides.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_3_B"

#line 1 "code/template.cc"
// this line is here for a reason
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define fi first
#define se second
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define endl '\n'
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) (int)(x).size()
#define FOR(a, b, c) for (auto a = (b); (a) < (c); ++(a))
#define F0R(a, b) FOR (a, 0, (b))
template <typename T>
bool ckmin(T& a, const T& b) { return a > b ? a = b, true : false; }
template <typename T>
bool ckmax(T& a, const T& b) { return a < b ? a = b, true : false; }
#ifndef DEBUG
#define DEBUG 0
#endif
#define dout if (DEBUG) cerr
#define dvar(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#line 2 "code/graphs/bridges.cc"
vvi adj;
vi dfsNum, low;
int dfsCounter = 0;
int bridgeDfs(int v, vii& b, int p = -1) {
  dfsNum[v] = low[v] = dfsCounter++;
  for (int u : adj[v]) {
    if (dfsNum[u] == -1) {
      ckmin(low[v], bridgeDfs(u, b, v));
      if (low[u] > dfsNum[v]) b.eb(v, u);
    } else if (u != p)
      ckmin(low[v], dfsNum[u]);
  }
  return low[v];
}
vii findBridges() {
  vii bridges;
  dfsNum.assign(SZ(adj), -1);
  low.assign(SZ(adj), -1);
  F0R (v, SZ(adj))
    if (dfsNum[v] == -1) bridgeDfs(v, bridges);
  return bridges;
}
#line 4 "tests/aoj/brides.brides.test.cpp"

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);

  int V, E;
  cin >> V >> E;

  adj.resize(V);

  F0R(i, E) {
      int u, v;
      cin >> u >> v;
      adj[u].eb(v);
      adj[v].eb(u);
  }

  vii res = findBridges();
  for(auto& [a, b] : res) if(a > b) swap(a, b);
  sort(ALL(res));
  for(auto [a, b] : res)
      cout << a << ' ' << b << endl;
}