結果

問題 No.253 ロウソクの長さ
ユーザー Konton7Konton7
提出日時 2020-09-06 17:26:08
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,738 bytes
コンパイル時間 1,952 ms
コンパイル使用メモリ 214,436 KB
実行使用メモリ 24,408 KB
平均クエリ数 31.86
最終ジャッジ日時 2023-09-24 06:36:43
合計ジャッジ時間 5,199 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
23,460 KB
testcase_01 AC 23 ms
24,048 KB
testcase_02 AC 21 ms
23,652 KB
testcase_03 AC 19 ms
23,628 KB
testcase_04 AC 22 ms
24,408 KB
testcase_05 WA -
testcase_06 AC 21 ms
23,676 KB
testcase_07 AC 24 ms
24,360 KB
testcase_08 WA -
testcase_09 AC 21 ms
24,048 KB
testcase_10 AC 23 ms
23,688 KB
testcase_11 AC 23 ms
23,664 KB
testcase_12 AC 22 ms
24,072 KB
testcase_13 AC 25 ms
23,868 KB
testcase_14 AC 18 ms
24,048 KB
testcase_15 WA -
testcase_16 AC 21 ms
23,412 KB
testcase_17 AC 20 ms
23,676 KB
testcase_18 AC 20 ms
23,688 KB
testcase_19 AC 21 ms
23,688 KB
testcase_20 AC 20 ms
23,448 KB
testcase_21 AC 19 ms
24,048 KB
testcase_22 AC 20 ms
23,568 KB
testcase_23 AC 19 ms
23,424 KB
testcase_24 AC 20 ms
23,436 KB
testcase_25 AC 22 ms
23,568 KB
testcase_26 AC 20 ms
23,664 KB
testcase_27 AC 21 ms
23,436 KB
testcase_28 AC 20 ms
24,048 KB
testcase_29 AC 20 ms
23,412 KB
testcase_30 AC 19 ms
23,568 KB
testcase_31 AC 20 ms
23,868 KB
testcase_32 AC 20 ms
23,448 KB
testcase_33 AC 19 ms
24,288 KB
testcase_34 AC 19 ms
23,868 KB
testcase_35 AC 19 ms
23,676 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) {
            if (part != "") 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;
// }

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

class RangeMinorMaxorSumQuery  // 0-index
{
    int const intmax = 2147483647;
    int const intmin = 0;
    vector<double> sgt;
    int n;
    int k;

   public:
    RangeMinorMaxorSumQuery(int n1, int f = -1) {
        if (f == -1)
            f = intmax;
        else if (f == 0)
            f = intmin;
        int na = 1;
        int ka = 0;
        while (na < n1) {
            na *= 2;
            ka++;
        }
        for (int i = 0; i < 2 * na; i++) sgt.push_back(f);
        n = na;
        k = ka;
    }

    void update_sum(int i, double x) {
        i += n;
        sgt[i] = x;
        while (i > 1) {
            i /= 2;
            sgt[i] = sgt[2 * i] + sgt[2 * i + 1];
        }
    }

    double getsum(int a, int b, int k = 1, int l = 0,
                  int r = -1)  //閉区間 l <= x < r とする
    {
        if (r == -1) r = n;
        if (r <= a || b <= l) return intmin;
        if (a == l && b == r)
            return sgt[k];
        else
            return getsum(a, min(b, (l + r) / 2), 2 * k, l, (l + r) / 2) +
                   getsum(max(a, (l + r) / 2), b, 2 * k + 1, (l + r) / 2, r);
    }

    void printsegtree() {
        for (int i = 0; i < 2 * n; i++) {
            cout << sgt[i] << " ";
        }
        cout << endl;
    }
};

struct node {
    int parent = -1;
    ll weight = 0;
    int subtree = 1;
    VPII children;
    VPII connect;
    node(int n) {
        parent = -1;
        weight = 0;
        subtree = 1;
        children;
        connect;
    }
};

int ask(int v) {
    cout << "? " << v << endl;
    int res;
    cin >> res;
    return res;
}

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


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 turn = 1;
    int rep0 = ask(50);
    if (rep0 == 0) {
        answer(50);
        return 0;
    }
    if (rep0 == -1) {
        rep(_, 60) {
            if (ask(0) == 0) {
                answer(turn);
                return 0;
            }
            ++turn;
        }
    }

    int up = 1e9 + 10;
    int down = 0;
    int mid;
    
    while (up - down > 20) {
        mid = (up + down) / 2;
        auto ret = ask(mid);
        if (ret == 0) {
            answer(turn);
            return 0;
        } else if (ret == 1) {
            down = mid - 1;
            --up;
        } else {
            up = mid - 1;
            --down;
        }
        ++turn;
    }

    rep(_, 60) {
        if (ask(down) == 0) {
            answer(down + turn);
            return 0;
        }
        ++turn;
    }

    // show1dvec(dp);
    // show1dvec(before);

    return 0;
}
0