제출 #1079622

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1079622		jk_	Pipes (CEOI15_pipes)	C++14	0 / 100	823 ms	65536 KiB

pipes

#include <bits/stdc++.h>
using namespace std;

struct ufind {
  vector<int> c;
  ufind(int n) : c(n) { iota(c.begin(), c.end(), 0); }
  int find(int k) { return c[k] == k ? k : (c[k] = find(c[k])); }
  void unite(int a, int b) { c[find(a)] = find(b); }
};

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);

  int n, m; cin >> n >> m;
  vector<vector<int>> g(n);
  array<ufind, 2> msts{{ufind(n), ufind(n)}};

  for (int i = 0; i < m; ++i) {
    int a, b; cin >> a >> b; --a; --b;
    for (auto& mst : msts) {
      if (mst.find(a) != mst.find(b)) {
        mst.unite(a, b);
        g[a].push_back(b);
        g[b].push_back(a);
        break;
      }
    }
  }

  vector<pair<int, int>> bridges;
  vector<bool> visited(n);
  vector<int> tin(n), low(n);
  int timer=0;

  auto dfs = [&](auto&& self, int v, int p = -1) -> void {
    visited[v] = true;
    tin[v] = low[v] = timer++;
    for (int to : g[v]) {
      if (to == p) continue;
      if (visited[to]) {
        low[v] = min(low[v], tin[to]);
      } else {
        self(self, to, v);
        low[v] = min(low[v], low[to]);
        if (low[to] > tin[v]) {
          cout << v+1 << ' ' << to+1 << '\n';
        }
      }
    }
  };
  for (int i = 0; i < n; ++i)
    if (!visited[i])
      dfs(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