結果

問題 No.1830 Balanced Majority
ユーザー FF256grhyFF256grhy
提出日時 2022-02-04 23:48:27
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 24 ms / 2,000 ms
コード長 6,642 bytes
コンパイル時間 2,203 ms
コンパイル使用メモリ 212,316 KB
実行使用メモリ 25,220 KB
平均クエリ数 7.54
最終ジャッジ日時 2024-06-11 13:05:47
合計ジャッジ時間 4,291 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 21 ms
24,824 KB
testcase_01 AC 19 ms
25,208 KB
testcase_02 AC 19 ms
25,208 KB
testcase_03 AC 19 ms
24,824 KB
testcase_04 AC 19 ms
25,208 KB
testcase_05 AC 19 ms
25,208 KB
testcase_06 AC 20 ms
25,208 KB
testcase_07 AC 22 ms
24,836 KB
testcase_08 AC 20 ms
24,964 KB
testcase_09 AC 22 ms
25,220 KB
testcase_10 AC 22 ms
25,220 KB
testcase_11 AC 22 ms
24,964 KB
testcase_12 AC 21 ms
24,964 KB
testcase_13 AC 23 ms
24,836 KB
testcase_14 AC 22 ms
25,220 KB
testcase_15 AC 23 ms
24,836 KB
testcase_16 AC 23 ms
25,220 KB
testcase_17 AC 24 ms
25,220 KB
testcase_18 AC 20 ms
25,220 KB
testcase_19 AC 19 ms
24,836 KB
testcase_20 AC 20 ms
24,964 KB
testcase_21 AC 22 ms
25,220 KB
testcase_22 AC 22 ms
24,836 KB
testcase_23 AC 23 ms
25,204 KB
testcase_24 AC 21 ms
24,836 KB
testcase_25 AC 20 ms
25,220 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define incII(i, l, r) for(decay_t<decltype(r)> i = (l)    ; i <= (r); i++)
#define incIX(i, l, r) for(decay_t<decltype(r)> i = (l)    ; i <  (r); i++)
#define incXI(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <= (r); i++)
#define incXX(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <  (r); i++)
#define decII(i, l, r) for(decay_t<decltype(r)> i = (r)    ; i >= (l); i--)
#define decIX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >= (l); i--)
#define decXI(i, l, r) for(decay_t<decltype(r)> i = (r)    ; i >  (l); i--)
#define decXX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >  (l); i--)
#define inc(i, n)  incIX(i, 0, n)
#define dec(i, n)  decIX(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
auto inII = [](auto a, auto l, auto r) -> bool { return (l <= a && a <= r); };
auto inIX = [](auto a, auto l, auto r) -> bool { return (l <= a && a <  r); };
auto inXI = [](auto a, auto l, auto r) -> bool { return (l <  a && a <= r); };
auto inXX = [](auto a, auto l, auto r) -> bool { return (l <  a && a <  r); };
auto setmin   = [](auto & a, auto b) -> bool { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) -> bool { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) -> bool { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) -> bool { return (b >= a ? a = b, true : false); };
using LL = long long int;
using LD = long double;
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(a) begin(a), end(a)
#define RALL(a) rbegin(a), rend(a)
#define RV(a) reverse(ALL(a))
#define ST(a) sort(ALL(a))
#define RST(a) sort(RALL(a))
#define SC static_cast
#define SI(a) SC<int>(a.size())
#define SL(a) SC<LL>(a.size())
#define RF(e, ...) for(auto && e: __VA_ARGS__)
#define SF(a, ...) for(auto && [__VA_ARGS__]: a)
#define until(e) while(not(e))
#define if_not(e) if(not(e))
#define ef else if
#define UR assert(false)
auto * IS = & cin;
auto * OS = & cout;
template<typename ... A> void in(A & ... a) { (* IS >> ... >> a); }
#define IN(...) __VA_ARGS__; in(__VA_ARGS__)
struct OS_init { OS_init() { * OS << boolalpha << fixed << setprecision(20); } } os_init_;
void                                      out_([[maybe_unused]] string const & s) { }
template<typename A                > void out_([[maybe_unused]] string const & s, A const & a) { * OS << a; }
template<typename A, typename ... B> void out_(                 string const & s, A const & a, B const & ... b) { * OS << a << s; out_(s, b ...); }
auto outF  = [](array<string, 3> const & s, auto const & ... a) { * OS << s[0]; out_(s[1], a ...); * OS << s[2] << flush; };
auto outN  = [](auto const & ... a) { outF({ "", ""  , ""   }, a ...); };
auto outS  = [](auto const & ... a) { outF({ "", " " , " "  }, a ...); };
auto outL  = [](auto const & ... a) { outF({ "", "\n", "\n" }, a ...); };
auto outSN = [](auto const & ... a) { outF({ "", " " , ""   }, a ...); };
auto outNL = [](auto const & ... a) { outF({ "", ""  , "\n" }, a ...); };
auto outSL = [](auto const & ... a) { outF({ "", " " , "\n" }, a ...); };
auto outD  = [](auto const & ... a) { outF({ "[ ", " : " , " ]\n" }, a ...); };
auto out   = outSL;
template<typename A                > void disp_(A const & a) { * OS << a; }
template<typename A, typename ... T> void disp_(A const & a, string const & s, T const & ... t) { string ss; for(auto && e: a) { * OS << ss; ss = s; disp_(e, t ...); } }
auto dispI = [](auto const & a, auto const & s, auto const & ... t) { disp_(a, t ...); * OS << s << flush; };
auto dispT = [](auto const & a, auto const & s, auto const & ... t) { for(auto && e: a) { disp_(e, t ...); * OS << s; } * OS << flush; };
auto dispL = [](auto const & a,                 auto const & ... t) { dispT(a, "\n", t ...); };
template<typename A> istream & operator>>(istream & is, vector<A>       & v) { for(auto && e: v) { is >> e; } return is; }
template<typename A> ostream & operator<<(ostream & os, vector<A> const & v) { string ss; for(auto && e: v) { os << ss << e; ss = " "; } return os; }
template<typename A                > auto make_v(A a) { return a; }
template<typename A, typename ... M> auto make_v(A a, int n, M ... m) { return vector(n, make_v(a, m ...)); }
template<typename A, typename ... N> auto read_v(N ... n) { auto a = make_v(A { }, n ...); in(a); return a; }
template<typename A, size_t N> istream & operator>>(istream & is, array<A, N>       & a) { for(auto && e: a) { is >> e; } return is; }
template<typename A, size_t N> ostream & operator<<(ostream & os, array<A, N> const & a) { string ss; for(auto && e: a) { os << ss << e; ss = " "; } return os; }
template<typename A, typename B> istream & operator>>(istream & is, pair<A, B>       & p) { return is >> p.first >> p.second; }
template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B> const & p) { return os << p.first << " " << p.second; }
template<int I = 0, typename T> void tin_ (istream & is, T       & t) { if constexpr(I < tuple_size<T>::value) { is >> get<I>(t); tin_<I + 1>(is, t); } }
template<int I = 0, typename T> void tout_(ostream & os, T const & t) { if constexpr(I < tuple_size<T>::value) { if(I != 0) { os << " "; } os << get<I>(t); tout_<I + 1>(os, t); } }
template<typename ... A> istream & operator>>(istream & is, tuple<A ...>       & t) { tin_ (is, t); return is; }
template<typename ... A> ostream & operator<<(ostream & os, tuple<A ...> const & t) { tout_(os, t); return os; }

// ---- ----

int main() {
	// string IN(s);
	// int n = SI(s);
	// assert(n % 2 == 0);
	// assert(count(ALL(s), 'o') == n / 2);
	// RF(c, s) { assert(c == 'o' || c == 'x'); }
	int IN(n);
	
	map<int, int> mp;
	mp[0] = 0;
	mp[n] = 0;
	int cnt = 0;
	auto c = [&](int k) -> int {
		if(mp.count(k) == 1) { return mp[k]; }
		cnt++;
		assert(cnt <= 20);
		out("?", k);
		int IN(a);
		// auto t = s.substr(0, k);
		// int a = count(ALL(t), 'o');
		// out("##", a, 2 * a - k);
		return (mp[k] = 2 * a - k);
	};
	auto ans = [&](int l, int r) {
		out("!", l + 1, r);
		// auto t = s.substr(l, r - l);
		// assert(count(ALL(t), 'o') == count(ALL(t), 'x'));
		exit(0);
	};
	auto sgn = [&](int x) -> int {
		if(x > 0) { return +1; }
		if(x < 0) { return -1; }
		return 0;
	};
	
	int l = 1, r = n - 1;
	if(sgn(c(l)) == sgn(c(r))) { ans(l, r); }
	while(true) {
		int m = (l + r) / 2;
		if(c(m) == 0) {
			if(m >= n / 2) { ans(0, m); }
			if(m <= n / 2) { ans(m, n); }
		}
		(sgn(c(m)) == sgn(c(l)) ? l : r) = m;
	}
}
0