oj.uz

Submission #682109

# Submission time Handle Problem Language Result Execution time Memory
682109 2023-01-15T18:57:48 Z MilosMilutinovic Pipes (CEOI15_pipes) C++14
90 / 100
 3273 ms 13696 KB 
/**
 *    author:  wxhtzdy
 *    created: 15.01.2023 19:07:48
**/
#include <bits/stdc++.h>

using namespace std;

const int MAX = 100000;
const int L = 16;

int n, m;
vector<int> g[MAX];
int f[MAX];
int i;
int j;
int par[MAX];
int dep[MAX];
int jump[MAX][L];
int u;
int v;
int pu;
int pv;
int w;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);  
  cin >> n >> m;
  for (i = 0; i < n; i++) {
    par[i] = -1;
  }
  function<int(int)> get = [&](int x) {
    return par[x] < 0 ? x : par[x] = get(par[x]);
  };
  for (i = 0; i < n; i++) {
    for (j = 0; j < L; j++) {
      jump[i][j] = i;
    }
  }
  function<void(int, int)> Dfs = [&](int v, int pr) {
    dep[v] = dep[pr] + 1;
    jump[v][0] = pr;
    for (j = 1; j < L; j++) {
      jump[v][j] = jump[jump[v][j - 1]][j - 1];
    }    
    for (int u : g[v]) {
      if (u != pr) {
        Dfs(u, v);
      }
    }
  }; 
  auto LCA = [&](int u, int v) {
    if (dep[u] > dep[v]) {
      swap(u, v);
    }
    for (j = L - 1; j >= 0; j--) {
      if (dep[jump[v][j]] >= dep[u]) {
        v = jump[v][j];
      }
    }
    if (u == v) {
      return u;
    }
    for (j = L - 1; j >= 0; j--) {
      if (jump[u][j] != jump[v][j]) {
        u = jump[u][j];
        v = jump[v][j];
      }
    }
    return jump[u][0];
  };
  for (i = 0; i < m; i++) {
    cin >> u >> v;
    --u; --v;
    if (get(u) != get(v)) {
      pu = get(u);
      pv = get(v);
      if (par[pu] > par[pv]) {
        swap(pu, pv);
        swap(u, v);        
      }
      Dfs(v, u);
      g[u].push_back(v);
      g[v].push_back(u);
      par[pu] += par[pv];
      par[pv] = pu;
    } else {
      w = LCA(u, v);
      f[u] += 1;
      f[v] += 1;
      f[w] -= 2;  
    }
  }
  function<void(int, int)> Solve = [&](int v, int pr) {
    for (int u : g[v]) {
      if (u != pr) {
        Solve(u, v);
        f[v] += f[u];
      }
    }
    if (f[v] == 0 && pr != -1) {
      cout << v + 1 << " " << pr + 1 << '\n';
    }
  };
  for (i = 0; i < n; i++) {
    if (get(i) == i) {
      Solve(i, -1);
    }
  }
  return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Incorrect 2 ms 2644 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 3564 KB Output is correct
2 Correct 186 ms 3544 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 4236 KB Output is correct
2 Correct 378 ms 4172 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 551 ms 5684 KB Output is correct
2 Correct 504 ms 6232 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 844 ms 10156 KB Output is correct
2 Correct 743 ms 10092 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1465 ms 11272 KB Output is correct
2 Correct 1308 ms 11288 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2095 ms 13364 KB Output is correct
2 Correct 2033 ms 13292 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2342 ms 13696 KB Output is correct
2 Correct 2528 ms 13448 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3273 ms 13016 KB Output is correct
2 Correct 2659 ms 13508 KB Output is correct