Tifa's CP Library

:heavy_check_mark: src/test_cpverifier/library-checker/sparse_matrix_det.ss.test.cpp

Depends on

Code

#define AUTO_GENERATED
#define PROBLEM "https://judge.yosupo.jp/problem/sparse_matrix_det"

#include "../../code/lalg/det_rd_mat.hpp"
#include "../../code/lalg/matsp.hpp"
#include "../../code/rand/gen.hpp"

constexpr u32 MOD = 998244353;

#include "../../code/math/mint_ss.hpp"

using mint = tifa_libs::math::mint_ss<MOD>;
using mat = tifa_libs::math::matsp<mint>;

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u64 n, k;
  std::cin >> n >> k;
  mat a(n, n);
  for (u64 i = 0, x, y, z; i < k; ++i) {
    std::cin >> x >> y >> z;
    a(x, y) = z;
  }
  auto is0 = [](mint const &x) { return x.val() == 0; };
  tifa_libs::rand::Gen<std::uniform_int_distribution<u32>> gen(1, mint::mod() - 1);
  std::cout << tifa_libs::math::det_rd(a, gen, is0) << '\n';
  return 0;
}
#line 1 "src/test_cpverifier/library-checker/sparse_matrix_det.ss.test.cpp"
#define AUTO_GENERATED
#define PROBLEM "https://judge.yosupo.jp/problem/sparse_matrix_det"

#line 1 "src/code/lalg/det_rd_mat.hpp"



#line 1 "src/code/lalg/lfsr_bm.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/lalg/lfsr_bm.hpp"

namespace tifa_libs::math {

template <class T, class Is0>
requires requires(Is0 is0, T t) {
  { is0(t) } -> std::same_as<bool>;
}
constexpr vec<T> lfsr_bm(vec<T> const& s, Is0&& is0) {
  vec<T> C{1}, B(C);
  T b(1);
  for (u32 n = 0, n_ed = (u32)s.size(), l = 0, x = 1; n < n_ed; ++n) {
    T d(s[n]);
    for (u32 i = 1; i <= l; ++i) d += C[i] * s[n - i];
    if (is0(d)) ++x;
    else if (l * 2 > n) {
      if (C.size() < B.size() + x) C.resize(B.size() + x);
      T coef = d / b;
      for (u32 i = x, ie = (u32)B.size() + x; i < ie; ++i) C[i] -= coef * B[i - x];
      ++x;
    } else {
      vec<T> t(C);
      if (C.size() < B.size() + x) C.resize(B.size() + x);
      T _ = d / b;
      for (u32 i = x, ie = (u32)B.size() + x; i < ie; ++i) C[i] -= _ * B[i - x];
      l = n + 1 - l;
      B = t;
      b = d;
      x = 1;
    }
  }
  return C;
}

}  // namespace tifa_libs::math


#line 5 "src/code/lalg/det_rd_mat.hpp"

namespace tifa_libs::math {

// OK for matsp
template <class Mat, class Gn, class Is0>
requires requires(Is0 is0, typename Mat::value_type t) {
  { is0(t) } -> std::same_as<bool>;
}
auto det_rd(Mat mat, Gn &gen, Is0 &&is0) {
  using T = typename Mat::value_type;
  u32 n = mat.row();
  assert(n == mat.col());
  auto gen2 = [&gen](u32 n) {
    vec<T> v(n);
    std::ranges::generate(v, gen);
    return v;
  };
  vec<T> u = gen2(n), v = gen2(n), diag = gen2(n), _(n * 2);
  for (u32 i = 0; i < n * 2; ++i) {
    _[i] = std::transform_reduce(u.begin(), u.end(), v.begin(), T{});
    for (u32 i = 0; i < n; ++i) v[i] *= diag[i];
    v = mat.lproj(v);
  }
  vec<T> mp = lfsr_bm(_, std::forward<Is0>(is0));
  T res = mp.back() / std::reduce(diag.begin(), diag.end(), T(1), std::multiplies<T>());
  return (n & 1) == 1 ? -res : res;
}

}  // namespace tifa_libs::math


#line 1 "src/code/lalg/matsp.hpp"



#line 5 "src/code/lalg/matsp.hpp"

namespace tifa_libs::math {

template <class T>
class matsp {
  using node = std::pair<u32, T>;
  using data_t = vvec<node>;

  u32 r, c;
  data_t d;

 public:
  using value_type = T;

  constexpr matsp(u32 row, u32 col) : r(row), c(col), d(r) { assert(row > 0 && col > 0); }

  constexpr u32 const &row() const { return r; }
  constexpr u32 const &col() const { return c; }
  constexpr data_t const &data() const { return d; }
  constexpr data_t &data() { return d; }
  constexpr T &operator()(u32 r, u32 c) {
    for (auto &[c_, v] : d[r])
      if (c == c_) return v;
    d[r].emplace_back(c, T{});
    return d[r].back().second;
  }
  constexpr T const &operator()(u32 r, u32 c) const {
    for (auto &[c_, v] : d[r])
      if (c == c_) return v;
    return T{};
  }

  constexpr void shrink_row(u32 r) {
    d[r].erase(std::remove_if(d[r].begin(), d[r].end(), [](node const &x) { return x.second == T{}; }), d[r].end());
  }
  constexpr void sort_row(u32 r) { std::ranges::sort(d[r]); }

  template <class F>
  constexpr void apply(F f) {
    for (u32 i = 0; i < r; ++i)
      for (auto &[j, v] : d[i]) f(i, j, v);
  }
  template <class F>
  friend constexpr matsp merge(matsp l, matsp r, F f) {
    u32 r_ = l.row(), c_ = l.col();
    assert(r_ == r.row() && c_ == r.col());
    matsp ret(r_, c_);
    for (u32 i = 0; i < r_; ++i) {
      if (i >= r_ || (i < r_ && l[i].empty())) {
        if (!r[i].empty()) ret[i] = r[i];
        continue;
      }
      if (i >= r_ || (i < r_ && r[i].empty())) {
        if (!l[i].empty()) ret[i] = l[i];
        continue;
      }
      l.sort_row(i);
      r.sort_row(i);
      auto f1 = l.begin(), l1 = l.end(), f2 = r.begin(), l2 = r.end(), d = ret.d[i].begin();
      for (; f1 != l1; ++d) {
        if (f2 == l2) std::copy(f1, l1, d);
        if (*f2 < *f1) {
          *d = *f2;
          ++f2;
        } else if (*f1 < *f2) {
          *d = *f1;
          ++f1;
        } else {
          u32 j = u32(f1 - l.begin());
          *d = f(i, j, *f1, *f2);
          ++f1;
          ++f2;
        }
      }
      std::copy(f2, l2, d);
    }
    return ret;
  }

  constexpr matsp operator-() const {
    matsp ret = *this;
    ret.apply([](u32, u32, T &v) { v = -v; });
    return ret;
  }

  friend constexpr matsp operator+(matsp l, T const &v) { return l += v; }
  friend constexpr matsp operator+(T const &v, matsp l) { return l += v; }
  constexpr matsp &operator+=(T const &v) {
    apply([&v](u32, u32, T &val) { val += v; });
    return *this;
  }
  friend constexpr matsp operator-(matsp l, T const &v) { return l -= v; }
  friend constexpr matsp operator-(T const &v, matsp l) { return l -= v; }
  constexpr matsp &operator-=(T const &v) {
    apply([&v](u32, u32, T &val) { val -= v; });
    return *this;
  }
  friend constexpr matsp operator*(matsp l, T const &v) { return l *= v; }
  friend constexpr matsp operator*(T const &v, matsp l) { return l *= v; }
  constexpr matsp &operator*=(T const &v) {
    apply([&v](u32, u32, T &val) { val *= v; });
    return *this;
  }

  friend constexpr matsp operator+(matsp const &l, matsp const &r) {
    return merge(l, r, [](u32, u32, T const &lv, T const &rv) { return lv + rv; });
  }
  constexpr matsp &operator+=(matsp const &r) { return *this = *this + r; }
  friend constexpr matsp operator-(matsp l, matsp const &r) { return l + (-r); }
  constexpr matsp &operator-=(matsp const &r) { return *this = *this - r; }
  friend constexpr matsp operator*(matsp l, matsp const &r) {
    u32 i_ = l.row(), j_ = l.col(), k_ = r.col();
    assert(j_ == r.row());
    matsp ret(i_, k_);
    for (u32 i = 0; i < i_; ++i) {
      if (l.d[i].empty()) continue;
      for (u32 j = 0; j < j_; ++j) {
        if (r.d[j].empty()) continue;
        for (u32 k = 0; k < k_; ++k) ret(i, k) += l(i, j) * r(j, k);
      }
      ret.shrink_row(i);
    }
    return ret;
  }
  constexpr matsp &operator*=(matsp const &r) { return *this = *this - r; }

  constexpr vec<T> lproj(vec<T> const &x) const {
    u32 r_ = row(), c_ = col();
    assert(r_ == x.size());
    vec<T> ret(c_);
    for (u32 i = 0; i < c_; ++i)
      for (auto &&[pos, v] : d[i]) ret[i] += x[pos] * v;
    return ret;
  }
};

}  // namespace tifa_libs::math


#line 1 "src/code/rand/gen.hpp"



#line 5 "src/code/rand/gen.hpp"

namespace tifa_libs::rand {

template <class Distri>
class Gen {
  std::conditional_t<sizeof(typename Distri::result_type) <= 4, std::mt19937, std::mt19937_64> re;
  Distri dist;

 public:
  using random_engine = decltype(re);
  using distribution = Distri;
  using result_type = typename Distri::result_type;

  constexpr Gen() : re(std::random_device{}()), dist() {}
  constexpr Gen(result_type a, result_type b) : re(std::random_device{}()), dist(a, b) {}

  constexpr void set_range(result_type a, result_type b) { dist = Distri(a, b); }
  constexpr random_engine& rand_eng() { return re; }
  constexpr Distri& distrib() { return dist; }

  void reset_seed() { re.seed((result_type)std::chrono::duration_cast<std::conditional_t<sizeof(typename Distri::result_type) <= 4, std::chrono::seconds, std::chrono::nanoseconds>>(std::chrono::high_resolution_clock::now().time_since_epoch()).count()); }
  constexpr result_type operator()() { return dist(re); }
  result_type next() { return dist(re); }
};

}  // namespace tifa_libs::rand


#line 7 "src/test_cpverifier/library-checker/sparse_matrix_det.ss.test.cpp"

constexpr u32 MOD = 998244353;

#line 1 "src/code/math/mint_ss.hpp"



#line 1 "src/code/math/mint.hpp"



#line 1 "src/code/nt/inverse.hpp"



#line 1 "src/code/nt/inv_gcd.hpp"



#line 1 "src/code/math/safe_mod.hpp"



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



#line 5 "src/code/util/traits.hpp"

namespace tifa_libs {

template <class T>
concept iterable_c = requires(T v) {
  { v.begin() } -> std::same_as<typename T::iterator>;
  { v.end() } -> std::same_as<typename T::iterator>;
};

template <class T>
concept container_c = iterable_c<T> && !std::derived_from<T, std::basic_string<typename T::value_type>>;

template <class T>
constexpr bool is_char_v = std::is_same_v<T, char> || std::is_same_v<T, signed char> || std::is_same_v<T, unsigned char>;
template <class T>
concept char_c = is_char_v<T>;

template <class T>
constexpr bool is_s128_v = std::is_same_v<T, __int128_t> || std::is_same_v<T, __int128>;
template <class T>
concept s128_c = is_s128_v<T>;

template <class T>
constexpr bool is_u128_v = std::is_same_v<T, __uint128_t> || std::is_same_v<T, unsigned __int128>;
template <class T>
concept u128_c = is_u128_v<T>;

template <class T>
constexpr bool is_i128_v = is_s128_v<T> || is_u128_v<T>;
template <class T>
concept i128_c = is_u128_v<T>;

template <class T>
constexpr bool is_int_v = std::is_integral_v<T> || is_i128_v<T>;
template <class T>
concept int_c = is_int_v<T>;

template <class T>
constexpr bool is_sint_v = is_s128_v<T> || (is_int_v<T> && std::is_signed_v<T>);
template <class T>
concept sint_c = is_sint_v<T>;

template <class T>
constexpr bool is_uint_v = is_u128_v<T> || (is_int_v<T> && std::is_unsigned_v<T>);
template <class T>
concept uint_c = is_uint_v<T>;

template <class T>
concept mint_c = requires(T x) {
  { x.mod() } -> uint_c;
  { x.val() } -> uint_c;
};

template <class T>
constexpr bool is_arithm_v = std::is_arithmetic_v<T> || is_int_v<T>;
template <class T>
concept arithm_c = is_arithm_v<T>;

template <class T>
struct to_sint : std::make_signed<T> {};
template <>
struct to_sint<u128> {
  using type = u128;
};
template <>
struct to_sint<i128> {
  using type = u128;
};
template <class T>
using to_sint_t = typename to_sint<T>::type;

template <class T>
struct to_uint : std::make_unsigned<T> {};
template <>
struct to_uint<u128> {
  using type = u128;
};
template <>
struct to_uint<i128> {
  using type = u128;
};
template <class T>
using to_uint_t = typename to_uint<T>::type;

}  // namespace tifa_libs


#line 5 "src/code/math/safe_mod.hpp"

namespace tifa_libs::math {

template <sint_c T>
constexpr T safe_mod(T x, to_uint_t<T> mod) { return ((x %= (T)mod) < 0 ? x + (T)mod : x); }

}  // namespace tifa_libs::math


#line 1 "src/code/nt/exgcd.hpp"



#line 5 "src/code/nt/exgcd.hpp"

namespace tifa_libs::math {

// Binary exgcd
template <uint_c U, bool only_x = false>
constexpr auto exgcd_b(U a, U b) {
  using T = to_sint_t<U>;
  if constexpr (only_x) {
    if (!a) return std::make_tuple(b, (T)0);
    if (!b) return std::make_tuple(a, (T)1);
  } else {
    if (!a) return std::make_tuple(b, (T)0, (T) !!b);
    if (!b) return std::make_tuple(a, (T)1, (T)0);
  }
  auto r = std::__countr_zero(a | b);
  a >>= r, b >>= r;
  T x = (T)a, y = (T)b;
  T s = 1, t = 0, u = 0, v = 1;
  while (x) {
    while (!(x & 1)) {
      x /= 2;
      if (!((s | t) & 1)) s /= 2, t /= 2;
      else s = (s + (T)b) / 2, t = (t - (T)a) / 2;
    }
    while (!(y & 1)) {
      y /= 2;
      if (!((u | v) & 1)) u /= 2, v /= 2;
      else u = (u + (T)b) / 2, v = (v - (T)a) / 2;
    }
    if (x >= y) x -= y, s -= u, t -= v;
    else y -= x, u -= s, v -= t;
  }
  if (y > 1) a /= (U)y, b /= (U)y;
  if (a && (U)abs(v) >= a) {
    T _ = v / (T)a;
    v -= _ * (T)a, u += _ * (T)b;
  }
  if (b && (U)abs(u) >= b) {
    T _ = u / (T)b;
    u -= _ * (T)b, v += _ * (T)a;
  }
  if (T u_ = u + (T)b, v_ = v - (T)a; abs(u_) + abs(v_) <= abs(u) + abs(v)) u = u_, v = v_;
  if (T u_ = u - (T)b, v_ = v + (T)a; abs(u_) + abs(v_) <= abs(u) + abs(v)) u = u_, v = v_;
  if constexpr (only_x) return std::make_tuple(U(y << r), u);
  else return std::make_tuple(U(y << r), u, v);
}
// @return then return tuple(g, x[, y]) s.t. g = gcd(a, b), xa + yb = g, |x| + |y| is the minimal (primary) and x <= y (secondarily)
template <sint_c T, bool only_x = false>
constexpr auto exgcd(T a, T b) {
  using U = to_uint_t<T>;
  if (auto [x, y] = std::minmax(a, b); x >= 0 && y <= T(U(-1) >> sizeof(U))) return exgcd_b<U, only_x>((U)a, (U)b);
  if constexpr (only_x) {
    T s = 1, u = 0;
    while (b) {
      T c = a / b;
      std::tie(s, u, a, b) = std::make_tuple(u, s - u * c, b, a - b * c);
    }
    return std::make_tuple((U)a, s);
  } else {
    T s = 1, t = 0, u = 0, v = 1;
    while (b) {
      T c = a / b;
      std::tie(s, t, u, v, a, b) = std::make_tuple(u, v, s - u * c, t - v * c, b, a - b * c);
    }
    return std::make_tuple((U)a, s, t);
  }
}

}  // namespace tifa_libs::math


#line 6 "src/code/nt/inv_gcd.hpp"

namespace tifa_libs::math {

template <uint_c T>
constexpr ptt<T> inv_gcd(T n, T mod) {
  using U = to_sint_t<T>;
  auto [g, x] = exgcd<U, true>(U(n % mod), (U)mod);
  return {g, safe_mod(x, mod)};
}

}  // namespace tifa_libs::math


#line 5 "src/code/nt/inverse.hpp"

namespace tifa_libs::math {

template <uint_c T, uint_c U>
constexpr U inverse(T n, U mod) {
  auto [g, x] = inv_gcd(U(n % mod), mod);
  assert(g == 1);
  return x;
}

}  // namespace tifa_libs::math


#line 6 "src/code/math/mint.hpp"

namespace tifa_libs::math {

template <class D, uint_c Rt>
class mint {
  constexpr D const &d() const { return static_cast<D const &>(*this); }
  constexpr D &d() { return static_cast<D &>(*this); }

 protected:
  Rt v_{};

 public:
  constexpr mint() {}
  template <int_c T>
  constexpr mint(T v) : v_(D::mod_(v)) {}
  constexpr operator D() { return d(); }

  using raw_type = Rt;
  using sraw_type = to_sint_t<Rt>;
  static constexpr raw_type mod() { return D::mod_(); }
  static constexpr sraw_type smod() { return (sraw_type)D::mod_(); }
  constexpr raw_type val() const { return d().val_(); }
  constexpr sraw_type sval() const { return (sraw_type)d().val_(); }
  constexpr raw_type &data() { return d().data_(); }

  template <int_c T>
  explicit constexpr operator T() const { return (T)val(); }
  constexpr mint &operator+=(mint const &r) { return d().adde_(r.d()); }
  constexpr mint &operator-=(mint const &r) { return d().sube_(r.d()); }
  constexpr mint &operator*=(mint const &r) { return d().mule_(r.d()); }
  constexpr mint &operator/=(mint const &r) { return *this = *this * r.inv(); }
  constexpr mint const &operator+() const { return *this; }
  constexpr mint operator-() const { return d().neg_(); }
  constexpr mint inv() const { return inverse(val(), mod()); }
  friend constexpr mint operator+(mint l, mint const &r) { return l += r; }
  friend constexpr mint operator-(mint l, mint const &r) { return l -= r; }
  friend constexpr mint operator*(mint l, mint const &r) { return l *= r; }
  friend constexpr mint operator/(mint l, mint const &r) { return l /= r; }
  friend constexpr bool operator==(mint const &l, mint const &r) { return l.val() == r.val(); }
  friend constexpr auto operator<=>(mint const &l, mint const &r) { return l.sval() - r.sval(); }
  friend std::istream &operator>>(std::istream &is, mint &x) {
    i64 _;
    is >> _;
    x = mint(_);
    return is;
  }
  friend std::ostream &operator<<(std::ostream &os, mint const &x) { return os << x.val(); }
  friend constexpr mint abs(mint const &x) { return x.val(); }
};

}  // namespace tifa_libs::math


#line 5 "src/code/math/mint_ss.hpp"

namespace tifa_libs::math {

template <u32 MOD>
class mint_ss : public mint<mint_ss<MOD>, u32> {
  using base = mint<mint_ss<MOD>, u32>;
  friend base;
  static_assert(MOD >= 1);

 public:
  static constexpr bool FIXED_MOD = true;
  constexpr mint_ss() {}
  template <int_c T>
  constexpr mint_ss(T v) { this->v_ = mod_(v); }

 private:
  using raw_t = typename base::raw_type;
  using sraw_t = typename base::sraw_type;
  template <sint_c T>
  static constexpr raw_t mod_(T v) {
    i64 x = i64(v % (i64)mod_());
    return raw_t(x + (x < 0 ? mod_() : 0));
  }
  template <uint_c T>
  static constexpr raw_t mod_(T v) { return raw_t(v % mod_()); }
  static constexpr raw_t mod_() { return MOD; }
  constexpr raw_t val_() const { return this->v_; }
  constexpr raw_t &data_() { return this->v_; }

  constexpr mint_ss neg_() const { return -(sraw_t)val_(); }
  constexpr mint_ss &adde_(mint_ss const &r) {
    data_() += r.val_();
    if (val_() >= mod_()) data_() -= mod_();
    return *this;
  }
  constexpr mint_ss &sube_(mint_ss const &r) {
    data_() -= r.val_();
    if (val_() >= mod_()) data_() += mod_();
    return *this;
  }
  constexpr mint_ss &mule_(mint_ss const &r) {
    data_() = u32((u64)val_() * r.val_() % mod_());
    return *this;
  }
};

}  // namespace tifa_libs::math


#line 11 "src/test_cpverifier/library-checker/sparse_matrix_det.ss.test.cpp"

using mint = tifa_libs::math::mint_ss<MOD>;
using mat = tifa_libs::math::matsp<mint>;

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u64 n, k;
  std::cin >> n >> k;
  mat a(n, n);
  for (u64 i = 0, x, y, z; i < k; ++i) {
    std::cin >> x >> y >> z;
    a(x, y) = z;
  }
  auto is0 = [](mint const &x) { return x.val() == 0; };
  tifa_libs::rand::Gen<std::uniform_int_distribution<u32>> gen(1, mint::mod() - 1);
  std::cout << tifa_libs::math::det_rd(a, gen, is0) << '\n';
  return 0;
}

Test cases

Env Name Status Elapsed Memory
g++-12 example_00 :heavy_check_mark: AC 8 ms 4 MB
g++-12 example_01 :heavy_check_mark: AC 7 ms 4 MB
g++-12 hack2_00 :heavy_check_mark: AC 221 ms 4 MB
g++-12 hack_00 :heavy_check_mark: AC 8 ms 4 MB
g++-12 max_random_00 :heavy_check_mark: AC 211 ms 4 MB
g++-12 max_random_01 :heavy_check_mark: AC 213 ms 4 MB
g++-12 max_random_02 :heavy_check_mark: AC 205 ms 4 MB
g++-12 max_random_03 :heavy_check_mark: AC 214 ms 4 MB
g++-12 max_random_04 :heavy_check_mark: AC 198 ms 4 MB
g++-12 perm_max_random_00 :heavy_check_mark: AC 121 ms 4 MB
g++-12 perm_max_random_01 :heavy_check_mark: AC 123 ms 4 MB
g++-12 perm_max_random_02 :heavy_check_mark: AC 114 ms 4 MB
g++-12 perm_max_random_03 :heavy_check_mark: AC 122 ms 4 MB
g++-12 perm_max_random_04 :heavy_check_mark: AC 110 ms 4 MB
g++-12 perm_plus_random_00 :heavy_check_mark: AC 214 ms 4 MB
g++-12 perm_plus_random_01 :heavy_check_mark: AC 214 ms 4 MB
g++-12 perm_plus_random_02 :heavy_check_mark: AC 206 ms 4 MB
g++-12 perm_plus_random_03 :heavy_check_mark: AC 215 ms 4 MB
g++-12 perm_plus_random_04 :heavy_check_mark: AC 199 ms 4 MB
g++-12 random_00 :heavy_check_mark: AC 15 ms 4 MB
g++-12 random_01 :heavy_check_mark: AC 12 ms 4 MB
g++-12 random_02 :heavy_check_mark: AC 11 ms 4 MB
g++-12 random_03 :heavy_check_mark: AC 57 ms 4 MB
g++-12 random_04 :heavy_check_mark: AC 55 ms 4 MB
Back to top page