제출 #1231870

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1231870		ender_shayan	Colors (BOI20_colors)	C++17	0 / 100	0 ms	420 KiB

Colors

#include <bits/stdc++.h>

using namespace std;

// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

typedef long long ll;
typedef long double	ld;
typedef pair<int, int>	pii  ;
typedef pair<ll, ll>	pll  ;
typedef vector<pii>     vii  ;
typedef vector<int>     veci ;
typedef vector<pll>     vll  ;
typedef vector<ll>      vecll;

// find_by_order             order_of_key

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F		        first
#define S		        second
#define pb		        push_back
#define Mp		        make_pair
#define all(x)          x.begin(), x.end()
#define debug(x)        cerr << #x << " = " << x << endl
#define set_dec(x)	    cout << fixed << setprecision(x);
#define fast_io         ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io         freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb              lower_bound
#define ub              upper_bound
#define for1(n)         for(int i=1;i<=n;i++)
#define for0(n)         for(int i=0;i<n;i++)
#define forn(n)         for(int i=n;i>0;i--)
#define pq              priority_queue <pii, vector<pii>, greater<pii>>


int n,L,vis[1000];

bool ask(ll t){
    if(vis[t])exit(0);
    vis[t]=1;
    cout<<"? "<<t<<endl;
    bool o;cin>>o;
    o^=1;
    return o;
}
int main(){
    ll n;cin>>n;
    ll s=n,tmp=n-1;L=log2(n-1);
    bool o=0;
    for(int j=L;j>=0;j--){
        if(o)s+=tmp;
        else s-=tmp;
        while(j>=0){
            if(tmp>>j&1)break;
            j--;
        }
        if(j!=-1)
            tmp-=(1ll<<j);
        o^=1;
    }
    ll nn=n-1;
    ll c=0;
    ask(s);
    for(int j=L;j>=0;j--){
        if(c+(1ll<<j)>nn)continue;
        if(o==1){
            if(ask(s+c+(1ll<<j))){
                c+=1ll<<j;
                s+=c;
            }
            else
                s+=c+1ll<<j;
        }
        else{
            // cout<<"!";
            if(ask(s-c-(1ll<<j))){
                c+=1ll<<j;
                s-=c;
            }
            else
                s-=c+(1ll<<j);
        }
        o^=1;
    }
    cout<<"= "<<c+1<<endl;




}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 13
• Subtask 3: 0 / 21
• Subtask 4: 0 / 24
• Subtask 5: 0 / 33