QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#681252 | #8939. Permutation | Rico64 | WA | 1ms | 3540kb | C++23 | 1.5kb | 2024-10-27 03:39:54 | 2024-10-27 03:39:54 |
Judging History
answer
#include <iostream>
using namespace std;
int query(int l, int r) {
if (r - l <= 1) return -2;
cout << "? " << l + 1 << ' ' << r << endl;
cout.flush();
int re;
cin >> re;
return re - 1;
}
void submit(int i) {
cout << "! " << i + 1 << endl;
cout.flush();
}
void solve() {
int n;
cin >> n;
int l = 0, r = n, n1 = -1;
while (l < r) {
if (n1 < 0) {
n1 = query(l, r);
}
int m = (r + l) / 2;
int ml = (r + l * 3 + 1) / 4;
int mr = (r * 3 + l + 1) / 4;
if (n1 >= m) {
int q2 = query(m, r);
if (q2 == n1) {
l = m;
} else {
int q3 = ml == l ? n1 : query(ml, r);
if (q3 == n1) {
l = ml;
r = m;
n1 = -1;
} else {
r = ml;
n1 = -1;
}
}
} else {
int q2 = query(l, m);
if (q2 == n1) {
r = m;
} else {
int q3 = mr == r ? n1 : query(l, mr);
if (q3 == n1) {
l = m;
r = mr;
n1 = -1;
} else {
l = mr;
n1 = -1;
}
}
}
}
submit(l);
}
int main() {
int t;
cin >> t;
while (t--) solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3528kb
input:
3 5 3 3 3 6 6 5 6 3 4 3 3
output:
? 1 5 ? 3 5 ? 3 4 ! 4 ? 1 6 ? 4 6 ? 2 6 ? 2 3 ! 2 ? 1 4 ? 3 4 ! 4
result:
ok Correct (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3540kb
input:
10000 10 2 2 1 2 3 10 10 10 8 7 10 5 1 5 6 10 4 4 4 5 5 10 10 6 3 2 10 3 3 5 2 10 1 5 5 9 10
output:
? 1 10 ? 1 5 ? 1 2 ? 1 4 ? 3 4 ! 4 ? 1 10 ? 6 10 ? 8 10 ? 7 10 ! 6 ? 1 10 ? 1 5 ? 1 7 ? 6 7 ! 7 ? 1 10 ? 1 5 ? 3 5 ? 4 5 ? 4 5 ! 3 ? 1 10 ? 6 10 ? 3 10 ? 1 2 ! 1 ? 1 10 ? 1 5 ? 3 5 ? 2 5 ! 1 ? 1 10 ? 1 5 ? 1 7 ? 8 10 ? 9 10 ? 9 10
result:
wrong answer Too many queries , n = 10 , now_q 6 (test case 7)