#930707 (C++23) No.624 Santa Claus and The Last Dungeon

提出ソース

結果

問題	No.624 Santa Claus and The Last Dungeon
ユーザー	maspy
提出日時	2023-11-24 05:06:44
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	69 ms / 2,000 ms
コード長	10,718 bytes
コンパイル時間	4,649 ms
コンパイル使用メモリ	290,224 KB
実行使用メモリ	24,012 KB
平均クエリ数	413.61
最終ジャッジ日時	2023-11-24 05:06:54
合計ジャッジ時間	8,804 ms
ジャッジサーバーID （参考情報）	judge15 / judge11

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	53 ms 24,012 KB
testcase_01	AC	48 ms 24,012 KB
testcase_02	AC	46 ms 24,012 KB
testcase_03	AC	46 ms 24,012 KB
testcase_04	AC	46 ms 24,012 KB
testcase_05	AC	69 ms 24,012 KB
testcase_06	AC	47 ms 24,012 KB
testcase_07	AC	49 ms 24,012 KB
testcase_08	AC	47 ms 24,012 KB
testcase_09	AC	47 ms 24,012 KB
testcase_10	AC	47 ms 24,012 KB
testcase_11	AC	46 ms 24,012 KB
testcase_12	AC	48 ms 24,012 KB
testcase_13	AC	47 ms 24,012 KB
testcase_14	AC	46 ms 24,012 KB
testcase_15	AC	46 ms 24,012 KB
testcase_16	AC	47 ms 24,012 KB
testcase_17	AC	48 ms 24,012 KB
testcase_18	AC	48 ms 24,012 KB
testcase_19	AC	47 ms 24,012 KB
testcase_20	AC	48 ms 24,012 KB
testcase_21	AC	49 ms 24,012 KB
testcase_22	AC	48 ms 24,012 KB
testcase_23	AC	47 ms 24,012 KB
testcase_24	AC	48 ms 24,012 KB
testcase_25	AC	48 ms 24,012 KB
testcase_26	AC	47 ms 24,012 KB
testcase_27	AC	47 ms 24,012 KB
testcase_28	AC	47 ms 24,012 KB
testcase_29	AC	53 ms 24,012 KB
testcase_30	AC	47 ms 24,012 KB
testcase_31	AC	48 ms 24,012 KB
testcase_32	AC	48 ms 24,012 KB
testcase_33	AC	49 ms 24,012 KB
testcase_34	AC	48 ms 24,012 KB
testcase_35	AC	47 ms 24,012 KB

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

ソースコード

raw source code

#line 1 "/home/maspy/compro/library/my_template.hpp"
#if defined(LOCAL)
#include <my_template_compiled.hpp>
#else
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;
using u128 = unsigned __int128;
using f128 = __float128;

template <class T>
constexpr T infty = 0;
template <>
constexpr int infty<int> = 1'000'000'000;
template <>
constexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;
template <>
constexpr u32 infty<u32> = infty<int>;
template <>
constexpr u64 infty<u64> = infty<ll>;
template <>
constexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;
template <>
constexpr double infty<double> = infty<ll>;
template <>
constexpr long double infty<long double> = infty<ll>;

using pi = pair<ll, ll>;
using vi = vector<ll>;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;

#define vv(type, name, h, ...) \
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...)   \
  vector<vector<vector<type>>> name( \
      h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...)       \
  vector<vector<vector<vector<type>>>> name( \
      a, vector<vector<vector<type>>>(       \
             b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))

// https://trap.jp/post/1224/
#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define overload4(a, b, c, d, e, ...) e
#define overload3(a, b, c, d, ...) d
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)

#define FOR_subset(t, s) \
  for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define elif else if

#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second

#define stoi stoll

int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(u32 x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int popcnt(u64 x) { return __builtin_popcountll(x); }
int popcnt_mod_2(int x) { return __builtin_parity(x); }
int popcnt_mod_2(u32 x) { return __builtin_parity(x); }
int popcnt_mod_2(ll x) { return __builtin_parityll(x); }
int popcnt_mod_2(u64 x) { return __builtin_parityll(x); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)
int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }

template <typename T>
T floor(T a, T b) {
  return a / b - (a % b && (a ^ b) < 0);
}
template <typename T>
T ceil(T x, T y) {
  return floor(x + y - 1, y);
}
template <typename T>
T bmod(T x, T y) {
  return x - y * floor(x, y);
}
template <typename T>
pair<T, T> divmod(T x, T y) {
  T q = floor(x, y);
  return {q, x - q * y};
}

template <typename T, typename U>
T SUM(const vector<U> &A) {
  T sm = 0;
  for (auto &&a: A) sm += a;
  return sm;
}

#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) \
  sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()

template <typename T>
T POP(deque<T> &que) {
  T a = que.front();
  que.pop_front();
  return a;
}
template <typename T>
T POP(pq<T> &que) {
  T a = que.top();
  que.pop();
  return a;
}
template <typename T>
T POP(pqg<T> &que) {
  T a = que.top();
  que.pop();
  return a;
}
template <typename T>
T POP(vc<T> &que) {
  T a = que.back();
  que.pop_back();
  return a;
}

template <typename F>
ll binary_search(F check, ll ok, ll ng, bool check_ok = true) {
  if (check_ok) assert(check(ok));
  while (abs(ok - ng) > 1) {
    auto x = (ng + ok) / 2;
    (check(x) ? ok : ng) = x;
  }
  return ok;
}
template <typename F>
double binary_search_real(F check, double ok, double ng, int iter = 100) {
  FOR(iter) {
    double x = (ok + ng) / 2;
    (check(x) ? ok : ng) = x;
  }
  return (ok + ng) / 2;
}

template <class T, class S>
inline bool chmax(T &a, const S &b) {
  return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
  return (a > b ? a = b, 1 : 0);
}

// ? は -1
vc<int> s_to_vi(const string &S, char first_char) {
  vc<int> A(S.size());
  FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }
  return A;
}

template <typename T, typename U>
vector<T> cumsum(vector<U> &A, int off = 1) {
  int N = A.size();
  vector<T> B(N + 1);
  FOR(i, N) { B[i + 1] = B[i] + A[i]; }
  if (off == 0) B.erase(B.begin());
  return B;
}

// stable sort
template <typename T>
vector<int> argsort(const vector<T> &A) {
  vector<int> ids(len(A));
  iota(all(ids), 0);
  sort(all(ids),
       [&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });
  return ids;
}

// A[I[0]], A[I[1]], ...
template <typename T>
vc<T> rearrange(const vc<T> &A, const vc<int> &I) {
  vc<T> B(len(I));
  FOR(i, len(I)) B[i] = A[I[i]];
  return B;
}
#endif
#line 1 "/home/maspy/compro/library/other/io2.hpp"
#define INT(...) \
  int __VA_ARGS__; \
  IN(__VA_ARGS__)
#define LL(...) \
  ll __VA_ARGS__; \
  IN(__VA_ARGS__)
#define STR(...) \
  string __VA_ARGS__; \
  IN(__VA_ARGS__)
#define CHR(...) \
  char __VA_ARGS__; \
  IN(__VA_ARGS__)
#define DBL(...) \
  long double __VA_ARGS__; \
  IN(__VA_ARGS__)

#define VEC(type, name, size) \
  vector<type> name(size);    \
  read(name)
#define VV(type, name, h, w)                     \
  vector<vector<type>> name(h, vector<type>(w)); \
  read(name)

void read(int &a) { cin >> a; }
void read(long long &a) { cin >> a; }
void read(char &a) { cin >> a; }
void read(double &a) { cin >> a; }
void read(long double &a) { cin >> a; }
void read(string &a) { cin >> a; }
template <class T, class S> void read(pair<T, S> &p) { read(p.first), read(p.second); }
template <class T> void read(vector<T> &a) {for(auto &i : a) read(i);}
template <class T> void read(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {
  read(head);
  IN(tail...);
}

template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& A) {
  os << A.fi << " " << A.se;
  return os;
}

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& A) {
  for (size_t i = 0; i < A.size(); i++) {
    if(i) os << " ";
    os << A[i];
  }
  return os;
}

void print() {
  cout << "\n";
  cout.flush();
}

template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
  cout << head;
  if (sizeof...(Tail)) cout << " ";
  print(forward<Tail>(tail)...);
}

void YES(bool t = 1) { print(t ? "YES" : "NO"); }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { print(t ? "Yes" : "No"); }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { print(t ? "yes" : "no"); }
void no(bool t = 1) { yes(!t); }
#line 3 "main.cpp"

#line 2 "/home/maspy/compro/library/random/base.hpp"

u64 RNG_64() {
  static uint64_t x_
      = uint64_t(chrono::duration_cast<chrono::nanoseconds>(
                     chrono::high_resolution_clock::now().time_since_epoch())
                     .count())
        * 10150724397891781847ULL;
  x_ ^= x_ << 7;
  return x_ ^= x_ >> 9;
}

u64 RNG(u64 lim) { return RNG_64() % lim; }

ll RNG(ll l, ll r) { return l + RNG_64() % (r - l); }
#line 2 "/home/maspy/compro/library/random/shuffle.hpp"

template <typename T>
void shuffle(vc<T>& A) {
  FOR(i, len(A)) swap(A[i], A[RNG(0, i + 1)]);
}
#line 6 "main.cpp"

string S[100];

void solve() {
  INT(Q);
  FOR(x, 100) {
    string s = to_string(x);
    while (len(s) < 2) s = "0" + s;
    S[x] = s;
  }

  int QLE = 0;

#if defined(LOCAL)
  vc<string> god(100);
  FOR(i, 100) god[i] = S[i];
  shuffle(god);
  print("god", god);
#endif

  auto ask = [&](vc<string> X) -> int {
    ++QLE;
#if defined(LOCAL)
    int a = 0, b = 0, c = 0;
    FOR(i, 100) {
      int x = 0;
      x += (X[i][0] == god[i][0]);
      x += (X[i][1] == god[i][1]);
      if (x == 0) ++a;
      if (x == 1) ++b;
      if (x == 2) ++c;
    }
    return c;
#else
    print(X);
    INT(a, b, c);
    return c;
#endif
  };

  vc<string> ANS(100, "??");

  auto split = [&](vc<int> I) -> pair<vc<int>, vc<int>> {
    vc<int> A, B;
    FOR(k, len(I)) { (k % 2 == 0 ? A : B).eb(I[k]); }
    return {A, B};
  };

  auto solve_two = [&](int a, int b, vc<int> I) -> pair<int, int> {
    vc<int> I1 = I, I2 = I;
    while (1) {
      if (len(I1) == 1 && len(I2) == 1) { break; }
      auto [A, B] = split(I1);
      auto [C, D] = split(I2);
      vc<string> ASK(100, "??");
      for (auto& i: A) ASK[i] = S[a];
      for (auto& i: D) ASK[i] = S[b];
      int x = ask(ASK);
      if (x == 0) {
        I1 = B, I2 = C;
        continue;
      }
      elif (x == 2) {
        I1 = A, I2 = D;
        continue;
      }
      assert(x == 1);
      fill(all(ASK), "??");
      for (auto& i: A) ASK[i] = S[a];
      x = ask(ASK);
      if (x == 0) {
        I1 = B, I2 = D;
      } else {
        I1 = A, I2 = C;
      }
    }
    return {POP(I1), POP(I2)};
  };

  vc<int> I(100);
  FOR(i, 100) I[i] = i;
  shuffle(I);

  FOR(k, 50) {
    int a = 2 * k + 0, b = 2 * k + 1;
    auto [ia, ib] = solve_two(a, b, I);
    ANS[ia] = S[a];
    ANS[ib] = S[b];
    vc<int> J;
    for (auto& i: I) {
      if (i == ia || i == ib) continue;
      J.eb(i);
    }
    swap(I, J);
  }
  // print(QLE);
  // Yes(ANS == god);
  print(ANS);
}

signed main() {
  int T = 1;
  // INT(T);
  FOR(T) solve();
  return 0;
}

yukicoder

結果

テストケース

ソースコード