QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#557917 | #8939. Permutation | aaaaa | WA | 1ms | 3692kb | C++23 | 1.7kb | 2024-09-11 12:19:29 | 2024-09-11 12:19:29 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll T;
ll N;
ll ret;
ll l, r;
ll current, st;
ll query(ll x, ll y) {
cout << "? " << x << " " << y << endl;
cin >> ret;
return ret;
}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> T;
while (T--) {
cin >> N;
if (N == 1) {
cout << "! " << 1 << endl;
continue;
}
l = 1;
r = N;
st = query(1, N);
while (r-l > 2) {
current = l+(r-l+1)*0.618-1;
if (st < current) {
if (query(l, current) == st) {
r = current;
}
else {
st = query(current+1, r);
l = current+1;
}
}
else {
current = r-(r-l+1)*0.618;
if (query(current+1, r) == st) {
l = current+1;
}
else {
st = query(l, current);
r = current;
}
}
}
if (l == r-1) {
if (st == l) {
l = r;
}
}
else {
if (st < l+1) {
if (query(l, l+1) == st) {
if (st == l) {
++l;
}
}
else {
l = r;
}
}
else {
if (query(l, l+1) == l) {
++l;
}
}
}
cout << "! " << l << endl;
}
return 0;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3692kb
input:
3 5 3 3 3 3 6 6 3 1 4 3 3 2
output:
? 1 5 ? 2 5 ? 3 5 ? 3 4 ! 4 ? 1 6 ? 3 6 ? 1 2 ! 2 ? 1 4 ? 2 4 ? 2 3 ! 3
result:
wrong answer Wrong prediction (test case 3)