Tifa's CP Library

:heavy_check_mark: src/test_cpverifier/aizu/grl_4_a.test.cpp

Depends on

Code

#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/all/GRL_4_A"

#include "../../code/graph/topo_sort.hpp"

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 n, m;
  std::cin >> n >> m;
  tifa_libs::graph::alist g(n);
  for (u32 i = 0, u, v; i < m; ++i) {
    std::cin >> u >> v;
    g.add_arc(u, v);
  }
  std::cout << tifa_libs::graph::topo_sort(g).empty() << '\n';
  return 0;
}
#line 1 "src/test_cpverifier/aizu/grl_4_a.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/all/GRL_4_A"

#line 1 "src/code/graph/topo_sort.hpp"



#line 1 "src/code/graph/alist.hpp"



#line 1 "src/code/util/util.hpp"



#include <bits/stdc++.h>

template <class T>
constexpr T abs(T x) { return x < 0 ? -x : x; }

using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using i128 = __int128_t;
using isz = ptrdiff_t;

using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using u128 = __uint128_t;
using usz = size_t;

using f32 = float;
using f64 = double;
using f128 = long double;

template <class T>
using ptt = std::pair<T, T>;
template <class T>
using pt3 = std::tuple<T, T, T>;
template <class T>
using pt4 = std::tuple<T, T, T, T>;

template <class T, usz N>
using arr = std::array<T, N>;
template <class T>
using vec = std::vector<T>;
template <class T>
using vvec = vec<vec<T>>;
template <class T>
using v3ec = vec<vvec<T>>;
template <class U, class T>
using vecp = vec<std::pair<U, T>>;
template <class U, class T>
using vvecp = vvec<std::pair<U, T>>;
template <class T>
using vecpt = vec<ptt<T>>;
template <class T>
using vvecpt = vvec<ptt<T>>;

template <class T, class C = std::less<T>>
using pq = std::priority_queue<T, vec<T>, C>;
template <class T>
using pqg = std::priority_queue<T, vec<T>, std::greater<T>>;

using strn = std::string;
using strnv = std::string_view;

using vecu = vec<u32>;
using vvecu = vvec<u32>;
using v3ecu = v3ec<u32>;
using vecu64 = vec<u64>;
using vecb = vec<bool>;
using vvecb = vvec<bool>;

#ifdef ONLINE_JUDGE
#undef assert
#define assert(x) 42
#endif

using namespace std::literals;

constexpr i8 operator""_i8(unsigned long long x) { return (i8)x; }
constexpr i16 operator""_i16(unsigned long long x) { return (i16)x; }
constexpr i32 operator""_i32(unsigned long long x) { return (i32)x; }
constexpr i64 operator""_i64(unsigned long long x) { return (i64)x; }
constexpr isz operator""_iz(unsigned long long x) { return (isz)x; }

constexpr u8 operator""_u8(unsigned long long x) { return (u8)x; }
constexpr u16 operator""_u16(unsigned long long x) { return (u16)x; }
constexpr u32 operator""_u32(unsigned long long x) { return (u32)x; }
constexpr u64 operator""_u64(unsigned long long x) { return (u64)x; }
constexpr usz operator""_uz(unsigned long long x) { return (usz)x; }

inline const auto fn_0 = [](auto&&...) {};


#line 5 "src/code/graph/alist.hpp"

namespace tifa_libs::graph {

template <bool with_deg = false>
struct alist {
  using weight_type = u32;
  using value_type = vvecu;
  value_type g;
  u32 cnt_arc;
  vecu deg_in;

  //! vertex ID: [0, n)
  explicit constexpr alist(u32 n = 0) : g(n), cnt_arc(0), deg_in(0) {
    if constexpr (with_deg) deg_in.resize(n);
  }

  constexpr void add_arc(u32 u, u32 v) {
    g[u].push_back(v), ++cnt_arc;
    if constexpr (with_deg) ++deg_in[v];
  }
};
template <class G>
concept is_alist = (std::is_base_of_v<alist<true>, G> || std::is_base_of_v<alist<false>, G>);

}  // namespace tifa_libs::graph


#line 5 "src/code/graph/topo_sort.hpp"

namespace tifa_libs::graph {

//! return empty vector if @fg is not DAG
template <bool with_deg>
constexpr vecu topo_sort(alist<with_deg> const& fg) {
  u32 n = (u32)fg.g.size();
  vecb vis(n), _(n);
  vecu ans;
  auto dfs = [&](auto&& dfs, u32 i) -> bool {
    if (_[i]) return false;
    if (!vis[i]) {
      _[i] = true;
      for (u32 to : fg.g[i])
        if (!dfs(dfs, to)) return false;
      vis[i] = true;
      ans.push_back(i);
      _[i] = false;
    }
    return true;
  };
  for (u32 i = 0; i < n; ++i)
    if (!vis[i] && !dfs(dfs, i)) return {};
  std::ranges::reverse(ans);
  return ans;
}

}  // namespace tifa_libs::graph


#line 4 "src/test_cpverifier/aizu/grl_4_a.test.cpp"

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 n, m;
  std::cin >> n >> m;
  tifa_libs::graph::alist g(n);
  for (u32 i = 0, u, v; i < m; ++i) {
    std::cin >> u >> v;
    g.add_arc(u, v);
  }
  std::cout << tifa_libs::graph::topo_sort(g).empty() << '\n';
  return 0;
}

Test cases

Env Name Status Elapsed Memory
g++-12 00_small_00.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 00_small_01.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 00_small_02.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 00_small_03.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 01_medium_00.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 01_medium_01.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 01_medium_02.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 01_medium_03.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 02_components_00.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 02_components_01.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 02_components_02.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 02_components_03.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 03_grid_00.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 03_grid_01.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 03_grid_02.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 03_grid_03.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 04_linear_00.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 04_linear_01.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 04_linear_02.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 04_linear_03.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 05_large_00.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 05_large_01.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 05_large_02.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 05_large_03.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 06_critical_00.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 06_critical_01.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 06_critical_02.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 06_critical_03.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 07_rand_00.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 07_rand_01.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 07_rand_02.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 07_rand_03.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 07_rand_04.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 07_rand_05.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 07_rand_06.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 07_rand_07.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 08_dag_00.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 08_dag_01.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 08_dag_02.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 08_dag_03.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 09_maximum_00.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 09_maximum_01.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 09_maximum_02.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 09_maximum_03.in :heavy_check_mark: AC 8 ms 4 MB
Back to top page