結果

問題 No.1793 実数当てゲーム
ユーザー hitonanodehitonanode
提出日時 2021-12-22 01:35:10
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,344 ms / 2,000 ms
コード長 6,256 bytes
コンパイル時間 6,990 ms
コンパイル使用メモリ 363,380 KB
実行使用メモリ 25,220 KB
平均クエリ数 2230.56
最終ジャッジ日時 2024-09-28 13:31:56
合計ジャッジ時間 29,811 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
25,220 KB
testcase_01 AC 76 ms
25,220 KB
testcase_02 AC 1,321 ms
24,580 KB
testcase_03 AC 1,330 ms
24,836 KB
testcase_04 AC 1,320 ms
24,836 KB
testcase_05 AC 1,226 ms
24,836 KB
testcase_06 AC 1,257 ms
25,220 KB
testcase_07 AC 1,307 ms
24,836 KB
testcase_08 AC 1,318 ms
24,836 KB
testcase_09 AC 1,313 ms
24,568 KB
testcase_10 AC 1,313 ms
24,580 KB
testcase_11 AC 1,314 ms
24,836 KB
testcase_12 AC 1,328 ms
25,220 KB
testcase_13 AC 1,335 ms
24,580 KB
testcase_14 AC 1,344 ms
25,092 KB
testcase_15 AC 1,328 ms
25,220 KB
testcase_16 AC 1,342 ms
24,964 KB
testcase_17 AC 1,317 ms
24,580 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr)
#else
#define dbg(x) (x)
#define dbgif(cond, x) 0
#endif

#include <boost/multiprecision/cpp_dec_float.hpp>
namespace mp = boost::multiprecision;
typedef mp::number<mp::cpp_dec_float<200>> cpp_dec_float_1000;

// using Float = mp::cpp_dec_float_100;
using Float = cpp_dec_float_1000;

template <class T>
bool ask(T y) {
    cout << "? " << y  - 1e-10 << endl;
    string ret;
    cin >> ret;
    if (ret == "-1") exit(0);

    if (ret == "1") return true;
    if (ret == "2") return false;

    return !(ret == "Yes");
}

template <class T>
void answer(T x) {
    cout << "! " << fixed << setprecision(5) << x << fixed << setprecision(10) << endl;
}

const Float digitize = 200000;
const Float b = 1.0000105;

Float conv(Float c) {
    if (c < 0) return 1.0 + c / digitize;
    return mp::pow(b, c);
};

void solve() {
    Float HI = 12.22;
    REP(t, 74) HI *= 10;
    int l = -int(llround(digitize)), r = int(llround(mp::log10(HI) / mp::log10(b)));
    dbg(l);
    dbg(r);
    dbg(r - l);

    REP(t, 24) {
        auto c = (l + r) / 2;
        (ask(conv(c)) ? r : l) = c;
    }
    dbg(r - l);
    answer(conv(Float(l + r) / 2));
}

int main() {
    cout << fixed << setprecision(10);
    int T;
    cin >> T;
    while (T--) solve();
}
0