more code

leetcode/.clang-format

@@ -0,0 +1,2 @@
+BasedOnStyle: Google
+AllowShortFunctionsOnASingleLine: Empty

leetcode/a.cc

@@ -0,0 +1,268 @@
+#include <bits/stdc++.h>
+
+// https://codeforces.com/blog/entry/96344
+
+#pragma GCC optimize("O2,unroll-loops")
+#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
+
+using namespace std;
+
+template <typename... Args>
+void print(std::string const &str, Args &&...args) {
+  std::cout << std::vformat(
+      str,
+      // make_format_args binds arguments to const
+      std::make_format_args(static_cast<Args const &>(args)...));
+}
+
+template <typename T>
+void print(T const &t) {
+  std::cout << t;
+}
+
+template <std::ranges::range T>
+void print(T const &t) {
+  if constexpr (std::is_convertible_v<T, char const *>) {
+    std::cout << t;
+  } else {
+    for (auto const &e : t) {
+      std::cout << e << ' ';
+    }
+  }
+}
+
+template <typename... Args>
+void println(std::string const &str, Args &&...args) {
+  print(str, std::forward<Args>(args)...);
+  cout << '\n';
+}
+
+void println() {
+  std::cout << '\n';
+}
+
+template <typename T>
+void println(T const &t) {
+  print(t);
+  println();
+}
+
+template <std::ranges::range T>
+void println(T const &t) {
+  print(t);
+  println();
+}
+
+template <typename T>
+T MAX() {
+  return std::numeric_limits<T>::max();
+}
+
+template <typename T>
+T MIN() {
+  return std::numeric_limits<T>::min();
+}
+
+#define ff first
+#define ss second
+#define eb emplace_back
+#define ll long long
+#define ld long double
+#define vec vector
+
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (r).rbegin(), (x).rend()
+#define sz(x) static_cast<int>((x).size())
+#define FOR(a, b, c) for (int a = b; a < c; ++a)
+
+mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
+#define randint(a, b) uniform_int_distribution(a, b)(rng)
+
+void YES() {
+  cout << "YES\n";
+}
+void NO() {
+  cout << "NO\n";
+}
+
+#ifdef LOCAL
+#define dbg(x) cout << __LINE__ << ": " << #x << "=<" << (x) << ">\n";
+#else
+#define dbg(x)
+#endif
+
+static constexpr int MOD = 1e9 + 7;
+
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+
+using namespace __gnu_pbds;
+
+// https://mirror.codeforces.com/blog/entry/124683
+
+namespace hashing {
+using i64 = std::int64_t;
+using u64 = std::uint64_t;
+static const u64 FIXED_RANDOM =
+    std::chrono::steady_clock::now().time_since_epoch().count();
+
+#if USE_AES
+std::mt19937 rd(FIXED_RANDOM);
+const __m128i KEY1{(i64)rd(), (i64)rd()};
+const __m128i KEY2{(i64)rd(), (i64)rd()};
+#endif
+
+template <class T, class D = void>
+struct custom_hash {};
+
+template <class T>
+inline void hash_combine(u64 &seed, T const &v) {
+  custom_hash<T> hasher;
+  seed ^= hasher(v) + 0x9e3779b97f4a7c15 + (seed << 12) + (seed >> 4);
+};
+
+template <class T>
+struct custom_hash<T,
+                   typename std::enable_if<std::is_integral<T>::value>::type> {
+  u64 operator()(T _x) const {
+    u64 x = _x;
+#if USE_AES
+    __m128i m{i64(u64(x) * 0xbf58476d1ce4e5b9u64), (i64)FIXED_RANDOM};
+    __m128i y = _mm_aesenc_si128(m, KEY1);
+    __m128i z = _mm_aesenc_si128(y, KEY2);
+    return z[0];
+#else
+    x += 0x9e3779b97f4a7c15 + FIXED_RANDOM;
+    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
+    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
+    return x ^ (x >> 31);
+#endif
+  }
+};
+
+template <class T>
+struct custom_hash<T, std::void_t<decltype(std::begin(std::declval<T>()))>> {
+  u64 operator()(T const &a) const {
+    u64 value = FIXED_RANDOM;
+    for (auto &x : a) hash_combine(value, x);
+    return value;
+  }
+};
+
+template <class... T>
+struct custom_hash<std::tuple<T...>> {
+  u64 operator()(const std::tuple<T...> &a) const {
+    u64 value = FIXED_RANDOM;
+    std::apply([&value](T const &...args) { (hash_combine(value, args), ...); },
+               a);
+    return value;
+  }
+};
+
+template <class T, class U>
+struct custom_hash<std::pair<T, U>> {
+  u64 operator()(std::pair<T, U> const &a) const {
+    u64 value = FIXED_RANDOM;
+    hash_combine(value, a.first);
+    hash_combine(value, a.second);
+    return value;
+  }
+};
+};  // namespace hashing
+
+#ifdef PB_DS_ASSOC_CNTNR_HPP
+template <class Key, class Value>
+using hashmap = gp_hash_table<
+    Key, Value, hashing::custom_hash<Key>, std::equal_to<Key>,
+    direct_mask_range_hashing<>, linear_probe_fn<>,
+    hash_standard_resize_policy<hash_exponential_size_policy<>,
+                                hash_load_check_resize_trigger<>, true>>;
+template <class Key>
+using hashset = gp_hash_table<
+    Key, null_type, hashing::custom_hash<Key>, std::equal_to<Key>,
+    direct_mask_range_hashing<>, linear_probe_fn<>,
+    hash_standard_resize_policy<hash_exponential_size_policy<>,
+                                hash_load_check_resize_trigger<>, true>>;
+
+#endif
+#ifdef PB_DS_TREE_POLICY_HPP
+template <typename T>
+using multiset = tree<T, null_type, std::less_equal<T>, rb_tree_tag,
+                      tree_order_statistics_node_update>;
+template <class Key, class Value = null_type>
+using rbtree = tree<Key, Value, std::less<Key>, rb_tree_tag,
+                    tree_order_statistics_node_update>;
+#endif
+
+const vec<pair<int, int>> dirs = {{-1, 0}, {0, -1}, {1, 0}, {0, 1}};
+
+constexpr int RIGHT = 1, LEFT = 2, DOWN = 3, UP = 4;
+
+void solve() {
+  int m, n;
+  cin >> m >> n;
+
+  vec<vec<int>> grid(m, vec<int>(n, 0));
+
+  for (auto &row : grid) {
+    for (auto &cell : row) {
+      cin >> cell;
+    }
+  }
+
+  deque<tuple<int, int, int>> q{{0, 0, 0}};
+
+  hashset<pair<int, int>> seen;
+
+  while (!q.empty()) {
+    auto [r, c, w] = q.front();
+    q.pop_front();
+
+    println("at r={}, c={}, w={}", r, c, w);
+
+    if (min(r, c) < 0 || r == m || c == n) continue;
+
+    if (r == m - 1 && c == n - 1) {
+      println(w);
+      return;
+    }
+
+    if (seen.find({r, c}) != seen.end()) continue;
+
+    seen.insert({r, c});
+
+    switch (grid[r][c]) {
+      case UP:
+        q.emplace_front(r - 1, c, w);
+        break;
+      case LEFT:
+        q.emplace_front(r, c - 1, w);
+        break;
+      case DOWN:
+        q.emplace_front(r + 1, c, w);
+        break;
+      case RIGHT:
+        q.emplace_front(r, c + 1, w);
+        break;
+    }
+
+    for (auto &[dr, dc] : dirs) {
+      int nr = r + dr, nc = c + dc;
+
+      q.emplace_back(nr, nc, w + 1);
+    }
+  }
+}
+
+int main() {
+  cin.tie(nullptr)->sync_with_stdio(false);
+
+  int t = 1;
+  cin >> t;
+
+  while (t--) {
+    solve();
+  }
+
+  return 0;
+}

leetcode/a.in

@@ -0,0 +1,7 @@
+3
+4 4
+1 1 1 1 2 2 2 2 1 1 1 1 2 2 2 2
+3 3
+1 1 3 3 2 2 1 1 4
+2 2
+1 2 4 3

leetcode/a.out

@@ -0,0 +1,81 @@
+at r=0, c=0, w=0
+at r=0, c=1, w=0
+at r=0, c=2, w=0
+at r=0, c=3, w=0
+at r=0, c=4, w=0
+at r=-1, c=1, w=1
+at r=0, c=0, w=1
+at r=1, c=1, w=1
+at r=1, c=0, w=1
+at r=1, c=-1, w=1
+at r=0, c=2, w=1
+at r=-1, c=2, w=1
+at r=0, c=1, w=1
+at r=1, c=2, w=1
+at r=1, c=1, w=1
+at r=0, c=3, w=1
+at r=-1, c=3, w=1
+at r=0, c=2, w=1
+at r=1, c=3, w=1
+at r=1, c=2, w=1
+at r=0, c=4, w=1
+at r=-1, c=4, w=1
+at r=0, c=3, w=1
+at r=1, c=4, w=1
+at r=0, c=5, w=1
+at r=0, c=0, w=2
+at r=1, c=-1, w=2
+at r=2, c=0, w=2
+at r=2, c=1, w=2
+at r=2, c=2, w=2
+at r=2, c=3, w=2
+at r=2, c=4, w=2
+at r=1, c=1, w=2
+at r=0, c=-1, w=2
+at r=1, c=-2, w=2
+at r=2, c=-1, w=2
+at r=1, c=0, w=2
+at r=0, c=1, w=2
+at r=1, c=0, w=2
+at r=2, c=1, w=2
+at r=1, c=2, w=2
+at r=0, c=2, w=2
+at r=1, c=1, w=2
+at r=2, c=2, w=2
+at r=1, c=3, w=2
+at r=-1, c=5, w=2
+at r=0, c=4, w=2
+at r=1, c=5, w=2
+at r=0, c=6, w=2
+at r=1, c=1, w=3
+at r=2, c=0, w=3
+at r=3, c=1, w=3
+at r=3, c=0, w=3
+at r=3, c=-1, w=3
+at r=2, c=2, w=3
+at r=1, c=2, w=3
+at r=2, c=1, w=3
+at r=3, c=2, w=3
+at r=3, c=1, w=3
+at r=2, c=3, w=3
+at r=1, c=3, w=3
+at r=2, c=2, w=3
+at r=3, c=3, w=3
+3
+at r=0, c=0, w=0
+at r=0, c=1, w=0
+at r=0, c=2, w=0
+at r=1, c=2, w=0
+at r=1, c=1, w=0
+at r=1, c=0, w=0
+at r=2, c=0, w=0
+at r=2, c=1, w=0
+at r=2, c=2, w=0
+0
+at r=0, c=0, w=0
+at r=0, c=1, w=0
+at r=0, c=0, w=0
+at r=-1, c=1, w=1
+at r=0, c=0, w=1
+at r=1, c=1, w=1
+1

leetcode/b.cc

@@ -0,0 +1,110 @@
+#include <bits/stdc++.h>
+
+// https://codeforces.com/blog/entry/96344
+
+#pragma GCC optimize("O2,unroll-loops")
+#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
+
+using namespace std;
+
+template <typename... Args>
+void print(std::string const &str, Args &&...args) {
+  std::cout << std::vformat(
+      str,
+      // make_format_args binds arguments to const
+      str, std::make_format_args(static_cast<Args const &>(args)...));
+}
+
+template <typename T>
+void print(T const &t) {
+  std::cout << t;
+}
+
+template <std::ranges::range T>
+void print(T const &t) {
+  if constexpr (std::is_convertible_v<T, char const *>) {
+    std::cout << t << '\n';
+  } else {
+    for (auto const &e : t) {
+      std::cout << e << ' ';
+    }
+    std::cout << '\n';
+  }
+}
+
+template <typename... Args>
+void println(std::string const &str, Args &&...args) {
+  print(str, std::forward<Args>(args)...);
+  cout << '\n';
+}
+
+template <typename T>
+void println(T const &t) {
+  print("{}\n", t);
+}
+
+template <std::ranges::range T>
+void println(T const &t) {
+  cout << t << '\n';
+}
+
+void println() {
+  std::cout << '\n';
+}
+
+template <typename T>
+T MAX() {
+  return std::numeric_limits<T>::max();
+}
+
+template <typename T>
+T MIN() {
+  return std::numeric_limits<T>::min();
+}
+
+#define ff first
+#define ss second
+#define eb emplace_back
+#define ll long long
+#define ld long double
+#define vec vector
+
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (r).rbegin(), (x).rend()
+#define sz(x) static_cast<int>((x).size())
+#define FOR(a, b, c) for (int a = b; a < c; ++a)
+
+mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
+#define randint(a, b) uniform_int_distribution(a, b)(rng)
+
+void YES() {
+  cout << "YES\n";
+}
+void NO() {
+  cout << "NO\n";
+}
+
+#ifdef LOCAL
+#define dbg(x) cout << __LINE__ << ": " << #x << "=<" << (x) << ">\n";
+#else
+#define dbg(x)
+#endif
+
+static constexpr int MOD = 1e9 + 7;
+
+void solve() {
+  
+}
+
+int main() {
+  cin.tie(nullptr)->sync_with_stdio(false);
+
+  int t = 1;
+  cin >> t;
+
+  while (t--) {
+      solve();
+  }
+
+  return 0;
+}

leetcode/compile_flags.txt

@@ -0,0 +1,5 @@
+-std=c++20
+-Wall
+-Wextra
+-Wshadow
+-DLOCAL