test/yukicoder/1340.test.cpp

• View this file on GitHub
• Last update: 2024-09-24 14:37:39+09:00
• Problem: https://yukicoder.me/problems/no/1340

Depends on

• detection idiom (src/Internal/detection_idiom.hpp)
• 行列 (src/LinearAlgebra/Matrix.hpp)
• ベクトル (src/LinearAlgebra/Vector.hpp)
• 代数的構造 (src/Math/Algebra.hpp)

Code

// competitive-verifier: PROBLEM https://yukicoder.me/problems/no/1340
// competitive-verifier: TLE 0.5
// competitive-verifier: MLE 64
#include <iostream>
#include "src/LinearAlgebra/Matrix.hpp"
#include "src/Math/Algebra.hpp"
using namespace std;
struct Rig {
 using T= bool;
 static constexpr T o= false, i= true;
 static T add(T a, T b) { return a | b; }
 static T mul(T a, T b) { return a & b; }
};
signed main() {
 cin.tie(0);
 ios::sync_with_stdio(0);
 long long N, M, T;
 cin >> N >> M >> T;
 Matrix<Algebra<Rig>> A(N, N);
 while (M--) {
  int a, b;
  cin >> a >> b;
  A[b][a]= 1;
 }
 auto B= A.pow(T);
 int ans= 0;
 for (int i= 0; i < N; i++) ans+= B[i][0].x;
 cout << ans << '\n';
 return 0;
}

#line 1 "test/yukicoder/1340.test.cpp"
// competitive-verifier: PROBLEM https://yukicoder.me/problems/no/1340
// competitive-verifier: TLE 0.5
// competitive-verifier: MLE 64
#include <iostream>
#line 2 "src/LinearAlgebra/Matrix.hpp"
#include <cassert>
#include <vector>
#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 5 "src/LinearAlgebra/Matrix.hpp"
namespace _la_internal {
template <class R, class D> struct Mat {
 Mat(): W(0) {}
 Mat(size_t h, size_t w): W(w), dat(h * w) {}
 Mat(size_t h, size_t w, R v): W(w), dat(v, h * w) {}
 Mat(initializer_list<initializer_list<R>> v): W(v.size() ? v.begin()->size() : 0), dat(v.size() * W) {
  auto it= begin(dat);
  for (const auto &r: v) {
   assert(r.size() == W);
   for (R x: r) *it++= x;
  }
 }
 size_t width() const { return W; }
 size_t height() const { return W ? dat.size() / W : 0; }
 auto operator[](int i) { return begin(dat) + i * W; }
 auto operator[](int i) const { return begin(dat) + i * W; }
protected:
 size_t W;
 valarray<R> dat;
 void add(const Mat &r) { assert(dat.size() == r.dat.size()), assert(W == r.W), dat+= r.dat; }
 D mul(const Mat &r) const {
  const size_t h= height(), w= r.W, l= W;
  assert(l == r.height());
  D ret(h, w);
  auto a= begin(dat);
  auto c= begin(ret.dat);
  for (int i= h; i--; c+= w) {
   auto b= begin(r.dat);
   for (int k= l; k--; ++a) {
    auto d= c;
    auto v= *a;
    for (int j= w; j--; ++b, ++d) *d+= v * *b;
   }
  }
  return ret;
 }
 Vector<R> mul(const Vector<R> &r) const {
  assert(W == r.size());
  const size_t h= height();
  Vector<R> ret(h);
  auto a= begin(dat);
  for (size_t i= 0; i < h; ++i)
   for (size_t k= 0; k < W; ++k, ++a) ret[i]+= *a * r[k];
  return ret;
 }
};
template <class D> struct Mat<bool, D> {
 struct Array {
  u128 *bg;
  Array(u128 *it): bg(it) {}
  Ref operator[](int i) { return Ref{bg + (i >> 7), u8(i & 127)}; }
  bool operator[](int i) const { return (bg[i >> 7] >> (i & 127)) & 1; }
 };
 struct ConstArray {
  const u128 *bg;
  ConstArray(const u128 *it): bg(it) {}
  bool operator[](int i) const { return (bg[i >> 7] >> (i & 127)) & 1; }
 };
 Mat(): H(0), W(0), m(0) {}
 Mat(size_t h, size_t w): H(h), W(w), m((w + 127) >> 7), dat(h * m) {}
 Mat(size_t h, size_t w, bool b): H(h), W(w), m((w + 127) >> 7), dat(-u128(b), h * m) {
  if (size_t i= h, k= w & 127; k)
   for (u128 s= (u128(1) << k) - 1; i--;) dat[i * m]&= s;
 }
 Mat(const initializer_list<initializer_list<bool>> &v): H(v.size()), W(H ? v.begin()->size() : 0), m((W + 127) >> 7), dat(H * m) {
  auto it= begin(dat);
  for (const auto &r: v) {
   assert(r.size() == W);
   int i= 0;
   for (bool b: r) it[i >> 7]|= u128(b) << (i & 127), ++i;
   it+= m;
  }
 }
 size_t width() const { return W; }
 size_t height() const { return H; }
 Array operator[](int i) { return {begin(dat) + i * m}; }
 ConstArray operator[](int i) const { return {begin(dat) + i * m}; }
 ConstArray get(int i) const { return {begin(dat) + i * m}; }
protected:
 size_t H, W, m;
 valarray<u128> dat;
 void add(const Mat &r) { assert(H == r.H), assert(W == r.W), dat^= r.dat; }
 D mul(const Mat &r) const {
  assert(W == r.H);
  D ret(H, r.W);
  valarray<u128> tmp(r.m << 8);
  auto y= begin(r.dat);
  for (size_t l= 0; l < W; l+= 8) {
   auto t= begin(tmp) + r.m;
   for (int i= 0, n= min<size_t>(8, W - l); i < n; ++i, y+= r.m) {
    auto u= begin(tmp);
    for (int s= 1 << i; s--;) {
     auto z= y;
     for (int j= r.m; j--; ++u, ++t, ++z) *t= *u ^ *z;
    }
   }
   auto a= begin(dat) + (l >> 7);
   auto c= begin(ret.dat);
   for (int i= H; i--; a+= m) {
    auto u= begin(tmp) + ((*a >> (l & 127)) & 255) * r.m;
    for (int j= r.m; j--; ++c, ++u) *c^= *u;
   }
  }
  return ret;
 }
 Vector<bool> mul(const Vector<bool> &r) const {
  assert(W == r.size());
  Vector<bool> ret(H);
  auto a= begin(dat);
  for (size_t i= 0; i < H; ++i) {
   u128 v= 0;
   for (size_t j= 0; j < m; ++j, ++a) v^= *a & r.dat[j];
   ret[i]= __builtin_parityll(v >> 64) ^ __builtin_parityll(u64(v));
  }
  return ret;
 }
};
template <class R> struct Matrix: public Mat<R, Matrix<R>> {
 using Mat<R, Matrix<R>>::Mat;
 explicit operator bool() const { return this->W; }
 static Matrix identity(int n) {
  Matrix ret(n, n);
  for (; n--;) ret[n][n]= R(true);
  return ret;
 }
 Matrix submatrix(const vector<int> &rows, const vector<int> &cols) const {
  Matrix ret(rows.size(), cols.size());
  for (int i= rows.size(); i--;)
   for (int j= cols.size(); j--;) ret[i][j]= (*this)[rows[i]][cols[j]];
  return ret;
 }
 Matrix submatrix_rm(vector<int> rows, vector<int> cols) const {
  sort(begin(rows), end(rows)), sort(begin(cols), end(cols)), rows.erase(unique(begin(rows), end(rows)), end(rows)), cols.erase(unique(begin(cols), end(cols)), end(cols));
  const int H= this->height(), W= this->width(), n= rows.size(), m= cols.size();
  vector<int> rs(H - n), cs(W - m);
  for (int i= 0, j= 0, k= 0; i < H; ++i)
   if (j < n && rows[j] == i) ++j;
   else rs[k++]= i;
  for (int i= 0, j= 0, k= 0; i < W; ++i)
   if (j < m && cols[j] == i) ++j;
   else cs[k++]= i;
  return submatrix(rs, cs);
 }
 bool operator==(const Matrix &r) const {
  if (this->width() != r.width() || this->height() != r.height()) return false;
  for (int i= this->dat.size(); i--;)
   if (this->dat[i] != r.dat[i]) return false;
  return true;
 }
 bool operator!=(const Matrix &r) const { return !(*this == r); }
 Matrix &operator*=(const Matrix &r) { return *this= this->mul(r); }
 Matrix operator*(const Matrix &r) const { return this->mul(r); }
 Matrix &operator*=(R r) { return this->dat*= r, *this; }
 template <class T> Matrix operator*(T r) const {
  static_assert(is_convertible_v<T, R>);
  return Matrix(*this)*= r;
 }
 Matrix &operator+=(const Matrix &r) { return this->add(r), *this; }
 Matrix operator+(const Matrix &r) const { return Matrix(*this)+= r; }
 Vector<R> operator*(const Vector<R> &r) const { return this->mul(r); }
 Vector<R> operator()(const Vector<R> &r) const { return this->mul(r); }
 Matrix pow(uint64_t k) const {
  size_t W= this->width();
  assert(W == this->height());
  for (Matrix ret= identity(W), b= *this;; b*= b)
   if (k & 1 ? ret*= b, !(k>>= 1) : !(k>>= 1)) return ret;
 }
};
template <class R, class T> Matrix<R> operator*(const T &r, const Matrix<R> &m) { return m * r; }
template <class R> ostream &operator<<(ostream &os, const Matrix<R> &m) {
 os << "\n[";
 for (int i= 0, h= m.height(); i < h; os << ']', ++i) {
  if (i) os << "\n ";
  os << '[';
  for (int j= 0, w= m.width(); j < w; ++j) os << (j ? ", " : "") << m[i][j];
 }
 return os << ']';
}
template <class K> static bool is_zero(K x) {
 if constexpr (is_floating_point_v<K>) return abs(x) < 1e-8;
 else return x == K();
}
}
using _la_internal::Matrix;
#line 2 "src/Internal/detection_idiom.hpp"
#include <type_traits>
#define _DETECT_BOOL(name, ...) \
 template <class, class= void> struct name: std::false_type {}; \
 template <class T> struct name<T, std::void_t<__VA_ARGS__>>: std::true_type {}; \
 template <class T> static constexpr bool name##_v= name<T>::value
#define _DETECT_TYPE(name, type1, type2, ...) \
 template <class T, class= void> struct name { \
  using type= type2; \
 }; \
 template <class T> struct name<T, std::void_t<__VA_ARGS__>> { \
  using type= type1; \
 }
#line 3 "src/Math/Algebra.hpp"
template <class M> struct Algebra {
 using T= typename M::T;
 _DETECT_BOOL(has_zero, decltype(T::o));
 _DETECT_BOOL(has_one, decltype(T::i));
 static inline T zero= has_zero_v<M> ? M::o : T();
 static inline T one= has_one_v<M> ? M::i : T();
 T x;
 Algebra(): x(zero) {}
 Algebra(bool y): x(y ? one : zero) {}
 template <class U, typename= std::enable_if_t<std::is_convertible_v<U, T>>> Algebra(U y): x(y) {}
 Algebra &operator+=(const Algebra &r) { return *this= *this + r; }
 Algebra &operator-=(const Algebra &r) { return *this= *this - r; }
 Algebra &operator*=(const Algebra &r) { return *this= *this * r; }
 Algebra operator+(const Algebra &r) const { return Algebra(M::add(x, r.x)); }
 Algebra operator-(const Algebra &r) const { return Algebra(M::add(x, M::neg(r.x))); }
 Algebra operator*(const Algebra &r) const { return Algebra(M::mul(x, r.x)); }
 Algebra operator-() const { return Algebra(M::neg(x)); }
 bool operator==(const Algebra &r) const { return x == r.x; }
 bool operator!=(const Algebra &r) const { return x != r.x; }
 friend std::istream &operator>>(std::istream &is, Algebra &r) { return is >> r.x, is; }
 friend std::ostream &operator<<(std::ostream &os, const Algebra &r) { return os << r.x; }
};
#line 7 "test/yukicoder/1340.test.cpp"
using namespace std;
struct Rig {
 using T= bool;
 static constexpr T o= false, i= true;
 static T add(T a, T b) { return a | b; }
 static T mul(T a, T b) { return a & b; }
};
signed main() {
 cin.tie(0);
 ios::sync_with_stdio(0);
 long long N, M, T;
 cin >> N >> M >> T;
 Matrix<Algebra<Rig>> A(N, N);
 while (M--) {
  int a, b;
  cin >> a >> b;
  A[b][a]= 1;
 }
 auto B= A.pow(T);
 int ans= 0;
 for (int i= 0; i < N; i++) ans+= B[i][0].x;
 cout << ans << '\n';
 return 0;
}

Test cases

Env	Name	Status	Elapsed	Memory
g++-13	01_sample_01.txt	AC	6 ms	4 MB
g++-13	01_sample_02.txt	AC	6 ms	3 MB
g++-13	01_sample_03.txt	AC	6 ms	4 MB
g++-13	02_handmade_01.txt	AC	6 ms	4 MB
g++-13	02_handmade_02.txt	AC	6 ms	4 MB
g++-13	02_handmade_03.txt	AC	6 ms	4 MB
g++-13	02_handmade_04.txt	AC	6 ms	4 MB
g++-13	02_handmade_05.txt	AC	6 ms	4 MB
g++-13	02_handmade_06.txt	AC	6 ms	4 MB
g++-13	02_handmade_07.txt	AC	6 ms	4 MB
g++-13	02_handmade_08.txt	AC	6 ms	4 MB
g++-13	03_random_01.txt	AC	22 ms	3 MB
g++-13	03_random_02.txt	AC	9 ms	4 MB
g++-13	03_random_03.txt	AC	18 ms	4 MB
g++-13	03_random_04.txt	AC	39 ms	4 MB
g++-13	03_random_05.txt	AC	33 ms	4 MB
g++-13	03_random_06.txt	AC	9 ms	4 MB
g++-13	03_random_07.txt	AC	15 ms	4 MB
g++-13	03_random_08.txt	AC	22 ms	4 MB
g++-13	03_random_09.txt	AC	7 ms	4 MB
g++-13	03_random_10.txt	AC	6 ms	4 MB
g++-13	04_hard_01.txt	AC	27 ms	4 MB
g++-13	04_hard_02.txt	AC	60 ms	4 MB
g++-13	04_hard_03.txt	AC	27 ms	4 MB
g++-13	04_hard_04.txt	AC	109 ms	4 MB
g++-13	04_hard_05.txt	AC	9 ms	4 MB
g++-13	04_hard_06.txt	AC	7 ms	4 MB
g++-13	04_hard_07.txt	AC	7 ms	4 MB
g++-13	04_hard_08.txt	AC	9 ms	4 MB
g++-13	04_hard_09.txt	AC	6 ms	4 MB
g++-13	04_hard_10.txt	AC	28 ms	4 MB
g++-13	05_kill_01.txt	AC	108 ms	4 MB
g++-13	05_kill_02.txt	AC	93 ms	4 MB
g++-13	05_kill_03.txt	AC	92 ms	4 MB
g++-13	05_kill_04.txt	AC	83 ms	4 MB
g++-13	05_kill_05.txt	AC	99 ms	4 MB
g++-13	06_final_01.txt	AC	7 ms	4 MB
g++-13	06_final_02.txt	AC	7 ms	4 MB
g++-13	06_final_03.txt	AC	90 ms	4 MB
g++-13	07_add_01.txt	AC	30 ms	4 MB
g++-13	07_add_02.txt	AC	31 ms	4 MB
g++-13	07_add_03.txt	AC	31 ms	4 MB
g++-13	07_add_04.txt	AC	6 ms	4 MB
g++-13	07_add_05.txt	AC	6 ms	4 MB
g++-13	07_add_06.txt	AC	6 ms	4 MB
g++-13	07_add_07.txt	AC	6 ms	4 MB
g++-13	07_add_08.txt	AC	24 ms	4 MB
g++-13	07_add_09.txt	AC	25 ms	4 MB
g++-13	07_add_10.txt	AC	30 ms	4 MB
g++-13	07_add_11.txt	AC	27 ms	4 MB
g++-13	07_add_12.txt	AC	27 ms	4 MB
g++-13	07_add_13.txt	AC	27 ms	4 MB
g++-13	08_doubt_01.txt	AC	46 ms	4 MB
g++-13	08_doubt_02.txt	AC	45 ms	4 MB
g++-13	08_doubt_03.txt	AC	47 ms	4 MB
g++-13	09_aftercontest_01.txt	AC	38 ms	4 MB
g++-13	98_challenge01.txt	AC	6 ms	4 MB
g++-13	98_challenge02.txt	AC	6 ms	4 MB
g++-13	98_challenge03.txt	AC	6 ms	4 MB
g++-13	98_challenge04.txt	AC	17 ms	4 MB
g++-13	98_challenge05.txt	AC	6 ms	4 MB
g++-13	98_challenge06.txt	AC	17 ms	4 MB
clang++-18	01_sample_01.txt	AC	6 ms	4 MB
clang++-18	01_sample_02.txt	AC	6 ms	4 MB
clang++-18	01_sample_03.txt	AC	6 ms	4 MB
clang++-18	02_handmade_01.txt	AC	6 ms	4 MB
clang++-18	02_handmade_02.txt	AC	6 ms	4 MB
clang++-18	02_handmade_03.txt	AC	6 ms	4 MB
clang++-18	02_handmade_04.txt	AC	6 ms	4 MB
clang++-18	02_handmade_05.txt	AC	6 ms	4 MB
clang++-18	02_handmade_06.txt	AC	6 ms	4 MB
clang++-18	02_handmade_07.txt	AC	6 ms	4 MB
clang++-18	02_handmade_08.txt	AC	6 ms	4 MB
clang++-18	03_random_01.txt	AC	18 ms	4 MB
clang++-18	03_random_02.txt	AC	8 ms	4 MB
clang++-18	03_random_03.txt	AC	15 ms	4 MB
clang++-18	03_random_04.txt	AC	33 ms	4 MB
clang++-18	03_random_05.txt	AC	29 ms	4 MB
clang++-18	03_random_06.txt	AC	8 ms	4 MB
clang++-18	03_random_07.txt	AC	13 ms	4 MB
clang++-18	03_random_08.txt	AC	19 ms	4 MB
clang++-18	03_random_09.txt	AC	7 ms	4 MB
clang++-18	03_random_10.txt	AC	6 ms	4 MB
clang++-18	04_hard_01.txt	AC	19 ms	4 MB
clang++-18	04_hard_02.txt	AC	44 ms	4 MB
clang++-18	04_hard_03.txt	AC	20 ms	4 MB
clang++-18	04_hard_04.txt	AC	81 ms	4 MB
clang++-18	04_hard_05.txt	AC	9 ms	4 MB
clang++-18	04_hard_06.txt	AC	7 ms	4 MB
clang++-18	04_hard_07.txt	AC	7 ms	4 MB
clang++-18	04_hard_08.txt	AC	8 ms	4 MB
clang++-18	04_hard_09.txt	AC	6 ms	4 MB
clang++-18	04_hard_10.txt	AC	20 ms	4 MB
clang++-18	05_kill_01.txt	AC	78 ms	4 MB
clang++-18	05_kill_02.txt	AC	81 ms	4 MB
clang++-18	05_kill_03.txt	AC	79 ms	4 MB
clang++-18	05_kill_04.txt	AC	69 ms	4 MB
clang++-18	05_kill_05.txt	AC	80 ms	4 MB
clang++-18	06_final_01.txt	AC	7 ms	4 MB
clang++-18	06_final_02.txt	AC	7 ms	4 MB
clang++-18	06_final_03.txt	AC	70 ms	4 MB
clang++-18	07_add_01.txt	AC	27 ms	4 MB
clang++-18	07_add_02.txt	AC	28 ms	4 MB
clang++-18	07_add_03.txt	AC	27 ms	4 MB
clang++-18	07_add_04.txt	AC	6 ms	4 MB
clang++-18	07_add_05.txt	AC	6 ms	4 MB
clang++-18	07_add_06.txt	AC	6 ms	4 MB
clang++-18	07_add_07.txt	AC	5 ms	4 MB
clang++-18	07_add_08.txt	AC	19 ms	4 MB
clang++-18	07_add_09.txt	AC	21 ms	4 MB
clang++-18	07_add_10.txt	AC	23 ms	4 MB
clang++-18	07_add_11.txt	AC	24 ms	4 MB
clang++-18	07_add_12.txt	AC	24 ms	4 MB
clang++-18	07_add_13.txt	AC	24 ms	4 MB
clang++-18	08_doubt_01.txt	AC	41 ms	4 MB
clang++-18	08_doubt_02.txt	AC	41 ms	4 MB
clang++-18	08_doubt_03.txt	AC	42 ms	4 MB
clang++-18	09_aftercontest_01.txt	AC	33 ms	4 MB
clang++-18	98_challenge01.txt	AC	7 ms	4 MB
clang++-18	98_challenge02.txt	AC	6 ms	4 MB
clang++-18	98_challenge03.txt	AC	6 ms	4 MB
clang++-18	98_challenge04.txt	AC	15 ms	4 MB
clang++-18	98_challenge05.txt	AC	6 ms	4 MB
clang++-18	98_challenge06.txt	AC	15 ms	4 MB

Back to top page