#1105184 (C++23) No.3204 Permuted Integer

• 問題: No.3204 Permuted Integer
• ユーザー: lmorinn
• 提出日時: 2025-07-17 19:22:56
• 言語: C++23 (gcc 13.3.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 116 ms / 2,000 ms
• コード長: 3,792 bytes
• コンパイル時間: 3,363 ms
• コンパイル使用メモリ: 291,236 KB
• 実行使用メモリ: 7,720 KB
• 最終ジャッジ日時: 2025-07-18 23:34:33
• 合計ジャッジ時間: 5,845 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
sample	AC * 1
other	AC * 26

ソースコード

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using ull = unsigned long long;
using ld = long double;
using int128 = __int128_t;
#define all(x) (x).begin(), (x).end()
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define logfixed(x) cout << fixed << setprecision(10) << x << '\n';
#define logy(bool)   \
  if (bool) {        \
    cout << "Yes\n"; \
  } else {           \
    cout << "No\n";  \
  }

ostream &operator<<(ostream &dest, __int128_t value) {
  ostream::sentry s(dest);
  if (s) {
    __uint128_t tmp = value < 0 ? -value : value;
    char buffer[128];
    char *d = end(buffer);
    do {
      --d;
      *d = "0123456789"[tmp % 10];
      tmp /= 10;
    } while (tmp != 0);
    if (value < 0) {
      --d;
      *d = '-';
    }
    int len = end(buffer) - d;
    if (dest.rdbuf()->sputn(d, len) != len) {
      dest.setstate(ios_base::badbit);
    }
  }
  return dest;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != (int)v.size() ? " " : "");
  }
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, const set<T> &set_var) {
  for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end()) os << " ";
    itr--;
  }
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &map_var) {
  for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
    os << itr->first << " -> " << itr->second << "\n";
  }
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const unordered_map<T, U> &map_var) {
  for (const auto p : map_var) {
    os << p.first << " -> " << p.second << "\n";
  }
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &pair_var) {
  os << "(" << pair_var.first << ", " << pair_var.second << ")";
  return os;
}

void out() { cout << '\n'; }
template <class T, class... Ts>
void out(const T &a, const Ts &...b) {
  cout << a;
  (cout << ... << (cout << ' ', b));
  cout << '\n';
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

inline void in(void) { return; }
template <typename First, typename... Rest>
void in(First &first, Rest &...rest) {
  cin >> first;
  in(rest...);
  return;
}

template <typename T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

vector<lint> dx8 = {1, 1, 0, -1, -1, -1, 0, 1};
vector<lint> dy8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<lint> dx4 = {1, 0, -1, 0};
vector<lint> dy4 = {0, 1, 0, -1};

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int t;
  in(t);
  map<vector<int>, int> sq;

  for (lint i = 1; i < 1e9; i++) {
    if (i * i > lint(1e9)) break;
    vector<int> d(10, 0);
    int x = i * i;
    int cp = x;
    while (x > 0) {
      d[x % 10]++;
      x /= 10;
    }

    if (sq.contains(d)) {
      chmin(sq[d], cp);
    } else {
      sq[d] = cp;
    }
  }

  rep(z, t) {
    int n;
    in(n);
    int zero = 0;
    vector<int> d(10, 0);
    while (n > 0) {
      d[n % 10]++;
      n /= 10;
    }
    zero = d[0];
    d[0] = 0;
    int res = INT_MAX;
    rep(i, zero + 1) {
      d[0] = i;
      if (sq.contains(d)) {
        chmin(res, sq[d]);
      }
    }

    if (res == INT_MAX) {
      out(-1);
    } else {
      out(res);
    }
  }
}