結果

問題 No.1830 Balanced Majority
ユーザー fuppy_kyoprofuppy_kyopro
提出日時 2022-02-04 21:53:05
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 30 ms / 2,000 ms
コード長 4,383 bytes
コンパイル時間 2,312 ms
コンパイル使用メモリ 201,708 KB
実行使用メモリ 24,372 KB
平均クエリ数 7.85
最終ジャッジ日時 2023-09-02 04:46:25
合計ジャッジ時間 4,320 ms
ジャッジサーバーID
(参考情報)
judge15 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 30 ms
23,568 KB
testcase_01 AC 25 ms
24,060 KB
testcase_02 AC 24 ms
24,372 KB
testcase_03 AC 25 ms
23,412 KB
testcase_04 AC 25 ms
24,000 KB
testcase_05 AC 24 ms
23,868 KB
testcase_06 AC 25 ms
24,060 KB
testcase_07 AC 26 ms
23,412 KB
testcase_08 AC 27 ms
23,604 KB
testcase_09 AC 26 ms
24,348 KB
testcase_10 AC 26 ms
24,024 KB
testcase_11 AC 26 ms
23,376 KB
testcase_12 AC 27 ms
24,324 KB
testcase_13 AC 27 ms
24,048 KB
testcase_14 AC 26 ms
24,360 KB
testcase_15 AC 27 ms
23,664 KB
testcase_16 AC 27 ms
23,688 KB
testcase_17 AC 27 ms
23,832 KB
testcase_18 AC 25 ms
24,012 KB
testcase_19 AC 26 ms
24,252 KB
testcase_20 AC 25 ms
23,424 KB
testcase_21 AC 27 ms
24,012 KB
testcase_22 AC 26 ms
23,820 KB
testcase_23 AC 27 ms
23,436 KB
testcase_24 AC 26 ms
23,448 KB
testcase_25 AC 24 ms
24,372 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/

#include <bits/stdc++.h>

// #include <atcoder/all>
// #include <atcoder/modint>

using namespace std;
// using namespace atcoder;

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                        \
    cerr << #v << ":";                                      \
    for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
        cerr << " " << v[iiiiiiii];                         \
    cerr << endl;
#define DEBUG_MAT(v)                                \
    cerr << #v << endl;                             \
    for (int iv = 0; iv < v.size(); iv++) {         \
        for (int jv = 0; jv < v[iv].size(); jv++) { \
            cerr << v[iv][jv] << " ";               \
        }                                           \
        cerr << endl;                               \
    }
typedef long long ll;
// #define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
    return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}
#define X first
#define Y second
#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 rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
    cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
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;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 1, 0, -1}, dy = {-1, 0, 1, 0};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
    }
} setup_io;
// const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

int ask(int k) {
    cout << "? " << k << endl;
    int x;
    cin >> x;
    return x;
}

signed main() {
    int n;
    cin >> n;

    int two = ask(2);

    if (two == 1) {
        cout << "! " << 3 << " " << n << endl;
        return 0;
    }
    int one = two / 2;

    if (ask(n - 1) - one == (n - 2) / 2) {
        cout << "! " << 2 << " " << n - 1 << endl;
        return 0;
    }

    int ng = 2, ok = n;
    while (ng + 1 < ok) {
        int mid = (ng + ok) / 2;

        int num = ask(mid);
        int rem = mid - num;
        // DEBUG(pii(num, rem));

        if (one == 0) {
            if (num >= rem)
                ok = mid;
            else
                ng = mid;
        } else {
            if (num <= rem)
                ok = mid;
            else
                ng = mid;
        }
    }

    if (ok >= n / 2) {
        cout << "! " << 1 << " " << ok << endl;
    } else {
        cout << "! " << ok + 1 << " " << n << endl;
    }
}
0