QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#599483#8939. PermutationzookeeperWA 111ms3684kbC++141.2kb2024-09-29 05:31:042024-09-29 05:31:04

Judging History

This is the latest submission verdict.

  • [2024-09-29 05:31:04]
  • Judged
  • Verdict: WA
  • Time: 111ms
  • Memory: 3684kb
Show
  • [2024-09-29 05:31:04]
  • Submitted

answer

#include <bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;

//double PHI = (sqrt(5) - 1)/2;
double PHI = 0.6667;
int solve() {
    int N;
    cin >> N;
    int L = 1, R = N, S = -1;
    while (true) {
        if (L == R) return L;
        if (S == -1) {
            cout << "? " << L << ' ' << R << endl;
            cin >> S;
        }
        if (L + 1 == R) {
            return S == L ? R : L;
        }
        if (S <= (L + R)/ 2) {
            int M = L + int((R - L) * PHI);
            cout << "? " << L << ' ' << M << endl;
            int S1;
            cin >> S1;
            if (S1 == S) {
                R = M;
            } else {
                L = M+1;
                S = -1;
            }
        } else {
            int M = R - int((R - L) * PHI);
            cout << "? " << M << ' ' << R << endl;
            int S1;
            cin >> S1;
            if (S1 == S) {
                L = M;
            } else {
                R = M-1;
                S = -1;
            }
        }
    }
}

int main() {
    fastio;
    int T;
    cin >> T;
    for (;T>0;T--) {
        int s = solve();
        cout << "! " << s << endl;
    }
}
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3684kb

input:

3
5
3
2
5
6
6
3
1
4
3
3
2

output:

? 1 5
? 1 3
? 4 5
! 4
? 1 6
? 3 6
? 1 2
! 2
? 1 4
? 2 4
? 2 3
! 4

result:

ok Correct (3 test cases)

Test #2:

score: 0
Accepted
time: 83ms
memory: 3548kb

input:

10000
10
2
2
2
3
5
10
10
10
10
8
7
10
5
5
5
4
6
10
4
4
4
4
4
10
10
6
3
2
10
3
3
3
3
2
10
1
5
9
9
10
1
1
3
6
10
2
4
9
8
10
3
3
3
1
5
10
4
7
8
9
10
8
7
1
2
10
4
1
9
8
10
7
7
7
8
4
10
5
1
8
8
10
8
8
8
6
9
10
2
2
1
7
10
6
6
4
10
10
1
1
3
6
10
7
9
1
2
10
7
4
1
2
10
3
4
10
10
10
4
4
4
4
3
10
8
7
2
2
10
8
...

output:

? 1 10
? 1 7
? 1 5
? 1 3
? 4 5
! 4
? 1 10
? 4 10
? 6 10
? 8 10
? 6 7
! 6
? 1 10
? 1 7
? 3 7
? 3 5
? 6 7
! 7
? 1 10
? 1 7
? 1 5
? 3 5
? 3 4
! 3
? 1 10
? 4 10
? 1 3
? 2 3
! 1
? 1 10
? 1 7
? 1 5
? 1 3
? 2 3
! 1
? 1 10
? 1 7
? 8 10
? 8 9
! 8
? 1 10
? 1 7
? 1 5
? 6 7
! 7
? 1 10
? 1 7
? 8 10
? 8 9
! 10
? ...

result:

ok Correct (10000 test cases)

Test #3:

score: 0
Accepted
time: 56ms
memory: 3624kb

input:

10000
3
1
2
11
5
5
5
3
7
2
2
19
3
3
4
13
12
7
5
5
5
4
3
3
3
19
6
6
6
7
1
2
2
2
15
11
11
11
11
11
10
14
1
1
1
1
3
16
4
4
4
1
7
3
3
2
19
13
17
5
5
6
2
2
4
1
3
7
2
2
2
2
3
2
2
17
1
1
1
1
2
4
14
9
9
9
9
9
8
20
9
9
9
6
13
13
6
4
4
3
18
7
7
7
7
5
9
8
8
8
6
5
8
6
6
6
5
16
10
10
10
10
10
10
6
1
1
3
10
3
3
3...

output:

? 1 3
? 1 2
! 3
? 1 11
? 1 7
? 3 7
? 3 5
? 6 7
! 6
? 1 2
! 1
? 1 19
? 1 13
? 1 9
? 10 13
? 11 13
! 10
? 1 7
? 3 7
? 3 5
? 4 5
! 3
? 1 3
? 2 3
! 2
? 1 19
? 1 13
? 1 9
? 4 9
? 1 3
? 1 2
! 3
? 1 2
! 1
? 1 15
? 6 15
? 9 15
? 9 13
? 9 11
? 10 11
! 9
? 1 14
? 1 9
? 1 6
? 1 4
? 1 3
! 4
? 1 16
? 1 11
? 1 7
...

result:

ok Correct (10000 test cases)

Test #4:

score: 0
Accepted
time: 111ms
memory: 3672kb

input:

10000
47
23
23
31
2
2
2
1
5
14
8
8
8
7
11
25
6
6
4
13
13
13
12
7
4
4
4
3
9
2
2
2
2
2
27
27
27
27
27
24
21
20
21
7
7
7
7
6
5
43
41
21
7
7
8
3
3
22
6
14
20
20
19
21
34
29
29
25
17
17
17
16
42
20
20
20
20
20
20
20
19
47
21
21
21
21
21
19
16
17
41
25
25
30
33
33
34
38
19
17
17
17
16
12
12
21
14
14
14
14...

output:

? 1 47
? 1 31
? 11 31
? 1 10
? 1 7
? 1 5
? 1 3
? 4 5
! 4
? 1 14
? 6 14
? 6 11
? 6 9
? 10 11
! 10
? 1 25
? 1 17
? 1 11
? 12 17
? 12 15
? 12 14
? 12 13
! 14
? 1 7
? 1 5
? 3 5
? 3 4
! 5
? 1 9
? 1 6
? 1 4
? 1 3
? 1 2
! 1
? 1 27
? 10 27
? 16 27
? 20 27
? 23 27
? 20 22
? 20 21
! 22
? 1 21
? 1 14
? 1 9
? 4...

result:

ok Correct (10000 test cases)

Test #5:

score: -100
Wrong Answer
time: 10ms
memory: 3596kb

input:

10000
100
47
61
93
96
71
71
71
71
71
9
2
2
2
2
1
53
46
35
6
6
6
6
6
6
33
3
16
31
31
31
29
32
82
60
29
4
8
23
21
26
26
88
39
39
39
25
59
59
59
59
59
59
71
24
29
59
59
59
59
60
63
92
52
52
45
88
88
88
85
91
91
24
11
11
9
5
5
5
66
51
51
51
51
45
39
39
40
92
43
43
50
20
20
20
20
20
20
19
48
1
1
1
1
1
5
...

output:

? 1 100
? 1 67
? 68 100
? 79 100
? 68 78
? 68 74
? 68 72
? 70 72
? 70 71
! 70
? 1 9
? 1 6
? 1 4
? 1 3
? 1 2
! 3
? 1 53
? 19 53
? 1 18
? 1 12
? 1 8
? 4 8
? 4 6
? 5 6
! 5
? 1 33
? 1 22
? 23 33
? 27 33
? 29 33
? 29 31
? 32 33
! 33
? 1 82
? 28 82
? 1 27
? 1 18
? 19 27
? 19 24
? 25 27
? 25 26
! 25
? 1 88...

result:

wrong answer Too many queries , n = 94 , now_q 11 (test case 475)
English 繁體中文 简体中文

Server Time: 2025-02-09 13:26:24 | OpenSource Project