# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
514793 |
2022-01-18T13:27:00 Z |
kabika |
Colors (BOI20_colors) |
C++14 |
|
1 ms |
200 KB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n{};
cin>>n;
int last{n}, query{n}, reply{};
pair<int,int> bound{1,n};
cout<<"? "<<query;
cin>>reply;
query/=2;
while(bound.first!=bound.second && query>=1 && query<=n)
{
cout<<"? "<<query;
cin>>reply;
if(reply==1)
{
bound.second = abs(last-query);
last = query;
query-=(bound.first+bound.second-1)/2;
}
else
{
bound.first = abs(last-query)+1;
last = query;
query+=(bound.first+bound.second-1)/2;
}
}
cout<<"= "<<bound.first;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
0 ms |
200 KB |
Time limit exceeded (wall clock) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1 ms |
200 KB |
Time limit exceeded (wall clock) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1 ms |
200 KB |
Time limit exceeded (wall clock) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1 ms |
200 KB |
Time limit exceeded (wall clock) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
0 ms |
200 KB |
Time limit exceeded (wall clock) |
2 |
Halted |
0 ms |
0 KB |
- |