#537768 (C++14) No.1187 皇帝ペンギン

提出ソース

結果

問題	No.1187 皇帝ペンギン
ユーザー	Shuz*
提出日時	2020-08-22 15:23:46
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,815 bytes
コンパイル時間	1,829 ms
コンパイル使用メモリ	173,348 KB
実行使用メモリ	25,740 KB
平均クエリ数	16.91
最終ジャッジ日時	2024-07-17 06:26:10
合計ジャッジ時間	7,854 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

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

テストケース

テストケース表示

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

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
//#pragma GCC target("arch=skylake-avx512")

#pragma region template

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define rt(i, n) (i == (ll)(n) -1 ? rt : sp)
#define len(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define ifn(x) if (not(x))
#define elif else if
#define elifn else ifn
#define fi first
#define se second
#define uniq(x) (sort(all(x)), (x).erase(unique(all(x)), (x).end()))
#define num(x, y) ((ll)(lower_bound(all(x), y) - (x).begin()))

using graph = vector<vector<ll>>;
template <class T> using wgraph = vector<vector<ll, T>>;
bool __DIRECTED__ = true;
bool __ZERO_INDEXED__ = false;
istream &operator>>(istream &is, graph &g) {
    ll a, b;
    is >> a >> b;
    if (__ZERO_INDEXED__ == false) a--, b--;
    g[a].pb(b);
    if (__DIRECTED__ == false) g[b].pb(a);
    return is;
}
template <class T> istream &operator>>(istream &is, wgraph<T> &g) {
    ll a, b;
    T c;
    is >> a >> b >> c;
    if (__ZERO_INDEXED__ == false) a--, b--;
    g[a].pb({b, c});
    if (__DIRECTED__ == false) g[b].pb({a, c});
    return is;
}

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

// Debug
#define debug(...)                                                                                 \
    {                                                                                              \
        cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                                         \
        for (auto &&__i : {__VA_ARGS__}) cerr << "[" << __i << "] ";                               \
        cerr << rt;                                                                                \
    }

#define dump(a, h, w)                                                                              \
    {                                                                                              \
        cerr << __LINE__ << ": " << #a << " = [" << rt;                                            \
        rep(__i, h) {                                                                              \
            rep(__j, w) {                                                                          \
                if (abs(a[__i][__j]) >= INF / 2 and a[__i][__j] <= -INF / 2) cerr << '-';          \
                if (abs(a[__i][__j]) >= INF / 2) cerr << "∞" << sp;                                \
                else                                                                               \
                    cerr << a[__i][__j] << sp;                                                     \
            }                                                                                      \
            cerr << rt;                                                                            \
        }                                                                                          \
        cerr << "]" << rt;                                                                         \
    }

#define vdump(a, n)                                                                                \
    {                                                                                              \
        cerr << __LINE__ << ": " << #a << " = [";                                                  \
        rep(__i, n) {                                                                              \
            if (__i) cerr << sp;                                                                   \
            if (abs(a[__i]) >= INF / 2 and a[__i] <= -INF / 2) cerr << '-';                        \
            if (abs(a[__i]) >= INF / 2) cerr << "∞" << sp;                                         \
            else                                                                                   \
                cerr << a[__i];                                                                    \
        }                                                                                          \
        cerr << "]" << rt;                                                                         \
    }

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)

// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
    io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;

// Speed
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("Ofast,unroll-loops")

// Math
inline constexpr ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }

inline constexpr ll modulo(const ll n, const ll m = MOD) {
    ll k = n % m;
    return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
    n %= m;
    return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
    ll r = 1;
    rep(i, 64) {
        if (n & (1LL << i)) r *= a;
        chmod(r, m);
        a *= a;
        chmod(a, m);
    }
    return r;
}
inline ll inv(const ll n, const ll m = MOD) {
    ll a = n, b = m, x = 1, y = 0;
    while (b) {
        ll t = a / b;
        a -= t * b;
        swap(a, b);
        x -= t * y;
        swap(x, y);
    }
    return modulo(x, m);
}

#pragma endregion

#define req(x) cout << "? " << x << endl, cin >> s;
#define ans(x) cout << "! " << x << endl;

signed main() {
    ll ok = 0, ng = 1000, mem = -1;
    string s;
    rep(i, 10) {
        ll md = (ok + ng) / 2;
        if (mem != 1 and md % mem == 0) md++;
        req(md);
        if (s == "safe") {
            ok = md;
        } else if (mem == -1) {
            req(md + 1);
            if (s == "safe") {
                mem = md;
            } else {
                ng = md;
            }
        } else {
            ng = md;
        }
    }
    ans(ok);
}

yukicoder

結果

テストケース

ソースコード