#936387 (C++17) No.2577 Simple Permutation Guess

提出ソース

結果

問題	No.2577 Simple Permutation Guess
ユーザー	NyaanNyaan
提出日時	2023-12-05 00:20:07
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	QLE
実行時間	-
コード長	11,789 bytes
コンパイル時間	3,131 ms
コンパイル使用メモリ	257,276 KB
実行使用メモリ	25,580 KB
平均クエリ数	251.90
最終ジャッジ日時	2024-09-26 23:31:23
合計ジャッジ時間	15,319 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	24 ms 24,940 KB
testcase_01	AC	118 ms 24,428 KB
testcase_02	AC	45 ms 24,812 KB
testcase_03	AC	23 ms 25,196 KB
testcase_04	AC	59 ms 24,812 KB
testcase_05	AC	67 ms 25,452 KB
testcase_06	AC	147 ms 25,196 KB
testcase_07	AC	149 ms 24,428 KB
testcase_08	AC	146 ms 24,904 KB
testcase_09	AC	145 ms 24,940 KB
testcase_10	AC	143 ms 24,812 KB
testcase_11	AC	22 ms 24,428 KB
testcase_12	AC	22 ms 24,940 KB
testcase_13	AC	24 ms 24,928 KB
testcase_14	AC	23 ms 24,556 KB
testcase_15	AC	22 ms 24,940 KB
testcase_16	AC	21 ms 24,940 KB
testcase_17	AC	21 ms 24,812 KB
testcase_18	AC	23 ms 24,940 KB
testcase_19	AC	22 ms 25,196 KB
testcase_20	AC	22 ms 24,812 KB
testcase_21	AC	21 ms 24,812 KB
testcase_22	AC	21 ms 24,836 KB
testcase_23	AC	22 ms 25,076 KB
testcase_24	QLE	-
testcase_25	AC	22 ms 24,964 KB
testcase_26	AC	22 ms 24,580 KB
testcase_27	AC	22 ms 24,836 KB
testcase_28	AC	22 ms 24,836 KB
testcase_29	AC	22 ms 24,452 KB
testcase_30	AC	21 ms 24,964 KB
testcase_31	AC	22 ms 25,196 KB
testcase_32	AC	21 ms 24,428 KB
testcase_33	AC	20 ms 25,580 KB
testcase_34	AC	22 ms 24,812 KB
testcase_35	AC	22 ms 24,556 KB
testcase_36	AC	23 ms 25,196 KB
testcase_37	AC	22 ms 24,836 KB
testcase_38	AC	22 ms 24,836 KB
testcase_39	AC	21 ms 25,220 KB
testcase_40	AC	21 ms 24,452 KB
testcase_41	AC	21 ms 25,220 KB
testcase_42	AC	21 ms 24,836 KB
testcase_43	AC	21 ms 24,580 KB
testcase_44	AC	22 ms 24,836 KB
testcase_45	AC	22 ms 24,964 KB
testcase_46	AC	23 ms 24,836 KB
testcase_47	AC	23 ms 24,836 KB
testcase_48	AC	24 ms 24,964 KB
testcase_49	AC	21 ms 24,964 KB
testcase_50	AC	22 ms 24,836 KB
testcase_51	AC	23 ms 24,964 KB
testcase_52	AC	22 ms 24,836 KB
testcase_53	AC	22 ms 24,452 KB
testcase_54	AC	22 ms 24,836 KB
testcase_55	AC	22 ms 24,836 KB
testcase_56	AC	22 ms 24,964 KB
testcase_57	AC	22 ms 24,452 KB
testcase_58	AC	21 ms 25,220 KB
testcase_59	AC	22 ms 24,836 KB
testcase_60	AC	22 ms 24,964 KB
testcase_61	AC	22 ms 24,836 KB
testcase_62	AC	23 ms 24,452 KB
testcase_63	AC	24 ms 24,836 KB
testcase_64	AC	23 ms 24,580 KB
testcase_65	AC	21 ms 25,220 KB
testcase_66	AC	21 ms 24,836 KB
testcase_67	AC	22 ms 24,452 KB
testcase_68	AC	22 ms 24,452 KB
testcase_69	AC	21 ms 24,836 KB
testcase_70	AC	21 ms 24,836 KB
testcase_71	AC	22 ms 25,220 KB
testcase_72	AC	20 ms 24,964 KB
testcase_73	AC	23 ms 24,428 KB
testcase_74	AC	24 ms 24,796 KB
testcase_75	AC	24 ms 25,196 KB
testcase_76	AC	25 ms 24,556 KB
testcase_77	AC	23 ms 25,196 KB
testcase_78	AC	25 ms 24,784 KB
testcase_79	AC	24 ms 24,940 KB
testcase_80	AC	23 ms 24,812 KB
testcase_81	AC	23 ms 24,940 KB
testcase_82	AC	24 ms 24,940 KB
testcase_83	AC	24 ms 24,812 KB
testcase_84	AC	23 ms 25,196 KB
testcase_85	AC	24 ms 24,812 KB
testcase_86	AC	24 ms 25,196 KB
testcase_87	AC	24 ms 25,196 KB
testcase_88	AC	24 ms 24,940 KB
testcase_89	AC	24 ms 25,184 KB
testcase_90	AC	24 ms 25,196 KB
testcase_91	AC	24 ms 24,800 KB
testcase_92	AC	120 ms 24,812 KB
testcase_93	AC	109 ms 25,196 KB
testcase_94	AC	106 ms 24,940 KB
testcase_95	AC	139 ms 25,196 KB
testcase_96	AC	141 ms 24,812 KB
testcase_97	AC	131 ms 25,196 KB
testcase_98	AC	129 ms 24,812 KB
testcase_99	AC	137 ms 25,000 KB
testcase_100	AC	112 ms 24,428 KB
testcase_101	AC	131 ms 24,812 KB
evil_1_rnd_1.txt	AC	269 ms 24,812 KB
evil_1_rnd_2.txt	AC	257 ms 25,324 KB
evil_2_big_1.txt	AC	315 ms 25,196 KB
evil_2_big_2.txt	AC	316 ms 24,428 KB
evil_2_big_3.txt	AC	319 ms 24,812 KB
evil_3_sorted_1.txt	AC	183 ms 25,208 KB
evil_4_sorted_rev_1.txt	AC	156 ms 24,836 KB
evil_4_sorted_rev_2.txt	AC	214 ms 24,836 KB
evil_400_sorted.txt	AC	293 ms 24,824 KB
evil_400_sorted_rev.txt	AC	330 ms 25,220 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

/**
 * date   : 2023-12-05 00:20:00
 * author : Nyaan
 */

#define NDEBUG

using namespace std;

// intrinstic
#include <immintrin.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

// utility

namespace Nyaan {
using ll = long long;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;

template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
using vi = vector<int>;
using vl = vector<long long>;
using vd = V<double>;
using vs = V<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<long long>>;
template <typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;

template <typename T, typename U>
struct P : pair<T, U> {
  template <typename... Args>
  P(Args... args) : pair<T, U>(args...) {}

  using pair<T, U>::first;
  using pair<T, U>::second;

  P &operator+=(const P &r) {
    first += r.first;
    second += r.second;
    return *this;
  }
  P &operator-=(const P &r) {
    first -= r.first;
    second -= r.second;
    return *this;
  }
  P &operator*=(const P &r) {
    first *= r.first;
    second *= r.second;
    return *this;
  }
  template <typename S>
  P &operator*=(const S &r) {
    first *= r, second *= r;
    return *this;
  }
  P operator+(const P &r) const { return P(*this) += r; }
  P operator-(const P &r) const { return P(*this) -= r; }
  P operator*(const P &r) const { return P(*this) *= r; }
  template <typename S>
  P operator*(const S &r) const {
    return P(*this) *= r;
  }
  P operator-() const { return P{-first, -second}; }
};

using pl = P<ll, ll>;
using pi = P<int, int>;
using vp = V<pl>;

constexpr int inf = 1001001001;
constexpr long long infLL = 4004004004004004004LL;

template <typename T>
int sz(const T &t) {
  return t.size();
}

template <typename T, typename U>
inline bool amin(T &x, U y) {
  return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
  return (x < y) ? (x = y, true) : false;
}

template <typename T>
inline T Max(const vector<T> &v) {
  return *max_element(begin(v), end(v));
}
template <typename T>
inline T Min(const vector<T> &v) {
  return *min_element(begin(v), end(v));
}
template <typename T>
inline long long Sum(const vector<T> &v) {
  return accumulate(begin(v), end(v), 0LL);
}

template <typename T>
int lb(const vector<T> &v, const T &a) {
  return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
  return upper_bound(begin(v), end(v), a) - begin(v);
}

constexpr long long TEN(int n) {
  long long ret = 1, x = 10;
  for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1);
  return ret;
}

template <typename T, typename U>
pair<T, U> mkp(const T &t, const U &u) {
  return make_pair(t, u);
}

template <typename T>
vector<T> mkrui(const vector<T> &v, bool rev = false) {
  vector<T> ret(v.size() + 1);
  if (rev) {
    for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1];
  } else {
    for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
  }
  return ret;
};

template <typename T>
vector<T> mkuni(const vector<T> &v) {
  vector<T> ret(v);
  sort(ret.begin(), ret.end());
  ret.erase(unique(ret.begin(), ret.end()), ret.end());
  return ret;
}

template <typename F>
vector<int> mkord(int N, F f) {
  vector<int> ord(N);
  iota(begin(ord), end(ord), 0);
  sort(begin(ord), end(ord), f);
  return ord;
}

template <typename T>
vector<int> mkinv(vector<T> &v) {
  int max_val = *max_element(begin(v), end(v));
  vector<int> inv(max_val + 1, -1);
  for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;
  return inv;
}

vector<int> mkiota(int n) {
  vector<int> ret(n);
  iota(begin(ret), end(ret), 0);
  return ret;
}

template <typename T>
T mkrev(const T &v) {
  T w{v};
  reverse(begin(w), end(w));
  return w;
}

template <typename T>
bool nxp(vector<T> &v) {
  return next_permutation(begin(v), end(v));
}

// 返り値の型は入力の T に依存
// i 要素目 : [0, a[i])
template <typename T>
vector<vector<T>> product(const vector<T> &a) {
  vector<vector<T>> ret;
  vector<T> v;
  auto dfs = [&](auto rc, int i) -> void {
    if (i == (int)a.size()) {
      ret.push_back(v);
      return;
    }
    for (int j = 0; j < a[i]; j++) v.push_back(j), rc(rc, i + 1), v.pop_back();
  };
  dfs(dfs, 0);
  return ret;
}

// F : function(void(T&)), mod を取る操作
// T : 整数型のときはオーバーフローに注意する
template <typename T>
T Power(T a, long long n, const T &I, const function<void(T &)> &f) {
  T res = I;
  for (; n; f(a = a * a), n >>= 1) {
    if (n & 1) f(res = res * a);
  }
  return res;
}
// T : 整数型のときはオーバーフローに注意する
template <typename T>
T Power(T a, long long n, const T &I = T{1}) {
  return Power(a, n, I, function<void(T &)>{[](T &) -> void {}});
}

template <typename T>
T Rev(const T &v) {
  T res = v;
  reverse(begin(res), end(res));
  return res;
}

template <typename T>
vector<T> Transpose(const vector<T> &v) {
  using U = typename T::value_type;
  int H = v.size(), W = v[0].size();
  vector res(W, T(H, U{}));
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      res[j][i] = v[i][j];
    }
  }
  return res;
}

template <typename T>
vector<T> Rotate(const vector<T> &v, int clockwise = true) {
  using U = typename T::value_type;
  int H = v.size(), W = v[0].size();
  vector res(W, T(H, U{}));
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      if (clockwise) {
        res[W - 1 - j][i] = v[i][j];
      } else {
        res[j][H - 1 - i] = v[i][j];
      }
    }
  }
  return res;
}

}  // namespace Nyaan


// bit operation

namespace Nyaan {
__attribute__((target("popcnt"))) inline int popcnt(const u64 &a) {
  return _mm_popcnt_u64(a);
}
inline int lsb(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int ctz(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int msb(const u64 &a) { return a ? 63 - __builtin_clzll(a) : -1; }
template <typename T>
inline int gbit(const T &a, int i) {
  return (a >> i) & 1;
}
template <typename T>
inline void sbit(T &a, int i, bool b) {
  if (gbit(a, i) != b) a ^= T(1) << i;
}
constexpr long long PW(int n) { return 1LL << n; }
constexpr long long MSK(int n) { return (1LL << n) - 1; }
}  // namespace Nyaan


// inout

namespace Nyaan {

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

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

istream &operator>>(istream &is, __int128_t &x) {
  string S;
  is >> S;
  x = 0;
  int flag = 0;
  for (auto &c : S) {
    if (c == '-') {
      flag = true;
      continue;
    }
    x *= 10;
    x += c - '0';
  }
  if (flag) x = -x;
  return is;
}

istream &operator>>(istream &is, __uint128_t &x) {
  string S;
  is >> S;
  x = 0;
  for (auto &c : S) {
    x *= 10;
    x += c - '0';
  }
  return is;
}

ostream &operator<<(ostream &os, __int128_t x) {
  if (x == 0) return os << 0;
  if (x < 0) os << '-', x = -x;
  string S;
  while (x) S.push_back('0' + x % 10), x /= 10;
  reverse(begin(S), end(S));
  return os << S;
}
ostream &operator<<(ostream &os, __uint128_t x) {
  if (x == 0) return os << 0;
  string S;
  while (x) S.push_back('0' + x % 10), x /= 10;
  reverse(begin(S), end(S));
  return os << S;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u) {
  cin >> t;
  in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
  cout << t;
  if (sizeof...(u)) cout << sep;
  out(u...);
}

struct IoSetupNya {
  IoSetupNya() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    cerr << fixed << setprecision(7);
  }
} iosetupnya;

}  // namespace Nyaan


// debug


#ifdef NyaanDebug
#define trc(...) (void(0))
#else
#define trc(...) (void(0))
#endif

#ifdef NyaanLocal
#define trc2(...) (void(0))
#else
#define trc2(...) (void(0))
#endif


// macro

#define each(x, v) for (auto&& x : v)
#define each2(x, y, v) for (auto&& [x, y] : v)
#define all(v) (v).begin(), (v).end()
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
#define reg(i, a, b) for (long long i = (a); i < (b); i++)
#define regr(i, a, b) for (long long i = (b)-1; i >= (a); i--)
#define fi first
#define se second
#define ini(...)   \
  int __VA_ARGS__; \
  in(__VA_ARGS__)
#define inl(...)         \
  long long __VA_ARGS__; \
  in(__VA_ARGS__)
#define ins(...)      \
  string __VA_ARGS__; \
  in(__VA_ARGS__)
#define in2(s, t)                           \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i]);                         \
  }
#define in3(s, t, u)                        \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i]);                   \
  }
#define in4(s, t, u, v)                     \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i], v[i]);             \
  }
#define die(...)             \
  do {                       \
    Nyaan::out(__VA_ARGS__); \
    return;                  \
  } while (0)


namespace Nyaan {
void solve();
}
int main() { Nyaan::solve(); }


//
using namespace Nyaan;

int send(vi p) {
  each(x, p) x++;
  out("?", p);
  cout.flush();
  ini(x);
  if (x == -1) exit(0);
  return x;
}

void answer(vi p) {
  each(x, p) x++;
  out("!", p);
  exit(0);
}

void q() {
  inl(N);
  // 先頭から特定していく

  if (N <= 5) {
    vvi ps;
    {
      vi p = mkiota(N);
      do {
        ps.push_back(p);
      } while (nxp(p));
    }
    int ok = 0, ng = sz(ps);
    while (ok + 1 < ng) {
      int m = (ok + ng) / 2;
      (send(ps[m]) ? ok : ng) = m;
    }
    answer(ps[ok]);
    return;
  }

  vi unused;
  rep(i, N) unused.push_back(i);

  vi ans;
  rep(i, N - 1) {
    int ok = 0, ng = sz(unused);
    while (ok + 1 < ng) {
      int m = (ok + ng) / 2;
      vi q = ans;
      q.push_back(unused[m]);
      rep(j, sz(unused)) {
        if (j != m) q.push_back(unused[j]);
      }
      (send(q) ? ok : ng) = m;
    }
    ans.push_back(unused[ok]);
    unused.erase(begin(unused) + ok);
  }

  ans.push_back(unused[0]);
  answer(ans);
}

void Nyaan::solve() {
  int t = 1;
  // in(t);
  while (t--) q();
}

yukicoder

結果

テストケース

ソースコード