結果
問題 | No.2753 鳩の巣原理 |
ユーザー | 👑 potato167 |
提出日時 | 2024-05-10 21:43:01 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,209 bytes |
コンパイル時間 | 1,919 ms |
コンパイル使用メモリ | 202,440 KB |
実行使用メモリ | 25,580 KB |
平均クエリ数 | 7.90 |
最終ジャッジ日時 | 2024-05-10 21:43:13 |
合計ジャッジ時間 | 6,495 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 21 ms
25,580 KB |
testcase_22 | AC | 21 ms
24,812 KB |
testcase_23 | AC | 22 ms
25,196 KB |
testcase_24 | AC | 24 ms
24,940 KB |
testcase_25 | AC | 24 ms
24,556 KB |
testcase_26 | AC | 21 ms
24,812 KB |
testcase_27 | AC | 21 ms
25,196 KB |
testcase_28 | AC | 21 ms
24,812 KB |
testcase_29 | WA | - |
ソースコード
#include <bits/stdc++.h> #pragma GCC optimize("unroll-loops") using namespace std; using std::cout; using std::cin; using std::endl; using ll=long long; using ld=long double; const ll ILL=2167167167167167167; const int INF=2100000000; const int mod=998244353; #define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++) #define all(p) p.begin(),p.end() template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>; template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;} template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;} template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());} template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;} template<class T> void vec_out(vector<T> &p,int ty=0){ if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";} else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}} template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;} template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;} template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;} int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;} template<class T> bool inside(T l,T x,T r){return l<=x&&x<r;} struct mint{ static constexpr int m = 998244353; int x; mint() : x(0){} mint(long long x_):x(x_ % m){if (x < 0) x += m;} int val(){return x;} mint &operator+=(mint b){if ((x += b.x) >= m) x -= m; return *this;} mint &operator-=(mint b){if ((x -= b.x) < 0) x += m; return *this;} mint &operator*=(mint b){x= (long long)(x) * b.x % m; return *this;} mint pow(long long e) const { mint r = 1,b =*this; while (e){ if (e & 1) r *= b; b *= b; e >>= 1; } return r; } mint inv(){return pow(m - 2);} mint &operator/=(mint b){return *this *= b.pow(m - 2);} friend mint operator+(mint a, mint b){return a += b;} friend mint operator-(mint a, mint b){return a -= b;} friend mint operator/(mint a, mint b){return a /= b;} friend mint operator*(mint a, mint b){return a *= b;} friend bool operator==(mint a, mint b){return a.x == b.x;} friend bool operator!=(mint a, mint b){return a.x != b.x;} }; void solve(); // oddloop int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t=1; //cin>>t; rep(i,0,t) solve(); } void solve(){ ll N; cin>>N; ll l=0,r=N+1; ll lv=0,rv=N; while(r-l>1){ ll m=(l+r)/2; ll mv; cout<<"? "<<m<<endl; cin>>mv; if(mv-lv<m-l) r=m,rv=mv; else l=m,lv=mv; } cout<<"Yes "<<l<<" "<<r<<endl; }