#537226 (C++17) No.1187 皇帝ペンギン

提出ソース

結果

問題	No.1187 皇帝ペンギン
ユーザー	haruki_K
提出日時	2020-08-22 14:09:11
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA (最新) AC (最初)
実行時間	-
コード長	5,022 bytes
コンパイル時間	2,276 ms
コンパイル使用メモリ	202,172 KB
実行使用メモリ	25,452 KB
平均クエリ数	20.57
最終ジャッジ日時	2024-07-17 06:16:01
合計ジャッジ時間	6,420 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	27 ms 25,196 KB
testcase_01	AC	24 ms 24,556 KB
testcase_02	AC	25 ms 24,812 KB
testcase_03	AC	25 ms 25,196 KB
testcase_04	AC	25 ms 24,556 KB
testcase_05	AC	24 ms 24,556 KB
testcase_06	AC	25 ms 24,556 KB
testcase_07	AC	25 ms 24,556 KB
testcase_08	AC	25 ms 24,556 KB
testcase_09	AC	25 ms 25,196 KB
testcase_10	AC	25 ms 24,556 KB
testcase_11	AC	24 ms 24,580 KB
testcase_12	AC	25 ms 25,068 KB
testcase_13	AC	24 ms 25,196 KB
testcase_14	AC	24 ms 25,196 KB
testcase_15	AC	27 ms 25,452 KB
testcase_16	AC	26 ms 25,040 KB
testcase_17	AC	25 ms 25,184 KB
testcase_18	AC	25 ms 24,940 KB
testcase_19	AC	25 ms 24,556 KB
testcase_20	AC	25 ms 24,812 KB
testcase_21	AC	25 ms 25,196 KB
testcase_22	AC	24 ms 25,196 KB
testcase_23	AC	25 ms 25,196 KB
testcase_24	AC	25 ms 24,812 KB
testcase_25	AC	25 ms 24,556 KB
testcase_26	AC	25 ms 24,812 KB
testcase_27	AC	25 ms 24,812 KB
testcase_28	AC	24 ms 25,196 KB
testcase_29	AC	25 ms 24,940 KB
testcase_30	AC	24 ms 25,196 KB
testcase_31	AC	25 ms 24,812 KB
testcase_32	AC	25 ms 24,568 KB
testcase_33	AC	24 ms 24,824 KB
testcase_34	AC	25 ms 24,824 KB
testcase_35	AC	25 ms 24,568 KB
testcase_36	AC	25 ms 24,952 KB
testcase_37	AC	25 ms 25,208 KB
testcase_38	AC	25 ms 25,208 KB
testcase_39	AC	26 ms 24,824 KB
testcase_40	AC	24 ms 24,824 KB
testcase_41	AC	25 ms 25,208 KB
testcase_42	AC	24 ms 24,836 KB
testcase_43	AC	25 ms 24,836 KB
testcase_44	AC	24 ms 24,580 KB
testcase_45	AC	25 ms 25,220 KB
testcase_46	AC	24 ms 25,220 KB
testcase_47	AC	25 ms 24,556 KB
testcase_48	AC	25 ms 24,812 KB
testcase_49	AC	24 ms 25,196 KB
testcase_50	AC	25 ms 24,812 KB
testcase_51	AC	25 ms 25,196 KB
testcase_52	WA	-
testcase_53	AC	25 ms 24,568 KB

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

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
template <class Int> struct Random {
    mt19937_64 mt{random_device{}()};
    //mt19937_64 mt{(unsigned)time(0)};
    Int a,b; // [a,b]
    Random(Int a, Int b) : a(a), b(b) {}
    Int operator()() { return uniform_int_distribution<Int>(a,b)(mt); }
};
template <class Int> Int rand(Int a, Int b) { // [a,b]
    static mt19937_64 mt{random_device{}()};
    return uniform_int_distribution<Int>(a,b)(mt);
}
// <<<

bool ask_ok(int x) {
    cout << "? " << x << endl;
    string s; cin >> s;
    return s == "safe";
}

void answer(int x) {
    cout << "! " << x << endl;
}

int32_t main() {
    int l = 1, r = 1001;
    while (true) {
        int m = (l+r)/2;
        int nl = -1, nr = -1;
        if (ask_ok(m)) {
            nl = m, nr = r;
        } else if (ask_ok(m+1)) {
            nl = m+1, nr = r;
        } else {
            nl = l, nr = m+2;
        }

        if (l <= nl && nr <= r && (l < nl || nr < r)) {
            l = nl, r = nr;
            continue;
        } else {
            break;
        }
    }
    dump(l,r);
    l -= 2;
    r -= 1;
    for (int x = r-1; x >= l; x--) {
        if (ask_ok(x)) {
            answer(x);
            return 0;
        }
    }
}

yukicoder

結果

テストケース

ソースコード