more files

codeforces/762/.clang-format

@@ -0,0 +1,9 @@
+BasedOnStyle: Google
+AllowShortBlocksOnASingleLine: false
+AllowShortCaseLabelsOnASingleLine: false
+AllowShortCompoundRequirementOnASingleLine: false
+AllowShortEnumsOnASingleLine: false
+AllowShortFunctionsOnASingleLine: false
+AllowShortIfStatementsOnASingleLine: false
+AllowShortLambdasOnASingleLine: false
+AllowShortLoopsOnASingleLine: false

codeforces/762/.clangd

@@ -0,0 +1,38 @@
+CompileFlags:
+	Add:
+		-O2
+		-Wall
+		-Wextra
+		-Wpedantic
+		-Wshadow
+		-Wformat=2
+		-Wfloat-equal
+		-Wlogical-op
+		-Wshift-overflow=2
+		-Wnon-virtual-dtor
+		-Wold-style-cast
+		-Wcast-qual
+		-Wuseless-cast
+		-Wno-sign-promotion
+		-Wcast-align
+		-Wunused
+		-Woverloaded-virtual
+		-Wconversion
+		-Wsign-conversion
+		-Wmisleading-indentation
+		-Wduplicated-cond
+		-Wduplicated-branches
+		-Wlogical-op
+		-Wnull-dereference
+		-Wformat=2
+		-Wformat-overflow
+		-Wformat-truncation
+		-Wdouble-promotion
+		-Wundef
+		-DLOCAL
+		-Wno-unknown-pragmas
+-e 		-std=c++23
+-e 		-std=c++23
+-e 		-std=c++23
+-e 		-std=c++23
+-e 		-std=c++23

codeforces/762/a.cc

@@ -0,0 +1,99 @@
+#include <bits/stdc++.h>  // {{{
+
+#include <version>
+#ifdef __cpp_lib_ranges_enumerate
+#include <ranges>
+namespace rv = std::views;
+namespace rs = std::ranges;
+#endif
+
+// https://codeforces.com/blog/entry/96344
+
+#pragma GCC optimize("O2,unroll-loops")
+#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
+
+using namespace std;
+
+using i32 = int32_t;
+using u32 = uint32_t;
+using i64 = int64_t;
+using u64 = uint64_t;
+using f64 = double;
+using f128 = long double;
+
+#if __cplusplus >= 202002L
+template <typename T>
+constexpr T MIN = std::numeric_limits<T>::min();
+
+template <typename T>
+constexpr T MAX = std::numeric_limits<T>::max();
+
+template <typename T>
+[[nodiscard]] static T sc(auto&& x) {
+  return static_cast<T>(x);
+}
+
+template <typename T>
+[[nodiscard]] static T sz(auto&& x) {
+  return static_cast<T>(x.size());
+}
+#endif
+
+static void NO() {
+  std::cout << "NO\n";
+}
+
+static void YES() {
+  std::cout << "YES\n";
+}
+
+template <typename T>
+using vec = std::vector<T>;
+
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define ff first
+#define ss second
+
+#ifdef LOCAL
+#define db(...) std::print(__VA_ARGS__)
+#define dbln(...) std::println(__VA_ARGS__)
+#else
+#define db(...)
+#define dbln(...)
+#endif
+//  }}}
+
+void solve() {
+  string s;
+  cin >> s;
+
+  if (s.size() % 2 == 0 &&
+      s.substr(0, s.size() / 2) == s.substr(s.size() / 2, s.size())) {
+    YES();
+  } else {
+    NO();
+  }
+}
+
+int main() {  // {{{
+  std::cin.exceptions(std::cin.failbit);
+
+#ifdef LOCAL
+  std::cerr.rdbuf(std::cout.rdbuf());
+  std::cout.setf(std::ios::unitbuf);
+  std::cerr.setf(std::ios::unitbuf);
+#else
+  std::cin.tie(nullptr)->sync_with_stdio(false);
+#endif
+
+  u32 tc = 1;
+  std::cin >> tc;
+
+  for (u32 t = 0; t < tc; ++t) {
+    solve();
+  }
+
+  return 0;
+}
+// }}}

codeforces/762/b.cc

@@ -0,0 +1,103 @@
+#include <bits/stdc++.h>  // {{{
+
+#include <version>
+#ifdef __cpp_lib_ranges_enumerate
+#include <ranges>
+namespace rv = std::views;
+namespace rs = std::ranges;
+#endif
+
+// https://codeforces.com/blog/entry/96344
+
+#pragma GCC optimize("O2,unroll-loops")
+#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
+
+using namespace std;
+
+using i32 = int32_t;
+using u32 = uint32_t;
+using i64 = int64_t;
+using u64 = uint64_t;
+using f64 = double;
+using f128 = long double;
+
+#if __cplusplus >= 202002L
+template <typename T>
+constexpr T MIN = std::numeric_limits<T>::min();
+
+template <typename T>
+constexpr T MAX = std::numeric_limits<T>::max();
+
+template <typename T>
+[[nodiscard]] static T sc(auto&& x) {
+  return static_cast<T>(x);
+}
+
+template <typename T>
+[[nodiscard]] static T sz(auto&& x) {
+  return static_cast<T>(x.size());
+}
+#endif
+
+static void NO() {
+  std::cout << "NO\n";
+}
+
+static void YES() {
+  std::cout << "YES\n";
+}
+
+template <typename T>
+using vec = std::vector<T>;
+
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define ff first
+#define ss second
+
+#ifdef LOCAL
+#define db(...) std::print(__VA_ARGS__)
+#define dbln(...) std::println(__VA_ARGS__)
+#else
+#define db(...)
+#define dbln(...)
+#endif
+//  }}}
+
+void solve() {
+  u64 n;
+  cin >> n;
+
+  unordered_set<u64> ans;
+
+  for (u64 x = 1; x * x <= n; ++x) {
+    ans.insert(x * x);
+  }
+  for (u64 x = 1; x * x * x <= n; ++x) {
+    ans.insert(x * x * x);
+  }
+
+  println("{}", ans.size());
+}
+
+int main() {  // {{{
+  std::cin.exceptions(std::cin.failbit);
+
+#ifdef LOCAL
+  std::cerr.rdbuf(std::cout.rdbuf());
+  std::cout.setf(std::ios::unitbuf);
+  std::cerr.setf(std::ios::unitbuf);
+#else
+  std::cin.tie(nullptr)->sync_with_stdio(false);
+#endif
+
+  u32 tc = 1;
+  std::cin >> tc;
+
+  for (u32 t = 0; t < tc; ++t) {
+    solve();
+  }
+
+  return 0;
+}
+// }}}

codeforces/762/c.cc

@@ -0,0 +1,122 @@
+#include <bits/stdc++.h>  // {{{
+
+#include <version>
+#ifdef __cpp_lib_ranges_enumerate
+#include <ranges>
+namespace rv = std::views;
+namespace rs = std::ranges;
+#endif
+
+// https://codeforces.com/blog/entry/96344
+
+#pragma GCC optimize("O2,unroll-loops")
+#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
+
+using namespace std;
+
+using i32 = int32_t;
+using u32 = uint32_t;
+using i64 = int64_t;
+using u64 = uint64_t;
+using f64 = double;
+using f128 = long double;
+
+#if __cplusplus >= 202002L
+template <typename T>
+constexpr T MIN = std::numeric_limits<T>::min();
+
+template <typename T>
+constexpr T MAX = std::numeric_limits<T>::max();
+
+template <typename T>
+[[nodiscard]] static T sc(auto&& x) {
+  return static_cast<T>(x);
+}
+
+template <typename T>
+[[nodiscard]] static T sz(auto&& x) {
+  return static_cast<T>(x.size());
+}
+#endif
+
+static void NO() {
+  std::cout << "NO\n";
+}
+
+static void YES() {
+  std::cout << "YES\n";
+}
+
+template <typename T>
+using vec = std::vector<T>;
+
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define ff first
+#define ss second
+
+#ifdef LOCAL
+#define db(...) std::print(__VA_ARGS__)
+#define dbln(...) std::println(__VA_ARGS__)
+#else
+#define db(...)
+#define dbln(...)
+#endif
+//  }}}
+
+void solve() {
+  u64 a, s;
+  cin >> a >> s;
+
+  string ans;
+
+  while (s) {
+    auto ad = a % 10, sd = s % 10;
+    if (ad <= sd) {
+      ans += to_string(sd - ad);
+    } else if (ad > sd && (10 + sd - ad) + ad == s % 100) {
+      ans += to_string(10 + sd - ad);
+      s /= 10;
+    } else {
+      println("-1");
+      return;
+    }
+    s /= 10;
+    a /= 10;
+  }
+
+  if (a) {
+    println("-1");
+    return;
+  }
+
+  reverse(all(ans));
+  u32 i = 0;
+  while (ans[i] == '0')
+    ++i;
+  for (; i < ans.size(); ++i)
+    print("{}", ans[i]);
+  println();
+}
+
+int main() {  // {{{
+  std::cin.exceptions(std::cin.failbit);
+
+#ifdef LOCAL
+  std::cerr.rdbuf(std::cout.rdbuf());
+  std::cout.setf(std::ios::unitbuf);
+  std::cerr.setf(std::ios::unitbuf);
+#else
+  std::cin.tie(nullptr)->sync_with_stdio(false);
+#endif
+
+  u32 tc = 1;
+  std::cin >> tc;
+
+  for (u32 t = 0; t < tc; ++t) {
+    solve();
+  }
+
+  return 0;
+}
+// }}}

codeforces/762/compile_flags.txt

@@ -0,0 +1,31 @@
+-pedantic-errors
+-O2
+-Wall
+-Wextra
+-Wpedantic
+-Wshadow
+-Wformat=2
+-Wfloat-equal
+-Wlogical-op
+-Wshift-overflow=2
+-Wnon-virtual-dtor
+-Wold-style-cast
+-Wcast-qual
+-Wuseless-cast
+-Wno-sign-promotion
+-Wcast-align
+-Wunused
+-Woverloaded-virtual
+-Wconversion
+-Wmisleading-indentation
+-Wduplicated-cond
+-Wduplicated-branches
+-Wlogical-op
+-Wnull-dereference
+-Wformat=2
+-Wformat-overflow
+-Wformat-truncation
+-Wdouble-promotion
+-Wundef
+-DLOCAL
+-std=c++23

codeforces/762/d.cc

@@ -0,0 +1,168 @@
+#include <bits/stdc++.h>  // {{{
+
+#include <version>
+#ifdef __cpp_lib_ranges_enumerate
+#include <ranges>
+namespace rv = std::views;
+namespace rs = std::ranges;
+#endif
+
+// https://codeforces.com/blog/entry/96344
+
+#pragma GCC optimize("O2,unroll-loops")
+#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
+
+using namespace std;
+
+using i32 = int32_t;
+using u32 = uint32_t;
+using i64 = int64_t;
+using u64 = uint64_t;
+using f64 = double;
+using f128 = long double;
+
+#if __cplusplus >= 202002L
+template <typename T>
+constexpr T MIN = std::numeric_limits<T>::min();
+
+template <typename T>
+constexpr T MAX = std::numeric_limits<T>::max();
+
+template <typename T>
+[[nodiscard]] static T sc(auto&& x) {
+  return static_cast<T>(x);
+}
+
+template <typename T>
+[[nodiscard]] static T sz(auto&& x) {
+  return static_cast<T>(x.size());
+}
+#endif
+
+static void NO() {
+  std::cout << "NO\n";
+}
+
+static void YES() {
+  std::cout << "YES\n";
+}
+
+template <typename T>
+using vec = std::vector<T>;
+
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define ff first
+#define ss second
+
+#ifdef LOCAL
+#define db(...) std::print(__VA_ARGS__)
+#define dbln(...) std::println(__VA_ARGS__)
+#else
+#define db(...)
+#define dbln(...)
+#endif
+//  }}}
+
+bitset<100000 + 1> friends;
+void solve() {
+  /*
+     binary search on alpha
+
+     how to know if i can choose at least n - 1 shops to give each guy a present
+     basically, choose, out of all m shops, n shops, one gives each guy a
+present (in the worst)
+
+     hm - must dynamically, per bsearch query, filter arrays
+
+     consider each array: if someone unset can be set, + 1 to count, update max
+     if already set, take max of large value
+
+challenge: n - 1 shops, not  all n
+ take a step back:
+
+ we have m arrays, each which set values offriend individually
+
+ consider each friend separately - have multiple values of joy set to; filter to
+>= mid alphaq
+
+ not nec. choose ones that set most -> greedy
+
+ ok - one shop per friend - per friend, iterate - find shop that sets their joy
+>= alpha
+
+ now, either < n (bad) or n shops - consider each friend as the "substitute"
+candidate
+
+ in other words, consider each friend, and iter AGAIN thru the shit - can we
+find ANOTHER diff array setting this guy, as well as setting another friend?
+
+ if so, done!
+     */
+
+  u32 m, n;
+  cin >> m >> n;
+
+  vec<vec<u64>> p(m, vec<u64>(n));
+  u64 maxp = 0;
+  for (auto& row : p) {
+    for (auto& e : row) {
+      cin >> e;
+      maxp = max(maxp, e);
+    }
+  }
+
+  u64 l = 1, r = maxp;
+
+  auto ok = [&](u64 alpha) {
+    friends.reset();
+    bool both_covered = false;
+
+    for (auto& shop : p) {
+      u32 shop_count = 0;
+      for (u32 i = 0; i < n; ++i) {
+        if (shop[i] >= alpha) {
+          ++shop_count;
+          friends.set(i);
+        }
+      }
+      both_covered |= shop_count > 1;
+    }
+
+    return friends.count() == n && both_covered;
+  };
+
+  while (l <= r) {
+    u64 alpha = l + (r - l) / 2;
+
+    if (ok(alpha)) {
+      l = alpha + 1;
+    } else {
+      r = alpha - 1;
+    }
+  }
+
+  println("{}", r);
+}
+
+int main() {  // {{{
+  std::cin.exceptions(std::cin.failbit);
+
+#ifdef LOCAL
+  std::cerr.rdbuf(std::cout.rdbuf());
+  std::cout.setf(std::ios::unitbuf);
+  std::cerr.setf(std::ios::unitbuf);
+#else
+  std::cin.tie(nullptr)->sync_with_stdio(false);
+#endif
+
+  u32 tc = 1;
+  std::cin >> tc;
+
+  for (u32 t = 0; t < tc; ++t) {
+    solve();
+  }
+
+  return 0;
+}
+// }}}

codeforces/762/debug_flags.txt

@@ -0,0 +1,14 @@
+-g3
+-fsanitize=address,undefined
+-fsanitize=float-divide-by-zero
+-fsanitize=float-cast-overflow
+-fno-sanitize-recover=all
+-fstack-protector-all
+-fstack-usage
+-fno-omit-frame-pointer
+-fno-inline
+-ffunction-sections
+-D_GLIBCXX_DEBUG
+-D_GLIBCXX_DEBUG_PEDANTIC
+-DLOCAL
+-std=c++23

codeforces/762/e.cc

@@ -0,0 +1,187 @@
+#include <bits/stdc++.h>  // {{{
+
+#include <version>
+#ifdef __cpp_lib_ranges_enumerate
+#include <ranges>
+namespace rv = std::views;
+namespace rs = std::ranges;
+#endif
+
+// https://codeforces.com/blog/entry/96344
+
+#pragma GCC optimize("O2,unroll-loops")
+#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
+
+using namespace std;
+
+using i32 = int32_t;
+using u32 = uint32_t;
+using i64 = int64_t;
+using u64 = uint64_t;
+using f64 = double;
+using f128 = long double;
+
+#if __cplusplus >= 202002L
+template <typename T>
+constexpr T MIN = std::numeric_limits<T>::min();
+
+template <typename T>
+constexpr T MAX = std::numeric_limits<T>::max();
+
+template <typename T>
+[[nodiscard]] static T sc(auto&& x) {
+  return static_cast<T>(x);
+}
+
+template <typename T>
+[[nodiscard]] static T sz(auto&& x) {
+  return static_cast<T>(x.size());
+}
+#endif
+
+static void NO() {
+  std::cout << "NO\n";
+}
+
+static void YES() {
+  std::cout << "YES\n";
+}
+
+template <typename T>
+using vec = std::vector<T>;
+
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define ff first
+#define ss second
+
+#ifdef LOCAL
+#define db(...) std::print(__VA_ARGS__)
+#define dbln(...) std::println(__VA_ARGS__)
+#else
+#define db(...)
+#define dbln(...)
+#endif
+//  }}}
+
+void solve() {
+  /*
+     i=0->n, # opers (-1 if no)
+ 
+ 
+     when impossible? mex MEX, cannot form 0, 1, 2, ... MEX - 1
+ 
+     consider bf, needing to form mex MEX
+     need MEX - 1 - take if there
+     ow, need i; take from largest candidate x, i - x "pull" it up, b/c closest
+ 
+     continue repeatedly - if not there, return -1
+ 
+     for all n, n^2 bf
+ 
+     is there a recursive structure?
+ 
+     say i pull up for mex MEX, does this help with MEX + 1
+     what's the challenge - pulling up to MEX, may need to pull up to MEX - 1,
+etc. then the gap eventually filled (if solution)
+ 
+     idea, as go L->R, pull up minimal for answer -> making 0->MEX; also pull up
+ 
+     observation - say missing for mex MEX, need to poull up - repeatedly
+hoisting each, to push up is same as pulling up from closest gap index; keep
+track of gap indices, and pull from closest one?
+ 
+     but is puling from closets optimal? -> yes, it is
+ 
+     narrow down in on this
+ 
+     also, you have to push elements away - i.e., for each element equal to the
+mex, + 1 is the "extra" count
+ 
+     so, for mex M; push freq[m] first
+     then, pull for M - 1, and take max free unused #, M - it, + 1 to the prev
+score (excluding the M count there)
+ 
+subtleties: the equal count - if matching MEX - 1 required pushing, we don't
+need to (we can ignore count) really, we just care about pulled for each in our
+dependent calculations
+ 
+let's be concrete
+ 
+mex MEX, solved 0->MEX - 1
+ 
+- sort a increasingly, and for each mex
+1. push off ==MEX values
+2. define pull[mex] as total cost of pulling to make 0->mex-1
+   - if no pull[MEX-1], -1
+   - else,
+     pull from largest available value, adding MEX - 1 - value
+        - pop used value
+     push self
+ 
+great, now, impl
+ 
+we iter over array and mex from 0 to n - which order?
+def iter over mex, then have freq map + available
+
+AFTER: so many mistakes
+
+only push f-1 elems, using 64-bit types, ease of implementation, breaking loop, using accumulator instead of deriving, etc.
+     */
+  u64 n;
+  cin >> n;
+  vec<i64> a(n);
+  map<i64, i64> f;
+  for (auto& e : a) {
+    cin >> e;
+    ++f[e];
+  }
+
+  vec<i64> available;
+  vec<i64> ans(n + 1, -1);
+
+  ans[0] = f[0];
+  for (i64 i = 0; i < max((i64)0, f[0] - 1); ++i)
+    available.push_back(0);
+
+  for (i64 mex = 1; mex <= (i64)n; ++mex) {
+    ans[mex] = ans[mex - 1] - f[mex - 1] + f[mex];
+
+    if (f[mex - 1] == 0) {
+      if (available.empty()) {
+        ans[mex] = -1;
+        break;
+      }
+      ans[mex] += (mex - 1 - available.back());
+      available.pop_back();
+    }
+
+    for (i64 i = 0; i < max((i64)0, f[mex] - 1); ++i)
+      available.push_back(mex);
+  }
+
+  for (u64 i = 0; i <= n; ++i)
+    cout << ans[i] << " \n"[i == n];
+}
+
+int main() {  // {{{
+  std::cin.exceptions(std::cin.failbit);
+
+#ifdef LOCAL
+  std::cerr.rdbuf(std::cout.rdbuf());
+  std::cout.setf(std::ios::unitbuf);
+  std::cerr.setf(std::ios::unitbuf);
+#else
+  std::cin.tie(nullptr)->sync_with_stdio(false);
+#endif
+
+  u32 tc = 1;
+  std::cin >> tc;
+
+  for (u32 t = 0; t < tc; ++t) {
+    solve();
+  }
+
+  return 0;
+}
+// }}}

codeforces/762/e2.cc

@@ -0,0 +1,122 @@
+#include <bits/stdc++.h>  // {{{
+
+#include <version>
+#ifdef __cpp_lib_ranges_enumerate
+#include <ranges>
+namespace rv = std::views;
+namespace rs = std::ranges;
+#endif
+
+// https://codeforces.com/blog/entry/96344
+
+#pragma GCC optimize("O2,unroll-loops")
+#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
+
+using namespace std;
+
+using i32 = int32_t;
+using u32 = uint32_t;
+using i64 = int64_t;
+using u64 = uint64_t;
+using f64 = double;
+using f128 = long double;
+
+#if __cplusplus >= 202002L
+template <typename T>
+constexpr T MIN = std::numeric_limits<T>::min();
+
+template <typename T>
+constexpr T MAX = std::numeric_limits<T>::max();
+
+template <typename T>
+[[nodiscard]] static T sc(auto&& x) {
+  return static_cast<T>(x);
+}
+
+template <typename T>
+[[nodiscard]] static T sz(auto&& x) {
+  return static_cast<T>(x.size());
+}
+#endif
+
+static void NO() {
+  std::cout << "NO\n";
+}
+
+static void YES() {
+  std::cout << "YES\n";
+}
+
+template <typename T>
+using vec = std::vector<T>;
+
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define ff first
+#define ss second
+
+#ifdef LOCAL
+#define db(...) std::print(__VA_ARGS__)
+#define dbln(...) std::println(__VA_ARGS__)
+#else
+#define db(...)
+#define dbln(...)
+#endif
+//  }}}
+
+void solve() {
+  u32 n;
+  cin >> n;
+
+  vec<u64> a(n);
+  for (auto& e : a)
+    cin >> e;
+  map<u32, u64> f;
+  for (auto e : a)
+    ++f[e];
+
+  u64 pull = 0;
+  vec<i64> ans(n + 1, -1);
+  vec<u32> available;
+
+  for (u32 mex = 0; mex <= n; ++mex) {
+    if (mex > 0 && f[mex - 1] == 0) {
+      if (available.empty()) {
+        break;
+      }
+      pull += mex - 1 - available.back();
+      available.pop_back();
+    }
+    ans[mex] = pull + f[mex];
+
+    for (u32 i = 0; i < (f[mex] > 0 ? f[mex] - 1 : 0); ++i) {
+      available.push_back(mex);
+    }
+  }
+
+  for (u32 i = 0; i <= n; ++i) {
+    cout << ans[i] << " \n"[i == n];
+  }
+}
+
+int main() {  // {{{
+  std::cin.exceptions(std::cin.failbit);
+
+#ifdef LOCAL
+  std::cerr.rdbuf(std::cout.rdbuf());
+  std::cout.setf(std::ios::unitbuf);
+  std::cerr.setf(std::ios::unitbuf);
+#else
+  std::cin.tie(nullptr)->sync_with_stdio(false);
+#endif
+
+  u32 tc = 1;
+  std::cin >> tc;
+
+  for (u32 t = 0; t < tc; ++t) {
+    solve();
+  }
+
+  return 0;
+}
+// }}}

codeforces/762/io/a.in

@@ -0,0 +1,11 @@
+10
+a
+aa
+aaa
+aaaa
+abab
+abcabc
+abacaba
+xxyy
+xyyx
+xyxy

codeforces/762/io/a.out

@@ -0,0 +1,14 @@
+NO
+YES
+NO
+YES
+YES
+YES
+NO
+NO
+NO
+YES
+
+[code]: 0
+[time]: 6.08635 ms
+[debug]: false

codeforces/762/io/b.in

@@ -0,0 +1,8 @@
+6
+10
+1
+25
+1000000000
+999999999
+500000000
+

codeforces/762/io/b.out

@@ -0,0 +1,10 @@
+4
+1
+6
+32591
+32590
+23125
+
+[code]: 0
+[time]: 11.6577 ms
+[debug]: false

codeforces/762/io/c.in

@@ -0,0 +1,8 @@
+7
+17236 1106911
+1 5
+108 112
+12345 1023412
+1 11
+1 20
+200 202

codeforces/762/io/c.out

@@ -0,0 +1,11 @@
+3465
+4
+-1
+90007
+10
+-1
+2
+
+[code]: 0
+[time]: 5.78475 ms
+[debug]: false

codeforces/762/io/d.in

@@ -0,0 +1,25 @@
+5
+
+2 2
+1 2
+3 4
+
+4 3
+1 3 1
+3 1 1
+1 2 2
+1 1 3
+
+2 3
+5 3 4
+2 5 1
+
+4 2
+7 9
+8 1
+9 6
+10 8
+
+2 4
+6 5 2 1
+7 9 7 2

codeforces/762/io/d.out

@@ -0,0 +1,9 @@
+3
+2
+4
+8
+2
+
+[code]: 0
+[time]: 2.3489 ms
+[debug]: false

codeforces/762/io/e.in

@@ -0,0 +1,12 @@
+5
+3
+0 1 3
+7
+0 1 2 3 4 3 2
+4
+3 0 0 0
+7
+4 6 2 3 5 0 5
+5
+4 0 1 0 4
+

codeforces/762/io/e.out

@@ -0,0 +1,9 @@
+1 1 0 -1
+1 1 2 2 1 0 2 6
+3 0 1 4 3
+1 0 -1 -1 -1 -1 -1 -1
+2 1 0 2 -1 -1
+
+[code]: 0
+[time]: 2.57897 ms
+[debug]: false

codeforces/762/io/e2.in

@@ -0,0 +1,11 @@
+5
+3
+0 1 3
+7
+0 1 2 3 4 3 2
+4
+3 0 0 0
+7
+4 6 2 3 5 0 5
+5
+4 0 1 0 4

codeforces/762/io/e2.out

@@ -0,0 +1,9 @@
+1 1 0 -1
+1 1 2 2 1 0 2 6
+3 0 1 4 3
+1 0 -1 -1 -1 -1 -1 -1
+2 1 0 2 -1 -1
+
+[code]: 0
+[time]: 2.49767 ms
+[debug]: false

codeforces/762/makefile

@@ -0,0 +1,30 @@
+.PHONY: run debug clean setup init
+
+VERSION ?= 20
+
+SRC = $(word 2,$(MAKECMDGOALS))
+
+.SILENT:
+
+run:
+	sh scripts/run.sh $(SRC)
+
+debug:
+	sh scripts/debug.sh $(SRC)
+
+clean:
+	rm -rf build/*
+
+setup:
+	test -d build || mkdir -p build
+	test -d io || mkdir -p io
+	test -d scripts || mkdir -p scripts
+	test -f .clang-format || cp $(HOME)/.config/cp-template/.clang-format .
+	test -f compile_flags.txt || cp $(HOME)/.config/cp-template/compile_flags.txt . && echo -std=c++$(VERSION) >>compile_flags.txt
+	test -f .clangd || cp $(HOME)/.config/cp-template/.clangd . && echo -e "\t\t-std=c++$(VERSION)" >>.clangd
+
+init:
+	make setup
+
+%:
+	@:

codeforces/762/scripts/debug.sh

@@ -0,0 +1,29 @@
+#!/bin/sh
+
+. ./scripts/utils.sh
+
+SRC="$1"
+BASE=$(basename "$SRC" .cc)
+INPUT="${BASE}.in"
+OUTPUT="${BASE}.out"
+DBG_BIN="${BASE}.debug"
+
+test -d build || mkdir -p build
+test -d io || mkdir -p io
+
+test -f "$INPUT" && test ! -f "io/$INPUT" && mv "$INPUT" "io/"
+test -f "$OUTPUT" && test ! -f "io/$OUTPUT" && mv "$OUTPUT" "io/"
+
+test -f "io/$INPUT" || touch "io/$INPUT"
+test -f "io/$OUTPUT" || touch "io/$OUTPUT"
+
+INPUT="io/$INPUT"
+OUTPUT="io/$OUTPUT"
+DBG_BIN="build/$DBG_BIN"
+
+compile_source "$SRC" "$DBG_BIN" "$OUTPUT" @debug_flags.txt
+CODE=$?
+test $CODE -gt 0 && exit $CODE
+
+execute_binary "$DBG_BIN" "$INPUT" "$OUTPUT" true
+exit $?

codeforces/762/scripts/run.sh

@@ -0,0 +1,29 @@
+#!/bin/sh
+
+. ./scripts/utils.sh
+
+SRC="$1"
+BASE=$(basename "$SRC" .cc)
+INPUT="${BASE}.in"
+OUTPUT="${BASE}.out"
+RUN_BIN="${BASE}.run"
+
+test -d build || mkdir -p build
+test -d io || mkdir -p io
+
+test -f "$INPUT" && test ! -f "io/$INPUT" && mv "$INPUT" "io/"
+test -f "$OUTPUT" && test ! -f "io/$OUTPUT" && mv "$OUTPUT" "io/"
+
+test -f "io/$INPUT" || touch "io/$INPUT"
+test -f "io/$OUTPUT" || touch "io/$OUTPUT"
+
+INPUT="io/$INPUT"
+OUTPUT="io/$OUTPUT"
+RUN_BIN="build/$RUN_BIN"
+
+compile_source "$SRC" "$RUN_BIN" "$OUTPUT" ""
+CODE=$?
+test $CODE -gt 0 && exit $CODE
+
+execute_binary "$RUN_BIN" "$INPUT" "$OUTPUT"
+exit $?

codeforces/762/scripts/utils.sh

@@ -0,0 +1,61 @@
+#!/bin/sh
+
+execute_binary() {
+  binary="$1"
+  input="$2"
+  output="$3"
+  is_debug="$4"
+
+  start=$(date '+%s.%N')
+  if [ -n "$is_debug" ]; then
+    asan="$(ldconfig -p | grep libasan.so | head -n1 | awk '{print $4}')"
+    LD_PRELOAD="$asan" timeout 2s ./"$binary" <"$input" >"$output" 2>&1
+  else
+    timeout 2s ./"$binary" <"$input" >"$output" 2>&1
+  fi
+  CODE=$?
+  end=$(date '+%s.%N')
+  truncate -s "$(head -n 1000 "$output" | wc -c)" "$output"
+
+  if [ $CODE -ge 124 ]; then
+    MSG=''
+    case $CODE in
+    124) MSG='TIMEOUT' ;;
+    128) MSG='SIGILL' ;;
+    130) MSG='SIGABRT' ;;
+    131) MSG='SIGBUS' ;;
+    136) MSG='SIGFPE' ;;
+    135) MSG='SIGSEGV' ;;
+    137) MSG='SIGPIPE' ;;
+    139) MSG='SIGTERM' ;;
+    esac
+    [ $CODE -ne 124 ] && sed -i '$d' "$output"
+    test -n "$MSG" && printf '\n[code]: %s (%s)' "$CODE" "$MSG" >>"$output"
+  else
+    printf '\n[code]: %s' "$CODE" >>"$output"
+  fi
+
+  printf '\n[time]: %s ms' "$(awk "BEGIN {print ($end - $start) * 1000}")" >>$output
+  test -n "$is_debug" && is_debug_string=true || is_debug_string=false
+  printf '\n[debug]: %s' "$is_debug_string" >>$output
+  return $CODE
+}
+
+compile_source() {
+  src="$1"
+  bin="$2"
+  output="$3"
+  flags="$4"
+
+  test -f "$bin" && rm "$bin" || true
+  g++ @compile_flags.txt $flags "$src" -o "$bin" 2>"$output"
+  CODE=$?
+
+  if [ $CODE -gt 0 ]; then
+    printf '\n[code]: %s' "$CODE" >>"$output"
+    return $CODE
+  else
+    echo '' >"$output"
+    return 0
+  fi
+}