Luzhiled's Library

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub ei1333/library

:heavy_check_mark: test/verify/aoj-0294.test.cpp

Depends on

Code

// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0294

#include "../../template/template.hpp"

#include "../../graph/others/dominator-tree.hpp"

int main() {
  int N, M, Q;
  cin >> N >> M;
  DominatorTree<> g(N);
  g.read(M, -1, false, true);
  g.build(0);
  cin >> Q;
  while(Q--) {
    int a;
    cin >> a;
    --a;
    if(g[a] == 0) cout << a + 1 << "\n";
    else cout << g[a] + 1 << "\n";
  }
}

#line 1 "test/verify/aoj-0294.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0294

#line 1 "template/template.hpp"
#include <bits/stdc++.h>

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template <typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward<F>(f)) {}

  template <typename... Args>
  decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, forward<Args>(args)...);
  }
};

template <typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{forward<F>(f)};
}
#line 4 "test/verify/aoj-0294.test.cpp"

#line 2 "graph/others/dominator-tree.hpp"

#line 2 "graph/graph-template.hpp"

/**
 * @brief Graph Template(グラフテンプレート)
 */
template <typename T = int>
struct Edge {
  int from, to;
  T cost;
  int idx;

  Edge() = default;

  Edge(int from, int to, T cost = 1, int idx = -1)
      : from(from), to(to), cost(cost), idx(idx) {}

  operator int() const { return to; }
};

template <typename T = int>
struct Graph {
  vector<vector<Edge<T> > > g;
  int es;

  Graph() = default;

  explicit Graph(int n) : g(n), es(0) {}

  size_t size() const { return g.size(); }

  void add_directed_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es++);
  }

  void add_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es);
    g[to].emplace_back(to, from, cost, es++);
  }

  void read(int M, int padding = -1, bool weighted = false,
            bool directed = false) {
    for (int i = 0; i < M; i++) {
      int a, b;
      cin >> a >> b;
      a += padding;
      b += padding;
      T c = T(1);
      if (weighted) cin >> c;
      if (directed)
        add_directed_edge(a, b, c);
      else
        add_edge(a, b, c);
    }
  }

  inline vector<Edge<T> > &operator[](const int &k) { return g[k]; }

  inline const vector<Edge<T> > &operator[](const int &k) const { return g[k]; }
};

template <typename T = int>
using Edges = vector<Edge<T> >;
#line 4 "graph/others/dominator-tree.hpp"

/**
 * @brief Dominator Tree
 *
 * @see http://sigma425.hatenablog.com/entry/2015/12/25/224053
 */
template <typename T = int>
struct DominatorTree : Graph<T> {
 public:
  using Graph<T>::Graph;
  using Graph<T>::g;

  void build(int root) {
    rg = Graph<T>(g.size());
    par.assign(g.size(), 0);
    idom.assign(g.size(), -1);
    semi.assign(g.size(), -1);
    ord.reserve(g.size());
    UnionFind uf(semi);

    const int N = (int)g.size();
    dfs(root);
    for (int i = 0; i < N; i++) {
      for (auto &to : g[i]) {
        if (~semi[i]) rg.add_directed_edge(to, i);
      }
    }

    vector<vector<int> > bucket(N);
    vector<int> U(N);
    for (int i = (int)ord.size() - 1; i >= 0; i--) {
      int x = ord[i];
      for (int v : rg[x]) {
        v = uf.eval(v);
        if (semi[x] > semi[v]) semi[x] = semi[v];
      }
      bucket[ord[semi[x]]].emplace_back(x);
      for (int v : bucket[par[x]]) U[v] = uf.eval(v);
      bucket[par[x]].clear();
      uf.link(par[x], x);
    }
    for (int i = 1; i < (int)ord.size(); i++) {
      int x = ord[i], u = U[x];
      idom[x] = semi[x] == semi[u] ? semi[x] : idom[u];
    }
    for (int i = 1; i < (int)ord.size(); i++) {
      int x = ord[i];
      idom[x] = ord[idom[x]];
    }
    idom[root] = root;
  }

  int operator[](const int &k) const { return idom[k]; }

 private:
  Graph<T> rg;

  struct UnionFind {
    const vector<int> &semi;
    vector<int> par, m;

    explicit UnionFind(const vector<int> &semi)
        : semi(semi), par(semi.size()), m(semi.size()) {
      iota(begin(par), end(par), 0);
      iota(begin(m), end(m), 0);
    }

    int find(int v) {
      if (par[v] == v) return v;
      int r = find(par[v]);
      if (semi[m[v]] > semi[m[par[v]]]) m[v] = m[par[v]];
      return par[v] = r;
    }

    int eval(int v) {
      find(v);
      return m[v];
    }

    void link(int p, int c) { par[c] = p; }
  };

  vector<int> ord, par;
  vector<int> idom, semi;

  void dfs(int idx) {
    semi[idx] = (int)ord.size();
    ord.emplace_back(idx);
    for (auto &to : g[idx]) {
      if (~semi[to]) continue;
      dfs(to);
      par[to] = idx;
    }
  }
};
#line 6 "test/verify/aoj-0294.test.cpp"

int main() {
  int N, M, Q;
  cin >> N >> M;
  DominatorTree<> g(N);
  g.read(M, -1, false, true);
  g.build(0);
  cin >> Q;
  while(Q--) {
    int a;
    cin >> a;
    --a;
    if(g[a] == 0) cout << a + 1 << "\n";
    else cout << g[a] + 1 << "\n";
  }
}

Test cases

Env Name Status Elapsed Memory
g++ 00_sample_00.in :heavy_check_mark: AC 6 ms 4 MB
g++ 00_sample_01.in :heavy_check_mark: AC 6 ms 4 MB
g++ 10_linear_n10000_00.in :heavy_check_mark: AC 10 ms 6 MB
g++ 20_comp-n547-e298662_00.in :heavy_check_mark: AC 39 ms 18 MB
g++ 30_lincomp-n10500_00.in :heavy_check_mark: AC 36 ms 13 MB
g++ 40_ladder-n10000_00.in :heavy_check_mark: AC 11 ms 6 MB
g++ 50_random-n100000-e226278_00.in :heavy_check_mark: AC 110 ms 28 MB
clang++ 00_sample_00.in :heavy_check_mark: AC 6 ms 4 MB
clang++ 00_sample_01.in :heavy_check_mark: AC 6 ms 4 MB
clang++ 10_linear_n10000_00.in :heavy_check_mark: AC 11 ms 6 MB
clang++ 20_comp-n547-e298662_00.in :heavy_check_mark: AC 40 ms 18 MB
clang++ 30_lincomp-n10500_00.in :heavy_check_mark: AC 36 ms 14 MB
clang++ 40_ladder-n10000_00.in :heavy_check_mark: AC 12 ms 6 MB
clang++ 50_random-n100000-e226278_00.in :heavy_check_mark: AC 102 ms 30 MB
Back to top page