oj.uz

Submission #948374

# Submission time Handle Problem Language Result Execution time Memory
948374 2024-03-18T05:03:40 Z vjudge1 Pipes (CEOI15_pipes) C++17
20 / 100
 102 ms 24640 KB 
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(x) x.begin(), x.end()
#define size(x) (int)x.size()

template<class S, class T>
bool chmin(S &a, const T &b) {
  return a > b ? (a = b) == b : false;
}
template<class S, class T>
bool chmax(S &a, const T &b) {
  return a < b ? (a = b) == b : false;
}
const int N = 5000;

vector<pair<int, int>> g[N];
vector<bool> vis;
vector<int> tin, fup, bridges;
int timer, v, p, idx;
 
void dfs() {
  vis[v] = true;
  tin[v] = fup[v] = ++timer;
  for (auto [to, new_idx] : g[v]) {
    if (idx == new_idx) continue;
    else if (vis[to]) chmin(fup[v], tin[to]);
    else {
      int pv = v, pp = p, pidx = idx;
      v = to, p = v, idx = new_idx;
      dfs();
      v = pv, p = pp, idx = pidx;
      chmin(fup[v], fup[to]);
      if (fup[to] > tin[v]) {
        bridges.push_back(new_idx);
      }
    }
  }
}

signed main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, m; cin >> n >> m;
  vis.assign(n, false);
  tin.resize(n), fup.resize(n);
  vector<pair<int, int>> vec;
  for (int i = 0; i < m; ++i) {
    int a, b; cin >> a >> b;
    a--, b--;
    g[a].push_back({b, i});
    g[b].push_back({a, i});
    vec.push_back({min(a, b), max(a, b)});
  }
  for (int i = 0; i < n; ++i) {
    if (!vis[i]) {
      v = i, p = -1, idx = -1;
      dfs();
    }
  }
  for (auto i : bridges) {
    cout << vec[i].first + 1 << ' ' << vec[i].second + 1 << '\n';
  }
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 860 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 1116 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 1884 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 2136 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 2396 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 2396 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 2380 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -