Submission #36036

#	Time	Username	Problem	Language	Result	Execution time	Memory
36036		funcsr	Pipes (CEOI15_pipes)	C++14	100 / 100	703 ms	14956 KiB

pipes

#include <bitset>
#include <cassert>
#include <vector>
#include <tuple>
#define rep(i, n) for (int i=0; i<(n); i++)
#define INF 1145141919
#define pb push_back
#define _1 first
#define _2 second

using namespace std;
typedef pair<int, int> P;

struct UnionFind {
  int U[100000], R[100000];
  UnionFind(int N) {
    rep(i, N) U[i] = i, R[i] = 1;
  }
  int find(int x) {
    if (U[x] == x) return x;
    return U[x] = find(U[x]);
  }
  void unite(int x, int y) {
    x = find(x), y = find(y);
    if (x == y) return;
    if (R[x] < R[y]) swap(x, y);
    U[y] = x;
    R[x] += R[y];
  }
  bool same(int x, int y) {
    return find(x) == find(y);
  }
};

int N, M;
vector<P> G[100000];

bool used[100000];
int R[100000], T[100000];
void dfs(int x, int pe, int r) {
  used[x] = true;
  R[x] = r;
  for (P pp : G[x]) {
    int t = pp._1;
    if (pp._2 == pe) continue;
    if (used[t]) {
      if (R[x] > R[t]) T[x]++, T[t]--;
      continue;
    }
    dfs(t, pp._2, r+1);
  }
}

void dfs2(int x, int p) {
  used[x] = true;
  for (P pp : G[x]) {
    int t = pp._1;
    if (t == p || used[t]) continue;
    dfs2(t, x);
    T[x] += T[t];
  }
  if (p != -1 && T[x] == 0) printf("%d %d\n", x+1, p+1);
}

inline int readInt() {
  char c = '\0';
  while (c<'0' || c>'9') c = getchar();
  int x = 0;
  while ('0' <= c && c <= '9') x = 10*x+(c-'0'), c = getchar();
  return x;
}

signed main() {
  N = readInt();
  M = readInt();
  UnionFind uf1(N), uf2(N);
  rep(i, M) {
    int u = readInt()-1;
    int v = readInt()-1;
    if (!uf1.same(u, v)) {
      G[u].pb(P(v, i)), G[v].pb(P(u, i));
      uf1.unite(u, v);
    }
    else if (!uf2.same(u, v)) {
      G[u].pb(P(v, i)), G[v].pb(P(u, i));
      uf2.unite(u, v);
    }
  }
  rep(i, N) used[i] = false;
  rep(i, N) if (!used[i]) dfs(i, -1, 0);
  rep(i, N) used[i] = false;
  rep(i, N) if (!used[i]) dfs2(i, -1);
  return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10