more files

codeforces/920/.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/920/.clangd

@@ -0,0 +1,44 @@
+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
+-e 		-std=c++23
+-e 		-std=c++23
+-e 		-std=c++23
+-e 		-std=c++23
+-e 		-std=c++23
+-e 		-std=c++23

codeforces/920/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() {
+  vec<pair<u32, u32>> coords(4);
+  for (auto& coord : coords)
+    cin >> coord.first >> coord.second;
+
+  sort(all(coords));
+
+  auto side = coords[1].second - coords[0].second;
+
+  println("{}", side * side);
+}
+
+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/920/b.cc

@@ -0,0 +1,124 @@
+#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() {
+  /*
+     if both set/unset -> done
+
+     if final set, start unset - need + 1
+     if orig set, final unset - must move
+
+     must delete x, need y slots
+
+     use min(x, y) slots for y
+
+     remaining y must be added, remaining x must be deleted
+     */
+
+  u32 n;
+  cin >> n;
+
+  string a, b;
+  cin >> a >> b;
+
+  u32 A{}, B{};
+  for (u32 i = 0; i < n; ++i) {
+    if (a[i] == b[i]) {
+      continue;
+    }
+    if (a[i] == '1')
+      ++A;
+    else
+      ++B;
+  }
+
+  u32 ans = B;
+  A -= min(A, B);
+  ans += A;
+  println("{}", ans);
+}
+
+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/920/c.cc

@@ -0,0 +1,137 @@
+#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;
+  i64 f, b, a;
+  cin >> n >> f >> a >> b;
+
+  vec<i64> m(n);
+  for (auto& e : m) {
+    cin >> e;
+  }
+
+  i64 prev = 0;
+  for (u32 i = 0; i < n; ++i) {
+    auto delta = m[i] - prev;
+    f -= min(b, delta * a);
+    prev = m[i];
+  }
+
+  if (f <= 0) {
+    NO();
+  } else {
+    YES();
+  }
+
+  /*
+     f charge
+     off costs b
+     on costs 1
+
+     if
+
+     when to turn on/off the phone?
+
+NOTE: phone starts on
+     assume phone turns off, then, of course, you have to turn on at m[0]
+
+     so, WLOG, the phone is on
+
+     when to turn off?
+     if i have to wait > b to turn off, it will cost me > b; otherwise, it costs
+me b
+
+     wait, or turn off then on?
+     say delta seconds pass: min(delta * a, 2*b)
+
+details: message sending
+
+iter thru m, take time delta
+     */
+}
+
+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/920/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/920/d.cc

@@ -0,0 +1,147 @@
+#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, m;
+  cin >> n >> m;
+  vec<i64> a(n), b(m);
+  for (auto& e : a)
+    cin >> e;
+  for (auto& e : b)
+    cin >> e;
+
+  /*
+idea: maximize difference from a to b
+
+note: order doesn't matter in matching (but must print output)
+
+sort a?
+
+hm: consider a[0], w/ some remaining candidates
+
+min/max choice from b optimal - take better, alter ptrs
+
+3 6 7 9 10
+2 3 5 9 9
+
+8
+
+1 2 4 6
+1 2 3 3 5 7
+
+6532
+
+
+tbh, idk why greedy even works here
+     */
+  sort(all(a));
+  sort(all(b));
+
+  u32 a_l = 0, a_r = n - 1;
+  u32 b_l = 0, b_r = m - 1;
+  u64 ans = 0;
+  while (a_l <= a_r) {
+    array<i64, 4> diffs{abs(a[a_l] - b[b_l]), abs(a[a_l] - b[b_r]),
+                        abs(a[a_r] - b[b_l]), abs(a[a_r] - b[b_r])};
+
+    auto best_diff = max_element(all(diffs));
+    auto i = distance(diffs.begin(), best_diff);
+
+    ans += *best_diff;
+
+    if (i < 2)
+      ++a_l;
+    else
+      --a_r;
+    if (i % 2 == 0)
+      ++b_l;
+    else
+      --b_r;
+  }
+  println("{}", ans);
+}
+
+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/920/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/920/e.cc

@@ -0,0 +1,181 @@
+#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() {
+  i64 n, m;
+  cin >> n >> m;
+
+  i64 ar, ac, br, bc;
+  cin >> ar >> ac >> br >> bc;
+
+  // NOTE: forgot to adjust frontier + 1 (rly think thru!)
+
+  string ans{"Draw"};
+  if (ar < br) {
+    i64 frontier = (u64)ceill((ar + br) / 2.0);
+
+    // NOTE: key is alice gets extra move
+    // TBH, still confused (see mistaken note above) - don't understand
+    // didn't think about "optimal" play - i.e. alice leading one way
+    // can bob just go the opposite? then, alice ought to lead straight
+    // i think if u dig into the logic alice can lead straight in which bob
+    // can't do antyhing, but anyway all of this logic circumvented my mind, smh
+    // NOTE: this is why - SIMPLIFY
+    // simply consider the two player's positions on the frontier row itself -
+    // both on the same alice goes first so she gets extra move if frontier
+    // distance odd also, optimal strategy principle (explore too)
+    i64 aleft = max((i64)1, ac - (frontier - ar));
+    i64 aright = min(m, ac + frontier - ar);
+
+    i64 bleft = max((i64)1, bc - (br - frontier));
+    i64 bright = min(m, bc + (br - frontier));
+
+    bool alice_aggressor = (br - ar) & 1;
+
+    if (alice_aggressor) {
+      if (aleft <= bleft && aright >= bright) {
+        ans = "Alice";
+      }
+    } else {
+      if (bleft <= aleft && bright >= aright) {
+        ans = "Bob";
+      }
+    }
+  }
+
+  println("{}", ans);
+  /*
+
+--A-------
+-A-A------
+BB--------
+B---------
+----------
+----------
+----------
+----------
+----------
+----------
+
+ Alice
+Bob
+Draw
+Draw
+Draw
+Alice
+Draw
+Draw
+Bob
+Alice
+Alice
+Draw
+
+idea: consider frontier
+
+note: ar >= br -> DRAW
+ow, alice below bob, and there is a frontier
+
+alice/bob have frontier pos - enumerate them
+find aggressor - they cannot lose
+
+if aggressor can take all passive piece -> win, print aggressor
+ow, draw
+
+chess moment :sunglasses:
+
+O(h) -> ok
+
+to flesh out:
+
+derive frontier row
+derive a/b cols on row
+derive aggressor
+
+note: only care about the coords
+     */
+}
+
+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/920/io/a.in

@@ -0,0 +1,13 @@
+3
+1 2
+4 5
+1 5
+4 2
+-1 1
+1 -1
+1 1
+-1 -1
+45 11
+45 39
+17 11
+17 39

codeforces/920/io/a.out

@@ -0,0 +1,7 @@
+9
+4
+784
+
+[code]: 0
+[time]: 6.03485 ms
+[debug]: false

codeforces/920/io/b.in

@@ -0,0 +1,19 @@
+6
+5
+10010
+00001
+1
+1
+1
+3
+000
+111
+4
+0101
+1010
+3
+100
+101
+8
+10011001
+11111110

codeforces/920/io/b.out

@@ -0,0 +1,10 @@
+2
+0
+3
+2
+1
+4
+
+[code]: 0
+[time]: 2.50673 ms
+[debug]: false

codeforces/920/io/c.in

@@ -0,0 +1,13 @@
+6
+1 3 1 5
+3
+7 21 1 3
+4 6 10 13 17 20 26
+5 10 1 2
+1 2 3 4 5
+1 1000000000 1000000000 1000000000
+1000000000
+3 11 9 6
+6 8 10
+12 621526648 2585904 3566299
+51789 61859 71998 73401 247675 298086 606959 663464 735972 806043 806459 919683

codeforces/920/io/c.out

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

codeforces/920/io/d.in

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

codeforces/920/io/d.out

@@ -0,0 +1,13 @@
+16
+0
+12
+11
+10
+23
+15
+25
+7
+
+[code]: 0
+[time]: 2.69318 ms
+[debug]: false

codeforces/920/io/e.in

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

codeforces/920/io/e.out

@@ -0,0 +1,16 @@
+Alice
+Bob
+Draw
+Draw
+Draw
+Alice
+Draw
+Draw
+Bob
+Alice
+Alice
+Draw
+
+[code]: 0
+[time]: 2.4941 ms
+[debug]: false

codeforces/920/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/920/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/920/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/920/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
+}