Submission #1335676

#TimeUsernameProblemLanguageResultExecution timeMemory
1335676ezzzayDark Ride (EGOI25_darkride)C++20
16 / 100
14 ms436 KiB
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define ll long long
const int N=1e6;
int a[N];
int fo[N];
int mn[N];
signed main(){
    int n;
    cin>>n;
    vector<int>vc;
    int lo=0,hi=n/2-1;
    int L=0,R=n/2-1;
    while(hi>=lo){
        int mid=(hi+lo)/2;
        cout<<"? ";
        for(int i=0;i<=mid;i++)cout<<'1';
        for(int i=mid+1;i<n;i++)cout<<'0';
        cout<<endl;
        int x;
        cin>>x;
        if(x%2){
            hi=mid-1;
        }
        else{
            lo=mid+1;
        }
    }int h=lo;
    
    lo=n/2,hi=n-1;
    L=n/2;
    while(hi>=lo){
        int mid=(hi+lo)/2;
        cout<<"? ";
        for(int i=0;i<n/2;i++)cout<<'0';
        for(int i=n/2;i<=mid;i++)cout<<'1';
        for(int i=mid+1;i<n;i++)cout<<'0';
        cout<<endl;
        int x;
        cin>>x;
        if(x%2){
            hi=mid-1;
        }
        else{
            lo=mid+1;
        }
    }
    cout<<"! "<<h<<" "<<lo<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...