結果

問題 No.1830 Balanced Majority
ユーザー woodywoodywoodywoody
提出日時 2022-09-19 23:56:21
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,304 bytes
コンパイル時間 4,009 ms
コンパイル使用メモリ 230,776 KB
実行使用メモリ 25,220 KB
平均クエリ数 7.54
最終ジャッジ日時 2024-12-22 02:56:49
合計ジャッジ時間 6,860 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 28 ms
24,824 KB
testcase_01 AC 24 ms
25,208 KB
testcase_02 AC 24 ms
24,952 KB
testcase_03 AC 23 ms
24,824 KB
testcase_04 AC 23 ms
24,824 KB
testcase_05 AC 24 ms
24,824 KB
testcase_06 AC 23 ms
25,208 KB
testcase_07 AC 25 ms
24,580 KB
testcase_08 AC 25 ms
25,220 KB
testcase_09 AC 26 ms
24,964 KB
testcase_10 AC 26 ms
24,580 KB
testcase_11 WA -
testcase_12 AC 26 ms
24,964 KB
testcase_13 AC 28 ms
24,976 KB
testcase_14 AC 26 ms
24,964 KB
testcase_15 AC 26 ms
24,952 KB
testcase_16 AC 26 ms
24,836 KB
testcase_17 AC 26 ms
24,964 KB
testcase_18 AC 26 ms
25,220 KB
testcase_19 AC 25 ms
25,220 KB
testcase_20 AC 24 ms
24,580 KB
testcase_21 AC 27 ms
24,836 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 25 ms
24,580 KB
testcase_25 AC 24 ms
25,220 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:39,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/sstream:38,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/complex:45,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ccomplex:39,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:54,
                 from main.cpp:2:
In member function 'std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(long long int) [with _CharT = char; _Traits = std::char_traits<char>]',
    inlined from 'int main()' at main.cpp:112:35:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:202:25: warning: 'r' may be used uninitialized [-Wmaybe-uninitialized]
  202 |       { return _M_insert(__n); }
      |                ~~~~~~~~~^~~~~
main.cpp: In function 'int main()':
main.cpp:94:12: note: 'r' was declared here
   94 |         ll r;
      |            ^

ソースコード

diff # 

// #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}}
#define dame { cout << "No" << endl; return 0;}
#define dame1 { cout << -1 << endl; return 0;}
#define test(x) cout << "test" << x << endl;
#define deb(x,y) cout << x << " " << y << endl;
#define debp(p) cout << p.fi << " " << p.se << endl;
#define deb3(x,y,z) cout << x << " " << y << " " << z << endl;
#define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define showdeb(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl;
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define yesr { cout <<"Yes"<<endl; return 0;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return 0;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;

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

    auto check = [&](bool b)->void{
        if (!b) while(1);
    };

    auto calc = [&](int x,int k)->int{
        return k - (x-k);
    };

    auto q = [&](int x)->int{
        cout << "?" << " " << x << endl;
        int ret; cin>>ret;
        check(ret != -1);
        return calc(x,ret);
    };

    ll a = q(1);
    ll b = q(n-1);

    if (a*b > 0){
        cout << "!" << " " << 2 << " " << n-1 <<  endl;
    }else if (a*b < 0){
        ll l = 1;
        ll u = n-1;

        ll r;

        while(u-l > 1){
            ll mid = (l+u) / 2;
            ll c = q(mid);
            if (c == 0){
                r = mid;
                break;
            }else if (a*c > 0){
                l = mid;
            }else{
                u = mid;
            }
        }

        if (r >= n/2){
            cout << "!" << " " << 1 << " " << r <<  endl;
        }else{
            cout << "!" << " " << r << " " << n-1 <<  endl;
        }

    }else{
        while(1);
    }

// 消せ！！！！！！　#define _GLIBCXX_DEBUG
// priority_queue でしぬ

    return 0;
}
0