oj.uz

Submission #720359

# Submission time Handle Problem Language Result Execution time Memory
720359 2023-04-08T05:05:16 Z n0sk1ll Colors (BOI20_colors) C++14
0 / 100
 1 ms 208 KB 
#include <bits/stdc++.h>

#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)

using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;







//Note to self: Check for overflow

bool ask(li x) //da li njen decko noticuje promenu
{
    cout<<"? "<<x<<endl;
    bool verd; cin>>verd; return verd;
}

int main()
{
    FAST;

    li n; cin>>n;


    if (n<=64)
    {
        int l=1,r=n;
        if (l==r) return cout<<"= 1",0;
        ask(l++);
        while (l!=r)
        {
            if (!ask(r)) return cout<<"= "<<r-l+2,0;
            r--;

            if (l!=r)
            {
                if (!ask(l)) return cout<<"= "<<r-l+2,0;
                l++;
            }
        }
        cout<<"= 1";
    }
}

//Note to self: Check for overflow

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB OK (5 queries)
2 Correct 0 ms 208 KB OK (6 queries)
3 Incorrect 1 ms 208 KB Wrong guess
4 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB OK (5 queries)
2 Correct 0 ms 208 KB OK (6 queries)
3 Incorrect 1 ms 208 KB Wrong guess
4 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB OK (5 queries)
2 Correct 0 ms 208 KB OK (6 queries)
3 Incorrect 1 ms 208 KB Wrong guess
4 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB OK (5 queries)
2 Correct 0 ms 208 KB OK (6 queries)
3 Incorrect 1 ms 208 KB Wrong guess
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB OK (5 queries)
2 Correct 0 ms 208 KB OK (6 queries)
3 Incorrect 1 ms 208 KB Wrong guess
4 Halted 0 ms 0 KB -