oj.uz

Submission #1085979

# Submission time Handle Problem Language Result Execution time Memory
1085979 2024-09-09T08:46:04 Z juicy Pipes (CEOI15_pipes) C++17
40 / 100
 688 ms 65536 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

const int N = 1e5;

struct dsu {
  int pr[N];

  dsu() {
    memset(pr, -1, sizeof(pr));
  }

  int find(int u) {
    return pr[u] < 0 ? u : pr[u] = find(pr[u]);
  }

  bool mrg(int u, int v) {
    if ((u = find(u)) == (v = find(v))) {
      return 0;
    }
    if (pr[u] > pr[v]) {
      swap(u, v);
    }
    pr[u] += pr[v];
    pr[v] = u;
    return 1;
  }
} a, b;

int n, m;
int low[N], num[N];
vector<int> g[N];

void add(int u, int v) {
  g[u].push_back(v);
  g[v].push_back(u);
}

int timer;

void dfs(int u, int p) {
  low[u] = num[u] = ++timer;
  bool flg = 0;
  for (int v : g[u]) {
    if (v == p && !flg) {
      flg = 1;
      continue;
    }
    if (!num[v]) {
      dfs(v, u);
      low[u] = min(low[u], low[v]);
      if (low[v] > num[u]) {
        cout << u + 1 << " " << v + 1 << "\n";
      }
    } else {
      low[u] = min(low[u], num[v]);
    }
  }
}

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

  cin >> n >> m;
  while (m--) {
    int u, v; cin >> u >> v; --u, --v;
    if (a.mrg(u, v)) {
      add(u, v);
    } else if (b.mrg(u, v)) {
      add(u, v);
    }
  }
  for (int i = 0; i < n; ++i) {
    if (!num[i]) {
      dfs(i, i);
    }
  }
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3420 KB Output is correct
2 Correct 1 ms 3416 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4160 KB Output is correct
2 Correct 3 ms 3932 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 9300 KB Output is correct
2 Correct 56 ms 8956 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 14156 KB Output is correct
2 Correct 112 ms 15440 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 176 ms 22056 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 229 ms 31568 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 354 ms 45084 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 480 ms 57936 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 575 ms 65536 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 688 ms 65536 KB Memory limit exceeded
2 Halted 0 ms 0 KB -