QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #574156 | #6394. Turn on the Light | 123adad | WA | 1ms | 3732kb | C++20 | 801b | 2024-09-18 20:57:22 | 2024-09-18 20:57:22 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=2024;
void solve()
{
int n;cin>>n;
int l=1,r=n;
int a=0;
for(int i=1;i<15;i++)
{
cout<<"? "<<i<<endl;
int b;cin>>b;
if(a==b)
{
cout<<"! "<<i<<endl;
return;
}
a=b;
l=i+1;
}
while(l<r)
{
int mid=(l+r)>>1;
cout<<"? "<<mid<<endl;
int x;cin>>x;
if(a>x)
{
l=mid+1;
}
else if(a==x)
{
cout<<"! "<<mid<<endl;
return;
}
else
{
r=mid;
}
a=x;
}
if(l==r) cout<<"! "<<l<<endl;
}
int main()
{
//ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int _=1;//cin>>_;
while(_--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3644kb
input:
3 1 2 2
output:
? 1 ? 2 ? 3 ! 3
result:
ok Correct position at 3
Test #2:
score: 0
Accepted
time: 1ms
memory: 3644kb
input:
10 1 2 3 4 5 6 7 8 8
output:
? 1 ? 2 ? 3 ? 4 ? 5 ? 6 ? 7 ? 8 ? 9 ! 9
result:
ok Correct position at 9
Test #3:
score: 0
Accepted
time: 1ms
memory: 3704kb
input:
9 1 2 3 4 5 6 7 7
output:
? 1 ? 2 ? 3 ? 4 ? 5 ? 6 ? 7 ? 8 ! 8
result:
ok Correct position at 8
Test #4:
score: 0
Accepted
time: 1ms
memory: 3620kb
input:
8 1 2 3 4 5 6 6
output:
? 1 ? 2 ? 3 ? 4 ? 5 ? 6 ? 7 ! 7
result:
ok Correct position at 7
Test #5:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
7 1 2 3 4 5 5
output:
? 1 ? 2 ? 3 ? 4 ? 5 ? 6 ! 6
result:
ok Correct position at 6
Test #6:
score: 0
Accepted
time: 1ms
memory: 3732kb
input:
6 1 2 3 4 5 5
output:
? 1 ? 2 ? 3 ? 4 ? 5 ? 6 ! 6
result:
ok Correct position at 6
Test #7:
score: 0
Accepted
time: 1ms
memory: 3700kb
input:
5 1 2 3 3
output:
? 1 ? 2 ? 3 ? 4 ! 4
result:
ok Correct position at 4
Test #8:
score: 0
Accepted
time: 1ms
memory: 3588kb
input:
4 1 2 3 3
output:
? 1 ? 2 ? 3 ? 4 ! 4
result:
ok Correct position at 4
Test #9:
score: 0
Accepted
time: 1ms
memory: 3644kb
input:
3 1 1
output:
? 1 ? 2 ! 2
result:
ok Correct position at 2
Test #10:
score: 0
Accepted
time: 1ms
memory: 3580kb
input:
2 1 1
output:
? 1 ? 2 ! 2
result:
ok Correct position at 2
Test #11:
score: 0
Accepted
time: 1ms
memory: 3572kb
input:
1 0
output:
? 1 ! 1
result:
ok Correct position at 1
Test #12:
score: -100
Wrong Answer
time: 1ms
memory: 3692kb
input:
1000000 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34
output:
? 1 ? 2 ? 3 ? 4 ? 5 ? 6 ? 7 ? 8 ? 9 ? 10 ? 11 ? 12 ? 13 ? 14 ? 500007 ? 250011 ? 125013 ? 62514 ? 31264 ? 15639 ? 7827 ? 3921 ? 1968 ? 991 ? 503 ? 259 ? 137 ? 76 ? 45 ? 30 ? 22 ? 18 ? 16 ? 15 ! 15
result:
wrong answer Wrong answer, more than 1 possible light!