more code

codeforces/640/g.cc

@@ -0,0 +1,174 @@
+#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(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 n;
+  cin >> n;
+
+  /*
+
+     1, 4, 2, 5, 3, 6, 9, 7, 10, 8
+
+1: 5, 7, 3, 6 -> pop -> 2, -4, 3
+2: 5, 7, 3, 6, 8
+3: 3, 7, 9, 6, 8 -> +4, +2, -3, +2
+4: 3, -2, 3, -2
+
+     1, 4, 2, 5, 3, 7, 9, 6, 8
+
+     n = 4 -> 2 4 1 3
+
+
+     +1, +3, -2, +3, -2, +3, +3, -2, +3, -2
+
+   */
+
+  if (n < 4) {
+    println(-1);
+    return;
+  }
+
+  if (n == 4) {
+    println("2 4 1 3");
+    return;
+  }
+
+  vec<int> ans{1};
+  int prev = 1;
+  --n;
+  while (n >= 5) {
+    for (auto diff : {3, -2, 3, -2, 3}) {
+      prev += diff;
+      ans.push_back(prev);
+    }
+    n -= 5;
+  }
+
+  vec<int> diff;
+  switch (n) {
+    case 1:
+      ans.pop_back();
+      ans.pop_back();
+      diff = {2, -4, 3};
+      break;
+    case 2:
+      ans.pop_back();
+      ans.pop_back();
+      diff = {2, -4, 3, 2};
+      break;
+    case 3:
+      ans.pop_back();
+      diff = {4, 2, -3, 2};
+      break;
+    case 4:
+      diff = {3, -2, 3, -2};
+      break;
+  }
+  for (auto d : diff) ans.push_back(ans[sz(ans) - 1] + d);
+
+  for (auto e : ans) cout << e << ' ';
+  println();
+}
+
+int main() {
+  cin.tie(nullptr)->sync_with_stdio(false);
+
+  int t = 1;
+  cin >> t;
+
+  while (t--) {
+    solve();
+  }
+
+  return 0;
+}