Hashiryo's Library

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub hashiryo/Library

:heavy_check_mark: test/yosupo/sparse_matrix_det.test.cpp

Depends on

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/sparse_matrix_det
// competitive-verifier: TLE 1
// competitive-verifier: MLE 64
#include <iostream>
#include "src/Math/ModInt.hpp"
#include "src/LinearAlgebra/MinimalPolynomial.hpp"
using namespace std;
signed main() {
 cin.tie(0);
 ios::sync_with_stdio(false);
 using Mint= ModInt<998244353>;
 using Vec= Vector<Mint>;
 int N, K;
 cin >> N >> K;
 int a[K], b[K], c[K];
 for (int i= 0; i < K; i++) cin >> a[i] >> b[i] >> c[i];
 auto f= [&](const Vec& v) {
  Vec ret(N);
  for (int i= 0; i < K; i++) ret[a[i]]+= v[b[i]] * c[i];
  return ret;
 };
 cout << linear_map_det<Mint>(f, N) << '\n';
 return 0;
}
#line 1 "test/yosupo/sparse_matrix_det.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/sparse_matrix_det
// competitive-verifier: TLE 1
// competitive-verifier: MLE 64
#include <iostream>
#line 2 "src/Math/mod_inv.hpp"
#include <utility>
#include <type_traits>
#include <cassert>
template <class Uint> constexpr inline Uint mod_inv(Uint a, Uint mod) {
 std::make_signed_t<Uint> x= 1, y= 0, z= 0;
 for (Uint q= 0, b= mod, c= 0; b;) z= x, x= y, y= z - y * (q= a / b), c= a, a= b, b= c - b * q;
 return assert(a == 1), x < 0 ? mod - (-x) % mod : x % mod;
}
#line 2 "src/Internal/Remainder.hpp"
namespace math_internal {
using namespace std;
using u8= unsigned char;
using u32= unsigned;
using i64= long long;
using u64= unsigned long long;
using u128= __uint128_t;
struct MP_Na {  // mod < 2^32
 u32 mod;
 constexpr MP_Na(): mod(0) {}
 constexpr MP_Na(u32 m): mod(m) {}
 constexpr inline u32 mul(u32 l, u32 r) const { return u64(l) * r % mod; }
 constexpr inline u32 set(u32 n) const { return n; }
 constexpr inline u32 get(u32 n) const { return n; }
 constexpr inline u32 norm(u32 n) const { return n; }
 constexpr inline u32 plus(u64 l, u32 r) const { return l+= r, l < mod ? l : l - mod; }
 constexpr inline u32 diff(u64 l, u32 r) const { return l-= r, l >> 63 ? l + mod : l; }
};
template <class u_t, class du_t, u8 B> struct MP_Mo {  // mod < 2^32, mod < 2^62
 u_t mod;
 constexpr MP_Mo(): mod(0), iv(0), r2(0) {}
 constexpr MP_Mo(u_t m): mod(m), iv(inv(m)), r2(-du_t(mod) % mod) {}
 constexpr inline u_t mul(u_t l, u_t r) const { return reduce(du_t(l) * r); }
 constexpr inline u_t set(u_t n) const { return mul(n, r2); }
 constexpr inline u_t get(u_t n) const { return n= reduce(n), n >= mod ? n - mod : n; }
 constexpr inline u_t norm(u_t n) const { return n >= mod ? n - mod : n; }
 constexpr inline u_t plus(u_t l, u_t r) const { return l+= r, l < (mod << 1) ? l : l - (mod << 1); }
 constexpr inline u_t diff(u_t l, u_t r) const { return l-= r, l >> (B - 1) ? l + (mod << 1) : l; }
private:
 u_t iv, r2;
 static constexpr u_t inv(u_t n, int e= 6, u_t x= 1) { return e ? inv(n, e - 1, x * (2 - x * n)) : x; }
 constexpr inline u_t reduce(const du_t &w) const { return u_t(w >> B) + mod - ((du_t(u_t(w) * iv) * mod) >> B); }
};
using MP_Mo32= MP_Mo<u32, u64, 32>;
using MP_Mo64= MP_Mo<u64, u128, 64>;
struct MP_Br {  // 2^20 < mod <= 2^41
 u64 mod;
 constexpr MP_Br(): mod(0), x(0) {}
 constexpr MP_Br(u64 m): mod(m), x((u128(1) << 84) / m) {}
 constexpr inline u64 mul(u64 l, u64 r) const { return rem(u128(l) * r); }
 static constexpr inline u64 set(u64 n) { return n; }
 constexpr inline u64 get(u64 n) const { return n >= mod ? n - mod : n; }
 constexpr inline u64 norm(u64 n) const { return n >= mod ? n - mod : n; }
 constexpr inline u64 plus(u64 l, u64 r) const { return l+= r, l < (mod << 1) ? l : l - (mod << 1); }
 constexpr inline u64 diff(u64 l, u64 r) const { return l-= r, l >> 63 ? l + (mod << 1) : l; }
private:
 u64 x;
 constexpr inline u128 quo(const u128 &n) const { return (n * x) >> 84; }
 constexpr inline u64 rem(const u128 &n) const { return n - quo(n) * mod; }
};
template <class du_t, u8 B> struct MP_D2B1 {  // mod < 2^63, mod < 2^64
 u64 mod;
 constexpr MP_D2B1(): mod(0), s(0), d(0), v(0) {}
 constexpr MP_D2B1(u64 m): mod(m), s(__builtin_clzll(m)), d(m << s), v(u128(-1) / d) {}
 constexpr inline u64 mul(u64 l, u64 r) const { return rem((u128(l) * r) << s) >> s; }
 constexpr inline u64 set(u64 n) const { return n; }
 constexpr inline u64 get(u64 n) const { return n; }
 constexpr inline u64 norm(u64 n) const { return n; }
 constexpr inline u64 plus(du_t l, u64 r) const { return l+= r, l < mod ? l : l - mod; }
 constexpr inline u64 diff(du_t l, u64 r) const { return l-= r, l >> B ? l + mod : l; }
private:
 u8 s;
 u64 d, v;
 constexpr inline u64 rem(const u128 &u) const {
  u128 q= (u >> 64) * v + u;
  u64 r= u64(u) - (q >> 64) * d - d;
  if (r > u64(q)) r+= d;
  if (r >= d) r-= d;
  return r;
 }
};
using MP_D2B1_1= MP_D2B1<u64, 63>;
using MP_D2B1_2= MP_D2B1<u128, 127>;
template <class u_t, class MP> constexpr u_t pow(u_t x, u64 k, const MP &md) {
 for (u_t ret= md.set(1);; x= md.mul(x, x))
  if (k & 1 ? ret= md.mul(ret, x) : 0; !(k>>= 1)) return ret;
}
}
#line 3 "src/Internal/modint_traits.hpp"
namespace math_internal {
struct m_b {};
struct s_b: m_b {};
}
template <class mod_t> constexpr bool is_modint_v= std::is_base_of_v<math_internal::m_b, mod_t>;
template <class mod_t> constexpr bool is_staticmodint_v= std::is_base_of_v<math_internal::s_b, mod_t>;
#line 6 "src/Math/ModInt.hpp"
namespace math_internal {
template <class MP, u64 MOD> struct SB: s_b {
protected:
 static constexpr MP md= MP(MOD);
};
template <class U, class B> struct MInt: public B {
 using Uint= U;
 static constexpr inline auto mod() { return B::md.mod; }
 constexpr MInt(): x(0) {}
 template <class T, typename= enable_if_t<is_modint_v<T> && !is_same_v<T, MInt>>> constexpr MInt(T v): x(B::md.set(v.val() % B::md.mod)) {}
 constexpr MInt(__int128_t n): x(B::md.set((n < 0 ? ((n= (-n) % B::md.mod) ? B::md.mod - n : n) : n % B::md.mod))) {}
 constexpr MInt operator-() const { return MInt() - *this; }
#define FUNC(name, op) \
 constexpr MInt name const { \
  MInt ret; \
  return ret.x= op, ret; \
 }
 FUNC(operator+(const MInt & r), B::md.plus(x, r.x))
 FUNC(operator-(const MInt & r), B::md.diff(x, r.x))
 FUNC(operator*(const MInt & r), B::md.mul(x, r.x))
 FUNC(pow(u64 k), math_internal::pow(x, k, B::md))
#undef FUNC
 constexpr MInt operator/(const MInt &r) const { return *this * r.inv(); }
 constexpr MInt &operator+=(const MInt &r) { return *this= *this + r; }
 constexpr MInt &operator-=(const MInt &r) { return *this= *this - r; }
 constexpr MInt &operator*=(const MInt &r) { return *this= *this * r; }
 constexpr MInt &operator/=(const MInt &r) { return *this= *this / r; }
 constexpr bool operator==(const MInt &r) const { return B::md.norm(x) == B::md.norm(r.x); }
 constexpr bool operator!=(const MInt &r) const { return !(*this == r); }
 constexpr bool operator<(const MInt &r) const { return B::md.norm(x) < B::md.norm(r.x); }
 constexpr inline MInt inv() const { return mod_inv<U>(val(), B::md.mod); }
 constexpr inline Uint val() const { return B::md.get(x); }
 friend ostream &operator<<(ostream &os, const MInt &r) { return os << r.val(); }
 friend istream &operator>>(istream &is, MInt &r) {
  i64 v;
  return is >> v, r= MInt(v), is;
 }
private:
 Uint x;
};
template <u64 MOD> using MP_B= conditional_t < (MOD < (1 << 30)) & MOD, MP_Mo32, conditional_t < MOD < (1ull << 32), MP_Na, conditional_t<(MOD < (1ull << 62)) & MOD, MP_Mo64, conditional_t<MOD<(1ull << 41), MP_Br, conditional_t<MOD<(1ull << 63), MP_D2B1_1, MP_D2B1_2>>>>>;
template <u64 MOD> using ModInt= MInt < conditional_t<MOD<(1 << 30), u32, u64>, SB<MP_B<MOD>, MOD>>;
}
using math_internal::ModInt;
#line 2 "src/Math/berlekamp_massey.hpp"
#include <vector>
// a[n] = c[0] * a[n-1] + c[1] * a[n-2] + ... + c[d-1] * a[n-d]
// return c
template <class K> std::vector<K> berlekamp_massey(const std::vector<K> &a) {
 size_t n= a.size(), d= 0, m= 0, i, j;
 if (n == 0) return {};
 std::vector<K> c(n), b(n), tmp;
 K x= 1, y, coef;
 for (c[0]= b[0]= 1, i= 0; i < n; ++i) {
  for (++m, y= a[i], j= 1; j <= d; ++j) y+= c[j] * a[i - j];
  if (y == K()) continue;
  for (tmp= c, coef= y / x, j= m; j < n; ++j) c[j]-= coef * b[j - m];
  if (2 * d <= i) d= i + 1 - d, b= tmp, x= y, m= 0;
 }
 c.resize(d + 1), c.erase(c.begin());
 for (auto &x: c) x= -x;
 return c;
}
#line 2 "src/LinearAlgebra/Vector.hpp"
#include <cstdint>
#line 4 "src/LinearAlgebra/Vector.hpp"
#include <valarray>
namespace _la_internal {
using namespace std;
template <class R> struct Vector {
 valarray<R> dat;
 Vector()= default;
 Vector(size_t n): dat(n) {}
 Vector(size_t n, const R &v): dat(v, n) {}
 Vector(const initializer_list<R> &v): dat(v) {}
 R &operator[](int i) { return dat[i]; }
 const R &operator[](int i) const { return dat[i]; }
 bool operator==(const Vector &r) const {
  if (dat.size() != r.dat.size()) return false;
  for (int i= dat.size(); i--;)
   if (dat[i] != r.dat[i]) return false;
  return true;
 }
 bool operator!=(const Vector &r) const { return !(*this == r); }
 explicit operator bool() const { return dat.size(); }
 Vector operator-() const { return Vector(dat.size())-= *this; }
 Vector &operator+=(const Vector &r) { return dat+= r.dat, *this; }
 Vector &operator-=(const Vector &r) { return dat-= r.dat, *this; }
 Vector &operator*=(const R &r) { return dat*= r, *this; }
 Vector operator+(const Vector &r) const { return Vector(*this)+= r; }
 Vector operator-(const Vector &r) const { return Vector(*this)-= r; }
 Vector operator*(const R &r) const { return Vector(*this)*= r; }
 size_t size() const { return dat.size(); }
 friend R dot(const Vector<R> &a, const Vector<R> &b) { return assert(a.size() == b.size()), (a.dat * b.dat).sum(); }
};
using u128= __uint128_t;
using u64= uint64_t;
using u8= uint8_t;
class Ref {
 u128 *ref;
 u8 i;
public:
 Ref(u128 *ref, u8 i): ref(ref), i(i) {}
 Ref &operator=(const Ref &r) { return *this= bool(r); }
 Ref &operator=(bool b) { return *ref&= ~(u128(1) << i), *ref|= u128(b) << i, *this; }
 Ref &operator|=(bool b) { return *ref|= u128(b) << i, *this; }
 Ref &operator&=(bool b) { return *ref&= ~(u128(!b) << i), *this; }
 Ref &operator^=(bool b) { return *ref^= u128(b) << i, *this; }
 operator bool() const { return (*ref >> i) & 1; }
};
template <> class Vector<bool> {
 size_t n;
public:
 valarray<u128> dat;
 Vector(): n(0) {}
 Vector(size_t n): n(n), dat((n + 127) >> 7) {}
 Vector(size_t n, bool b): n(n), dat(-u128(b), (n + 127) >> 7) {
  if (int k= n & 127; k) dat[dat.size() - 1]&= (u128(1) << k) - 1;
 }
 Vector(const initializer_list<bool> &v): n(v.size()), dat((n + 127) >> 7) {
  int i= 0;
  for (bool b: v) dat[i >> 7]|= u128(b) << (i & 127), ++i;
 }
 Ref operator[](int i) { return {begin(dat) + (i >> 7), u8(i & 127)}; }
 bool operator[](int i) const { return (dat[i >> 7] >> (i & 127)) & 1; }
 bool operator==(const Vector &r) const {
  if (dat.size() != r.dat.size()) return false;
  for (int i= dat.size(); i--;)
   if (dat[i] != r.dat[i]) return false;
  return true;
 }
 bool operator!=(const Vector &r) const { return !(*this == r); }
 explicit operator bool() const { return n; }
 Vector operator-() const { return Vector(*this); }
 Vector &operator+=(const Vector &r) { return dat^= r.dat, *this; }
 Vector &operator-=(const Vector &r) { return dat^= r.dat, *this; }
 Vector &operator*=(bool b) { return dat*= b, *this; }
 Vector operator+(const Vector &r) const { return Vector(*this)+= r; }
 Vector operator-(const Vector &r) const { return Vector(*this)-= r; }
 Vector operator*(bool b) const { return Vector(*this)*= b; }
 size_t size() const { return n; }
 friend bool dot(const Vector<bool> &a, const Vector<bool> &b) {
  assert(a.size() == b.size());
  u128 v= 0;
  for (int i= a.dat.size(); i--;) v^= a.dat[i] & b.dat[i];
  return __builtin_parityll(v >> 64) ^ __builtin_parityll(u64(v));
 }
};
template <class R> Vector<R> operator*(const R &r, const Vector<R> &v) { return v * r; }
template <class R> ostream &operator<<(ostream &os, const Vector<R> &v) {
 os << '[';
 for (int _= 0, __= v.size(); _ < __; ++_) os << (_ ? ", " : "") << v[_];
 return os << ']';
}
}
using _la_internal::Vector;
#line 2 "src/Misc/rng.hpp"
#include <random>
#line 4 "src/Misc/rng.hpp"
uint64_t rng() {
 static uint64_t x= 10150724397891781847ULL * std::random_device{}();
 return x^= x << 7, x^= x >> 9;
}
uint64_t rng(uint64_t lim) { return rng() % lim; }
int64_t rng(int64_t l, int64_t r) { return l + rng() % (r - l); }
#line 7 "src/LinearAlgebra/MinimalPolynomial.hpp"
// c s.t. (c[d] * M^d + c[d-1] * M^(d-1)  + ... + c[1] * M + c[0]) * b = 0
template <class mod_t, class LinMap> class MinimalPolynomial {
 std::vector<mod_t> poly, rev;
 size_t dg, n;
 std::vector<Vector<mod_t>> bs;
 static inline int deg(const std::vector<mod_t> &p) {
  for (int d= p.size() - 1;; d--)
   if (d < 0 || p[d] != mod_t()) return d;
 }
 static inline std::vector<mod_t> bostan_mori_msb(const std::vector<mod_t> &q, uint64_t k) {
  int d= deg(q);
  assert(d >= 0), assert(q[0] != mod_t());
  std::vector<mod_t> ret(std::max(d, 1));
  if (k == 0) return ret.back()= mod_t(1), ret;
  std::vector<mod_t> v(d + 1);
  for (int i= 0; i <= d; i+= 2)
   for (int j= 0; j <= d; j+= 2) v[(i + j) >> 1]+= q[i] * q[j];
  for (int i= 1; i <= d; i+= 2)
   for (int j= 1; j <= d; j+= 2) v[(i + j) >> 1]-= q[i] * q[j];
  auto w= bostan_mori_msb(v, k >> 1);
  for (int i= 2 * d - 1 - (k & 1); i >= d; i-= 2)
   for (int j= 0; j <= d; j+= 2) ret[i - d]+= q[j] * w[(i - j) >> 1];
  for (int i= 2 * d - 1 - !(k & 1); i >= d; i-= 2)
   for (int j= 1; j <= d; j+= 2) ret[i - d]-= q[j] * w[(i - j) >> 1];
  return ret;
 }
 std::vector<mod_t> x_pow_mod(uint64_t k) const {
  assert(k >= n);
  std::vector<mod_t> ret(n), u= bostan_mori_msb(rev, k - n + dg);
  for (int i= dg; i--;)
   for (int j= i + 1; j--;) ret[n - 1 - i]+= u[j] * rev[i - j];
  return ret;
 }
public:
 MinimalPolynomial(const LinMap &M, Vector<mod_t> b): n(b.size()), bs(n) {
  static_assert(is_modint_v<mod_t>);
  Vector<mod_t> a(n);
  for (size_t i= n; i--;) a[i]= rng(1, mod_t::mod() - 1);
  std::vector<mod_t> v((n + 1) << 1);
  for (size_t i= v.size(), j= 0;; b= M(b)) {
   if (j < n) bs[j]= b;
   if (v[j++]= dot(a, b); !(--i)) break;
  }
  rev= berlekamp_massey(v);
  for (auto &x: rev) x= -x;
  rev.insert(rev.begin(), 1), poly.assign(rev.rbegin(), rev.rend()), rev.erase(rev.begin() + (dg= deg(rev)) + 1, rev.end());
 }
 Vector<mod_t> pow(uint64_t k) const {  // M^k * b
  if (k < n) return bs[k];
  auto r= x_pow_mod(k);
  Vector<mod_t> ret= r[0] * bs[0];
  for (int i= r.size(); --i;) ret+= r[i] * bs[i];
  return ret;
 }
 const mod_t &operator[](size_t k) const { return poly[k]; }
 const auto begin() const { return poly.begin(); }
 const auto end() const { return poly.end(); }
 size_t degree() const { return dg; }
};
template <class mod_t, class LinMap> mod_t linear_map_det(const LinMap &M, int n) {
 Vector<mod_t> b(n);
 for (int i= n; i--;) b[i]= rng(1, mod_t::mod() - 1);
 std::vector<mod_t> D(n);
 for (auto &x: D) x= rng(1, mod_t::mod() - 1);
 auto f= [&](Vector<mod_t> a) {
  for (int i= n; i--;) a[i]*= D[i];
  return M(a);
 };
 mod_t ret= MinimalPolynomial(f, b)[0], den= 1;
 if (n & 1) ret= -ret;
 for (const auto &x: D) den*= x;
 return ret / den;
}
#line 7 "test/yosupo/sparse_matrix_det.test.cpp"
using namespace std;
signed main() {
 cin.tie(0);
 ios::sync_with_stdio(false);
 using Mint= ModInt<998244353>;
 using Vec= Vector<Mint>;
 int N, K;
 cin >> N >> K;
 int a[K], b[K], c[K];
 for (int i= 0; i < K; i++) cin >> a[i] >> b[i] >> c[i];
 auto f= [&](const Vec& v) {
  Vec ret(N);
  for (int i= 0; i < K; i++) ret[a[i]]+= v[b[i]] * c[i];
  return ret;
 };
 cout << linear_map_det<Mint>(f, N) << '\n';
 return 0;
}

Test cases

Env Name Status Elapsed Memory
g++-13 example_00 :heavy_check_mark: AC 5 ms 4 MB
g++-13 example_01 :heavy_check_mark: AC 4 ms 3 MB
g++-13 hack2_00 :heavy_check_mark: AC 461 ms 39 MB
g++-13 hack_00 :heavy_check_mark: AC 5 ms 4 MB
g++-13 max_random_00 :heavy_check_mark: AC 478 ms 38 MB
g++-13 max_random_01 :heavy_check_mark: AC 481 ms 39 MB
g++-13 max_random_02 :heavy_check_mark: AC 460 ms 36 MB
g++-13 max_random_03 :heavy_check_mark: AC 483 ms 39 MB
g++-13 max_random_04 :heavy_check_mark: AC 447 ms 35 MB
g++-13 perm_max_random_00 :heavy_check_mark: AC 266 ms 38 MB
g++-13 perm_max_random_01 :heavy_check_mark: AC 268 ms 39 MB
g++-13 perm_max_random_02 :heavy_check_mark: AC 249 ms 36 MB
g++-13 perm_max_random_03 :heavy_check_mark: AC 267 ms 39 MB
g++-13 perm_max_random_04 :heavy_check_mark: AC 238 ms 35 MB
g++-13 perm_plus_random_00 :heavy_check_mark: AC 486 ms 38 MB
g++-13 perm_plus_random_01 :heavy_check_mark: AC 489 ms 39 MB
g++-13 perm_plus_random_02 :heavy_check_mark: AC 465 ms 36 MB
g++-13 perm_plus_random_03 :heavy_check_mark: AC 491 ms 38 MB
g++-13 perm_plus_random_04 :heavy_check_mark: AC 452 ms 35 MB
g++-13 random_00 :heavy_check_mark: AC 21 ms 5 MB
g++-13 random_01 :heavy_check_mark: AC 12 ms 4 MB
g++-13 random_02 :heavy_check_mark: AC 10 ms 4 MB
g++-13 random_03 :heavy_check_mark: AC 117 ms 10 MB
g++-13 random_04 :heavy_check_mark: AC 87 ms 30 MB
clang++-18 example_00 :heavy_check_mark: AC 5 ms 4 MB
clang++-18 example_01 :heavy_check_mark: AC 4 ms 4 MB
clang++-18 hack2_00 :heavy_check_mark: AC 399 ms 39 MB
clang++-18 hack_00 :heavy_check_mark: AC 4 ms 4 MB
clang++-18 max_random_00 :heavy_check_mark: AC 412 ms 38 MB
clang++-18 max_random_01 :heavy_check_mark: AC 416 ms 39 MB
clang++-18 max_random_02 :heavy_check_mark: AC 396 ms 36 MB
clang++-18 max_random_03 :heavy_check_mark: AC 417 ms 38 MB
clang++-18 max_random_04 :heavy_check_mark: AC 386 ms 35 MB
clang++-18 perm_max_random_00 :heavy_check_mark: AC 227 ms 38 MB
clang++-18 perm_max_random_01 :heavy_check_mark: AC 229 ms 39 MB
clang++-18 perm_max_random_02 :heavy_check_mark: AC 215 ms 36 MB
clang++-18 perm_max_random_03 :heavy_check_mark: AC 230 ms 39 MB
clang++-18 perm_max_random_04 :heavy_check_mark: AC 204 ms 35 MB
clang++-18 perm_plus_random_00 :heavy_check_mark: AC 421 ms 38 MB
clang++-18 perm_plus_random_01 :heavy_check_mark: AC 422 ms 39 MB
clang++-18 perm_plus_random_02 :heavy_check_mark: AC 403 ms 36 MB
clang++-18 perm_plus_random_03 :heavy_check_mark: AC 423 ms 38 MB
clang++-18 perm_plus_random_04 :heavy_check_mark: AC 391 ms 35 MB
clang++-18 random_00 :heavy_check_mark: AC 19 ms 5 MB
clang++-18 random_01 :heavy_check_mark: AC 11 ms 4 MB
clang++-18 random_02 :heavy_check_mark: AC 10 ms 4 MB
clang++-18 random_03 :heavy_check_mark: AC 102 ms 10 MB
clang++-18 random_04 :heavy_check_mark: AC 69 ms 30 MB
Back to top page