oj.uz

답안 #581989

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
581989 2022-06-23T09:15:21 Z zaneyu Colors (BOI20_colors) C++14
0 / 100
 0 ms 208 KB 
/*input
3
2
99
4
1023
3
385
 
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld long double
#define pii pair<ll,int>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=2e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?"":"");
    return out;
}
int mult(ll a,ll b){
    if(a<0) a+=MOD;
    return (a*b)%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
int query(int x){
    cout<<"? "<<x<<endl;
    int z;
    cin>>z;
    return z;
}
int32_t main(){
    //ios::sync_with_stdio(false),cin.tie(0);
    ll n;
    cin>>n;
    ll l=1,r=n-1;
    vector<ll> pts;
    while(l<r){
        l=(l+r)/2+1;
        pts.pb(l);
    }
    reverse(ALL(pts));
    ll x=1;
    int d=1;
    for(ll z:pts){
        x+=d*z;
        d=-d;
    }
    l=1,r=n-1;
    query(x);
    while(l<r){
        ll mid=(l+r)/2;
        x+=d*mid;
        d=-d;
        if(query(x)) r=mid;
        else l=mid+1;
    }
    query(1);
    if(!query(n)) l=n;
    cout<<"= "<<l<<endl;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 208 KB Hair color 1 was used multiple times
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 208 KB Hair color 1 was used multiple times
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 208 KB Hair color 1 was used multiple times
2 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 208 KB Hair color 1 was used multiple times
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 208 KB Hair color 1 was used multiple times
2 Halted 0 ms 0 KB -