結果

問題 No.1187 皇帝ペンギン
ユーザー Konton7Konton7
提出日時 2020-08-22 15:07:00
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 26 ms / 1,000 ms
コード長 5,845 bytes
コンパイル時間 2,439 ms
コンパイル使用メモリ 218,468 KB
実行使用メモリ 25,220 KB
平均クエリ数 16.48
最終ジャッジ日時 2024-07-17 06:23:50
合計ジャッジ時間 6,535 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
24,800 KB
testcase_01 AC 24 ms
24,940 KB
testcase_02 AC 24 ms
24,428 KB
testcase_03 AC 24 ms
24,556 KB
testcase_04 AC 24 ms
24,812 KB
testcase_05 AC 24 ms
24,940 KB
testcase_06 AC 23 ms
24,812 KB
testcase_07 AC 23 ms
24,812 KB
testcase_08 AC 24 ms
24,556 KB
testcase_09 AC 24 ms
25,052 KB
testcase_10 AC 24 ms
24,556 KB
testcase_11 AC 24 ms
24,964 KB
testcase_12 AC 24 ms
25,196 KB
testcase_13 AC 24 ms
24,812 KB
testcase_14 AC 24 ms
24,556 KB
testcase_15 AC 25 ms
25,196 KB
testcase_16 AC 24 ms
24,928 KB
testcase_17 AC 24 ms
25,196 KB
testcase_18 AC 24 ms
24,556 KB
testcase_19 AC 24 ms
24,940 KB
testcase_20 AC 24 ms
25,196 KB
testcase_21 AC 24 ms
25,184 KB
testcase_22 AC 24 ms
24,812 KB
testcase_23 AC 24 ms
24,940 KB
testcase_24 AC 24 ms
24,812 KB
testcase_25 AC 24 ms
24,796 KB
testcase_26 AC 24 ms
24,556 KB
testcase_27 AC 23 ms
24,844 KB
testcase_28 AC 24 ms
24,556 KB
testcase_29 AC 24 ms
24,940 KB
testcase_30 AC 23 ms
24,940 KB
testcase_31 AC 23 ms
24,556 KB
testcase_32 AC 23 ms
24,568 KB
testcase_33 AC 23 ms
24,824 KB
testcase_34 AC 23 ms
24,824 KB
testcase_35 AC 23 ms
25,208 KB
testcase_36 AC 22 ms
24,568 KB
testcase_37 AC 23 ms
24,824 KB
testcase_38 AC 23 ms
25,208 KB
testcase_39 AC 23 ms
24,952 KB
testcase_40 AC 23 ms
24,568 KB
testcase_41 AC 23 ms
24,824 KB
testcase_42 AC 23 ms
24,836 KB
testcase_43 AC 24 ms
24,836 KB
testcase_44 AC 25 ms
25,220 KB
testcase_45 AC 23 ms
24,964 KB
testcase_46 AC 23 ms
24,580 KB
testcase_47 AC 24 ms
24,812 KB
testcase_48 AC 23 ms
24,812 KB
testcase_49 AC 23 ms
25,196 KB
testcase_50 AC 23 ms
24,940 KB
testcase_51 AC 23 ms
24,940 KB
testcase_52 AC 24 ms
24,568 KB
testcase_53 AC 24 ms
25,208 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVB = vector<vector<bool>>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using VPII = std::vector<std::pair<int, int>>;
using PLL = std::pair<ll, ll>;
using VPLL = std::vector<std::pair<ll, ll>>;
using TI3 = std::tuple<int, int, int>;
using TI4 = std::tuple<int, int, int, int>;
using TL3 = std::tuple<ll, ll, ll>;
using TL4 = std::tuple<ll, ll, ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d))
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()
#define allpt_cr(v) (v).crbegin(), (v).crend()

const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
const int mod = mod1;
const ll inf = 1e18;

const string wsp = " ";
const string tb = "\t";
const string rt = "\n";
const string alphabets = "abcdefghijklmnopqrstuvwxyz";

template <typename T>
void show1dvec(const vector<T> &v) {
    if (v.size() == 0) return;
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << wsp;
    cout << v[n] << rt;

    return;
}

template <typename T>
void show2dvec(const vector<vector<T>> &v) {
    int n = v.size();
    rep(i, n) show1dvec(v[i]);
}

template <typename T, typename S>
void show1dpair(const vector<pair<T, S>> &v) {
    int n = v.size();
    rep(i, n) cout << v[i].first << wsp << v[i].second << rt;
    return;
}

template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s) {
    int n = v.size();
    rep(i, n) {
        t.push_back(v[i].first);
        s.push_back(v[i].second);
    }
    return;
}

template <typename T>
void maxvec(vector<T> &v) {
    T s = v[0];
    int n = v.size();
    rep(i, n - 1) {
        if (s > v[i + 1]) {
            v[i + 1] = s;
        }
        s = v[i + 1];
    }
}

template <typename T, typename S>
bool myfind(T t, S s) {
    return find(t.cbegin(), t.cend(), s) != t.cend();
}

bool check(int y, int x, int h, int w) {
    return 0 <= y && y < h && 0 <= x && x < w;
}

bool iskadomatsu(int a, int b, int c) {
    return (a != b && b != c && c != a) &&
           ((a > b && b < c) || (a < b && b > c));
}

double euc_dist(PII a, PII b) {
    return sqrt(pow(a.first - b.first, 2) + pow(a.second - b.second, 2));
}

VS split(string s, char c) {
    VS ret;
    string part;
    s += c;
    rep(i, s.length()) {
        if (s[i] == c) {
            ret.emplace_back(part);
            part = "";
        } else if (s[i] != c) {
            part += s[i];
        }
    }
    return ret;
}

template <typename T, typename S, typename R>
ll pow_mod(T p, S q, R mod = 1ll) {
    ll ret = 1, r = p;
    while (q) {
        if (q % 2) ret *= r, ret %= mod;
        r = (r * r) % mod, q /= 2;
    }
    return ret % mod;
}

template <typename T, typename S>
ll pow_no_mod(T p, S q) {
    ll ret = 1, r = p;
    while (q) {
        if (q % 2) ret *= r;
        r = (r * r), q /= 2;
    }
    return ret;
}

void make_frac_tables(VL &frac_list, VL &frac_inv_list) {
    rep(i, frac_list.size() - 1) {
        frac_list[i + 1] *= frac_list[i] * (i + 1);
        frac_list[i + 1] %= mod;
        frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);
        frac_inv_list[i + 1] %= mod;
    }
}

pair<VL, VL> make_frac_tables(int n) {
    VL frac_list(n + 1, 1), frac_inv_list(n + 1, 1);
    rep(i, n) {
        frac_list[i + 1] *= frac_list[i] * (i + 1);
        frac_list[i + 1] %= mod;
        frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);
        frac_inv_list[i + 1] %= mod;
    }
    return make_pair(frac_list, frac_inv_list);
}

ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list) {
    if (a < b) return 0;
    if (b < 0) return 0;
    ll ret = frac_list[a];
    ret *= frac_inv_list[b];
    ret %= mod;
    ret *= frac_inv_list[a - b];
    ret %= mod;
    return ret;
}

double dist(tuple<double, double, double> p, tuple<double, double, double> q) {
    auto [p1, p2, p3] = p;
    auto [q1, q2, q3] = q;
    double r = sqrt(pow(p1 - q1, 2) + pow(p2 - q2, 2)) - (p3 + q3);
    return max(0.0, r);
}

void djkstra(int n, const vector<set<PII>> &connect) {
    const int intm = 1e7;
    vector<int> shortest(n, intm);
    shortest[0] = 0;
    vector<int> search = {0};
    vector<int> new_search;
    while (!search.empty()) {
        for (auto i : search) {
            for (auto [j, d] : connect[i]) {
                if (shortest[j] > d + shortest[i]) {
                    shortest[j] = d + shortest[i];
                    new_search.emplace_back(j);
                }
            }
        }
        search.clear();
        search = new_search;
        new_search.clear();
        show1dvec(search);
        show1dvec(shortest);
    }
    printf("%d\n", shortest[n - 1]);
}



int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt");  // for debug
    cin.rdbuf(in.rdbuf());     // for debug
#endif

    int ng = 1000, ok = 0, mid;
    string res;
    while (ng - ok > 1) {
        mid = (ng + ok) / 2;
        cout << "? " << mid << endl;
        cin >> res;
        if (res == "safe") {
            ok = mid;
            continue;
        } else {
            mid++;
            cout << "? " << mid << endl;
            cin >> res;
            if (res == "safe") {
                ok = mid;
            } else {
                ng = mid - 1;
            }
        }
    }
    cout << "! " << ok << endl;

    return 0;
}
0