oj.uz

Submission #36036

# Submission time Handle Problem Language Result Execution time Memory
36036 2017-12-04T09:46:55 Z funcsr Pipes (CEOI15_pipes) C++14
100 / 100
 703 ms 14956 KB 
#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.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2660 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3292 KB Output is correct
2 Correct 6 ms 3068 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 3132 KB Output is correct
2 Correct 50 ms 2972 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 3828 KB Output is correct
2 Correct 99 ms 3652 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 5544 KB Output is correct
2 Correct 135 ms 5244 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 11312 KB Output is correct
2 Correct 221 ms 8948 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 390 ms 12532 KB Output is correct
2 Correct 354 ms 9680 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 535 ms 14956 KB Output is correct
2 Correct 484 ms 11688 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 593 ms 14856 KB Output is correct
2 Correct 547 ms 11824 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 703 ms 14204 KB Output is correct
2 Correct 651 ms 11400 KB Output is correct