QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#684461 | #8939. Permutation | real_sigma_team# | WA | 1ms | 3540kb | C++23 | 1.0kb | 2024-10-28 13:43:00 | 2024-10-28 13:43:01 |
Judging History
answer
#include<bits/stdc++.h>
int main() {
// std::cin.tie(nullptr)->sync_with_stdio(false);
int tests;
std::cin >> tests;
while (tests--) {
int n;
std::cin >> n;
auto rec = [&](auto rec, int l, int r, int p) -> void {
if (l == r) {
std::cout << "! " << l << std::endl;
return;
}
if (p == -1) {
std::cout << "? " << l << ' ' << r << std::endl;
std::cin >> p;
}
if (r - l == 1) {
if (l == p) std::cout << "! " << r << std::endl;
else std::cout << "! " << l << std::endl;
return;
}
double phi = (sqrt(5) - 1) / 2;
int len = (r - l + 1) * phi;
int m1 = l + len;
int m2 = r - len;
if (p > m1) {
std::cout << "? " << m1 + 1 << ' ' << r << std::endl;
int shq;
std::cin >> shq;
if (shq == p) rec(rec, m1 + 1, r, p);
else rec(rec, l, m1, -1);
} else {
std::cout << "? " << l << ' ' << m2 << std::endl;
int shq;
std::cin >> shq;
if (shq == p) rec(rec, l, m2, p);
else rec(rec, m2 + 1, r, -1);
}
};
rec(rec, 1, n, -1);
}
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3540kb
input:
3 5 3 1 3 3 6 6 5 3 1
output:
? 1 5 ? 1 2 ? 3 5 ? 3 4 ! 4 ? 1 6 ? 5 6 ? 1 4 ? 1 2 ? 3 4
result:
wrong answer Too many queries , n = 6 , now_q 5 (test case 2)