QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#607244#8939. PermutationUESTC_OldEastWest#WA 81ms3680kbC++171.0kb2024-10-03 14:27:512024-10-03 14:27:51

Judging History

This is the latest submission verdict.

  • [2024-10-03 14:27:51]
  • Judged
  • Verdict: WA
  • Time: 81ms
  • Memory: 3680kb
  • [2024-10-03 14:27:51]
  • Submitted

answer

#include <bits/stdc++.h>

void charming() {
  int n; std::cin >> n;

  std::function<int(int, int)> Send = [&](int l, int r) {
    if (l == r) return -1;
    std::cout << "? " << l << ' ' << r << '\n';
    std::cout.flush();
    int rcv; std::cin >> rcv;
    return rcv;
  };
  
  std::function<void(int)> Answer = [&](int x) {
    std::cout << "! " << x << '\n';
    std::cout.flush();
  };

  int l = 1, r = n, p = -1;
  while (l < r) {
    if (p == -1) p = Send(l, r);

    if (l + 1 == r) {
      if (p == l) ++l;
      break;
    }
    int mid0 = l + (r - l + 2) / 3, mid1 = r - (r - l + 2) / 3;
    if (p < mid1) {
      int q = Send(l, mid1 - 1);
      if (q == p) r = mid1 - 1;
      else l = mid1, p = -1;
    }
    else {
      int q = Send(mid0, r);
      if (q == p) l = mid0;
      else r = mid0 - 1, p = -1;
    }
  }
  Answer(l);
}

signed main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);
  std::cout.tie(NULL);
  int t; std::cin >> t;
  while (t--) charming();
  return 0;
}

详细

Test #1:

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

input:

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

output:

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

result:

ok Correct (3 test cases)

Test #2:

score: 0
Accepted
time: 81ms
memory: 3580kb

input:

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

output:

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

result:

ok Correct (10000 test cases)

Test #3:

score: -100
Wrong Answer
time: 48ms
memory: 3680kb

input:

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

output:

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

result:

wrong answer Too many queries , n = 16 , now_q 7 (test case 4226)