QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#105129#6394. Turn on the LightSommohito#WA 3ms3460kbC++201.2kb2023-05-13 12:25:512023-05-13 12:25:52

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-05-13 12:25:52]
  • 评测
  • 测评结果：WA
  • 用时：3ms
  • 内存：3460kb
查看
  • [2023-05-13 12:25:51]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#ifdef APURBA
#include "DEBUG_TEMPLATE.h"
#else
#define HERE
#define debug(args...)
#endif
#define ALL(x) x.begin(),x.end()

const int N = 2e5 +5;
typedef pair<int,int> pii;

int ask(int x)
{
    cout<<"? "<<x<<endl;
    int ans;
    cin>>ans;
    return ans;
}

void TEST_CASES()
{
    int n;
    cin>>n;
    for(int i=1;i<=min(n,20);i++)
    {
        int r=ask(i);
        if(r==i-1)
        {
            cout<<"! "<<i<<endl;
            exit(0);
        }
    }
    int left=20;
    int l=21,r=n;

    while(l<=r)
    {
        int mid=(l+r)/2;
        int g=ask(mid);
        if(g==left)
        {
            cout<<"! "<<mid<<endl;
            exit(0);
        }
        if(g<left)
        {
            r=mid-1;
        }
        else
        {
            l=mid+1;
            left++;
        }
    }

}




/*
*/

int32_t main()
{
#ifndef APURBA
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    //freopen("input.txt","r",stdin);
    //freopen("out1.txt","w",stdout);
    int t=1;
    //cin>>t;
    while(t--)
    {
        TEST_CASES();
    }
    return 0;
}
源文件, 语言: C++20

詳細信息

Test #1:

score: 100
Accepted
time: 2ms
memory: 3452kb

input:

3
1
2
2

output:

? 1
? 2
? 3
! 3

result:

ok Correct position at 3

Test #2:

score: 0
Accepted
time: 3ms
memory: 3460kb

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: 3316kb

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: 2ms
memory: 3344kb

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: 3352kb

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: 3356kb

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: 2ms
memory: 3356kb

input:

5
1
2
3
3

output:

? 1
? 2
? 3
? 4
! 4

result:

ok Correct position at 4

Test #8:

score: 0
Accepted
time: 2ms
memory: 3396kb

input:

4
1
2
3
3

output:

? 1
? 2
? 3
? 4
! 4

result:

ok Correct position at 4

Test #9:

score: 0
Accepted
time: 2ms
memory: 3320kb

input:

3
1
1

output:

? 1
? 2
! 2

result:

ok Correct position at 2

Test #10:

score: 0
Accepted
time: 2ms
memory: 3452kb

input:

2
1
1

output:

? 1
? 2
! 2

result:

ok Correct position at 2

Test #11:

score: 0
Accepted
time: 2ms
memory: 3344kb

input:

1
0

output:

? 1
! 1

result:

ok Correct position at 1

Test #12:

score: -100
Wrong Answer
time: 3ms
memory: 3348kb

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
22
23

output:

? 1
? 2
? 3
? 4
? 5
? 6
? 7
? 8
? 9
? 10
? 11
? 12
? 13
? 14
? 15
? 16
? 17
? 18
? 19
? 20
? 500010
? 750005
? 875003
? 937502
? 906252
! 906252

result:

wrong answer Wrong answer, more than 1 possible light!
English 繁體中文 简体中文

伺服器時間: 2024-12-05 04:12:22 | 開源專案