結果

問題 No.1830 Balanced Majority
ユーザー minatominato
提出日時 2022-02-20 03:16:22
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 28 ms / 2,000 ms
コード長 5,689 bytes
コンパイル時間 1,946 ms
コンパイル使用メモリ 198,684 KB
実行使用メモリ 24,360 KB
平均クエリ数 7.35
最終ジャッジ日時 2023-09-11 20:56:31
合計ジャッジ時間 5,269 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 28 ms
23,664 KB
testcase_01 AC 23 ms
24,360 KB
testcase_02 AC 24 ms
23,628 KB
testcase_03 AC 23 ms
23,628 KB
testcase_04 AC 24 ms
23,340 KB
testcase_05 AC 24 ms
23,436 KB
testcase_06 AC 25 ms
23,364 KB
testcase_07 AC 27 ms
23,736 KB
testcase_08 AC 27 ms
24,204 KB
testcase_09 AC 27 ms
23,508 KB
testcase_10 AC 26 ms
24,360 KB
testcase_11 AC 27 ms
23,844 KB
testcase_12 AC 26 ms
23,748 KB
testcase_13 AC 27 ms
24,348 KB
testcase_14 AC 27 ms
23,844 KB
testcase_15 AC 27 ms
23,256 KB
testcase_16 AC 27 ms
23,652 KB
testcase_17 AC 25 ms
24,048 KB
testcase_18 AC 25 ms
23,664 KB
testcase_19 AC 25 ms
23,508 KB
testcase_20 AC 25 ms
24,132 KB
testcase_21 AC 25 ms
24,252 KB
testcase_22 AC 26 ms
23,364 KB
testcase_23 AC 27 ms
24,240 KB
testcase_24 AC 26 ms
24,000 KB
testcase_25 AC 23 ms
23,340 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// clang-format off
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vector<T>>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
constexpr char ln = '\n';
template <class Container> inline int SZ(const Container& v) { return int(v.size()); }
template <class T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template <class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; }
template <class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; }
inline int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }
inline int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); }
inline int popcount(ull x) { return __builtin_popcountll(x); }
inline int kthbit(ull x, int k) { return (x >> k) & 1; }
inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x - 1) * 10; }
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
inline void YES(bool t = true) { cout << YESNO[t] << "\n"; }
inline void Yes(bool t = true) { cout << YesNo[t] << "\n"; }
template <class T> inline void drop(T x) { cout << x << "\n"; exit(0); }
inline void print() { cout << "\n"; }
template <class T> inline void print(const vector<T>& v) { for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) { cout << " "; } cout << *it; } print(); }
template <class T, class... Args> inline void print(const T& x, const Args& ... args) { cout << x << " "; print(args...); }
#ifdef MINATO_LOCAL
template <class T1, class T2> ostream& operator<<(ostream& os, pair<T1, T2> p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <size_t N, class TUPLE> void debug_tuple(ostream& os, TUPLE _) { (void)os; (void)_; }
template <size_t N, class TUPLE, class T, class ...Args> void debug_tuple(ostream &os, TUPLE t) { os << (N == 0 ? "" : ", ") << get<N>(t); debug_tuple<N + 1, TUPLE, Args...>(os, t); }
template <class ...Args> ostream& operator<<(ostream& os, tuple<Args...> t) { os << "("; debug_tuple<0, tuple<Args...>, Args...>(os, t); return os << ")"; }
string debug_delim(int& i) { return i++ == 0 ? "" : ", "; }
#define debug_embrace(x) { int i = 0; os << "{";  { x } return os << "}"; }
template <class T> ostream& operator<<(ostream& os, vector<T> v) { debug_embrace( for (T e : v) { os << debug_delim(i) << e; } ) }
template <class T, size_t N> ostream& operator<<(ostream& os, array<T, N> a) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }
template <class T, size_t N> enable_if_t<!is_same_v<char, remove_cv_t<T>>, ostream>& operator<<(ostream& os, T(&a)[N]) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }
template <class Key> ostream& operator<<(ostream& os, set<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }
template <class Key, class T> ostream& operator<<(ostream& os, map<Key, T> mp) { debug_embrace( for (auto e : mp) { os << debug_delim(i) << e; }) }
template <class Key> ostream& operator<<(ostream& os, multiset<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }
template <class T> ostream& operator<<(ostream& os, queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.front(); } ) }
template <class T> ostream& operator<<(ostream& os, deque<T> q) { debug_embrace( for (T e : q) { os << debug_delim(i) << e; } ) }
template <class T> ostream& operator<<(ostream& os, priority_queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) }
template <class T> ostream& operator<<(ostream& os, priority_queue<T, vector<T>, greater<T>> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) }
void debug_out() { cerr << endl; }
template <class T, class... Args> void debug_out(const T& x, const Args& ... args) { cerr << " " << x; debug_out(args...); }
#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif
// struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(7); }; } fast_ios_;
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// clang-format on

int ask(int K) {
    cout << "? " << K << endl;
    int S;
    cin >> S;
    return S;
}

int calc_sm(int K, int S) {
    int R = K - S;
    return S - R;
}

void answer(int L, int R) {
    cout << "! " << L << " " << R << endl;
    exit(0);
}
int main() {
    int N;
    cin >> N;

    int front_two = calc_sm(1, ask(1));
    int back_two = calc_sm(N - 1, ask(N - 1));
    if (front_two == back_two) {
        answer(2, N - 1);
    }
    int ok = 2;
    int ng = N - 1;
    while (ng - ok > 1) {
        int mid = (ok + ng) / 2;
        int val = calc_sm(mid, ask(mid));
        if (val == 0) {
            if (mid >= N / 2) {
                answer(1, mid);
            } else {
                answer(mid + 1, N);
            }
        }
        if (val * front_two > 0) {
            ok = mid;
        } else {
            ng = mid;
        }
    }
    if (ok >= N / 2) {
        answer(1, ok);
    } else {
        answer(ok + 1, N);
    }
}
0