結果
問題 | No.2848 Birthday Hit and Blow |
ユーザー | maspy |
提出日時 | 2024-08-23 22:07:36 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 340 ms / 2,000 ms |
コード長 | 11,436 bytes |
コンパイル時間 | 5,113 ms |
コンパイル使用メモリ | 298,068 KB |
実行使用メモリ | 152,092 KB |
平均クエリ数 | 508.50 |
最終ジャッジ日時 | 2024-08-23 22:07:43 |
合計ジャッジ時間 | 6,387 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 28 ms
25,196 KB |
testcase_01 | AC | 340 ms
152,092 KB |
ソースコード
#line 1 "main.cpp" #line 1 "library/my_template.hpp" #if defined(LOCAL) #include <my_template_compiled.hpp> #else // https://codeforces.com/blog/entry/96344 #pragma GCC optimize("Ofast,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 "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 2 "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 "library/random/shuffle.hpp" template <typename T> void shuffle(vc<T> &A) { FOR(i, len(A)) { int j = RNG(0, i + 1); if (i != j) swap(A[i], A[j]); } } #line 4 "main.cpp" #line 1 "/home/maspy/compro/library/enumerate/product.hpp" // [0, A0) x [0, A1) x ... template <typename F> void enumerate_product(vc<int> A, F query) { int N = len(A); auto dfs = [&](auto& dfs, vc<int>& p) -> void { int n = len(p); if (n == N) return query(p); FOR(x, A[n]) { p.eb(x); dfs(dfs, p); p.pop_back(); } }; vc<int> p; dfs(dfs, p); } #line 326 "main.cpp" string god; int QLE; pair<int, int> f(string a, string b) { int x = 0; FOR(i, 4) x += (a[i] == b[i]); vc<int> ca(10), cb(10); for (auto &x: a) ca[x - '0']++; for (auto &x: b) cb[x - '0']++; int y = 0; FOR(i, 10) y += min(ca[i], cb[i]); y -= x; return {x, y}; } void rec(vc<string> cand) { if (len(cand) == 1) { print("!", cand[0]); #if defined(LOCAL) print("QLE=", QLE); assert(QLE <= 6); return; #endif LL(a); assert(a != -1); return; } // ask -> worst case auto eval = [&](string S) -> int { vc<int> cnt(100); for (auto &x: cand) { auto [a, b] = f(S, x); cnt[10 * a + b]++; } return MAX(cnt); }; int mi = infty<int>; string ask; static vc<string> QUES; FOR(a, 10) FOR(b, 10) FOR(c, 10) FOR(d, 10) { if (a == b) continue; if (a == c) continue; if (a == d) continue; if (b == c) continue; if (b == d) continue; if (c == d) continue; string s; s += to_string(a); s += to_string(b); s += to_string(c); s += to_string(d); QUES.eb(s); } if (QLE == 0) { ask = "0123"; } elif (QLE == 1) { ask = "4567"; } elif (QLE == 2) { ask = "1089"; } else { vc<int> S; for (auto &x: cand) { FOR(i, 4) S.eb(x[i] - '0'); } UNIQUE(S); ll n = len(S); vc<int> used(10); for (auto &x: S) used[x] = 1; FOR(x, 10) { if (len(S) < 4 && !used[x]) S.eb(x); } UNIQUE(S); FOR(s, 1 << len(S)) { if (popcnt(s) != 4) continue; vc<int> SS; FOR(i, len(S)) if (s >> i & 1) SS.eb(S[i]); do { string s; FOR(i, 4) s += '0' + SS[i]; int x = eval(s); if (chmin(mi, x)) ask = s; } while (next_permutation(all(SS))); } } ++QLE; print("?", ask); #if defined(LOCAL) int a, b; tie(a, b) = f(ask, god); #else INT(a, b); #endif assert(a != -1); vc<string> nxt; for (auto &x: cand) { auto [c, d] = f(ask, x); if (a == c && b == d) nxt.eb(x); } rec(nxt); } void solve() { QLE = 0; vc<string> cand; FOR(x, 1, 13) { FOR(y, 1, 32) { string L = to_string(x); string R = to_string(y); while (len(L) < 2) L = "0" + L; while (len(R) < 2) R = "0" + R; string S = L + R; cand.eb(S); } } #if defined(LOCAL) int k = RNG(0, len(cand)); god = cand[k]; #endif rec(cand); } signed main() { INT(T); FOR(T) solve(); }