more code

codeforces/993/d.cc

@@ -0,0 +1,121 @@
+#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 dbg(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 dbg(T const &t) {
+  std::cout << t;
+}
+
+template <std::ranges::range T>
+void dbgln(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 dbgln(std::string const &str, Args &&...args) {
+  dbg(str, std::forward<Args>(args)...);
+  cout << '\n';
+}
+
+template <typename T>
+void dbgln(T const &t) {
+  dbg("{}\n", t);
+}
+
+void println() {
+  std::cout << '\n';
+}
+
+template <typename T>
+constexpr auto MIN = std::numeric_limits<T>::min();
+
+template <typename T>
+constexpr auto MAX = 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)
+
+std::random_device rd;
+std::mt19937 gen(rd());
+
+void YES() {
+  cout << "YES\n";
+}
+
+void NO() {
+  cout << "NO\n";
+}
+void solve() {
+  int n;
+  cin >> n;
+
+  int maxf = 0;
+
+  vector<int> a(n + 1), ans(n);
+  FOR(i, 0, n) {
+    int x;
+    cin >> x;
+    if (!a[x]) {
+      a[x] = 1;
+      ans[i] = x;
+    }
+  }
+
+  queue<int> q;
+  FOR(i, 1, n + 1)
+  if (!a[i])
+    q.push(i);
+  FOR(i, 0, n) {
+    if (!ans[i]) {
+      ans[i] = q.front();
+      q.pop();
+    }
+  }
+
+  FOR(i, 0, n)
+  cout << ans[i] << ' ';
+
+  cout << '\n';
+}
+
+int main() {
+  cin.tie(nullptr)->sync_with_stdio(false);
+
+  int t = 1;
+  cin >> t;
+
+  while (t--) {
+    solve();
+  }
+
+  return 0;
+}