QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #688755 | #8939. Permutation | lqh2024 | WA | 1ms | 3844kb | C++20 | 2.6kb | 2024-10-30 13:23:57 | 2024-10-30 13:23:57 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
mt19937_64 rng(time(0));
template <class T, class ... A> void debug(T t, A ... a) {
cerr << "[" << t, ((cerr << ", " << a), ...), cerr << "]\n";
}
void QAQ() {
int n;
cin >> n;
vector<int> a(n + 1);
auto query = [&](int l, int r, int x = -1) {
cout << "? " << l << " " << r << endl;
return cin >> x, x;
};
auto answer = [&](int n) {
cout << "! " << n << endl;
};
int lst = query(1, n);
auto F = [&](auto && self, int l, int r) {
if (l >= r) return answer(l);
if (l + 1 == r) {
if (l == lst) return answer(r);
else return answer(l);
}
int m = l + 0.5 * (r - l), tmp = rng() % 2;
if (m == r) m--;
if (l + 2 == r) {
m = l;
tmp = query(m + 1, r);
if (l == lst) {
if (tmp == r) return answer(m + 1);
else return answer(r);
} else {
if (tmp == lst) return answer(tmp == r ? r - 1 : r);
else return answer(l);
}
}
// if (tmp) {
tmp = query(l, m);
if (tmp == lst) {
lst = tmp;
return self(self, l, m);
} else if (lst <= m) {
lst = query(m + 1, r);
return self(self, m + 1, r);
} else {
int t = query(m + 1, r);
if (t == lst) {
lst = t;
return self(self, m + 1, r);
} else {
lst = tmp;
return self(self, l, m);
}
}
// } else {
// tmp = query(m + 1, r);
// if (tmp == lst) {
// lst = tmp;
// return self(self, m + 1, r);
// } else if (lst > m) {
// lst = query(l, m);
// return self(self, l, m);
// } else {
// int t = query(l, m);
// if (t == lst) {
// lst = t;
// return self(self, l, m);
// } else {
// lst = tmp;
// return self(self, m + 1, r);
// }
// }
// }
};
F(F, 1, n);
}
signed main() {
cin.tie(0) -> sync_with_stdio(0);
int t = 1;
cin >> t;
for (cout << fixed << setprecision(12); t--; QAQ());
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3844kb
input:
3 5 3 2 5 6 6 3 5 3 4 3 1 3
output:
? 1 5 ? 1 3 ? 4 5 ! 4 ? 1 6 ? 1 3 ? 4 6 ? 2 3 ! 2 ? 1 4 ? 1 2 ? 3 4 ! 4
result:
ok Correct (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3684kb
input:
10000 10 2 2 3 5 10 10 5 10 7 9
output:
? 1 10 ? 1 5 ? 1 3 ? 4 5 ! 4 ? 1 10 ? 1 5 ? 6 10 ? 6 8 ? 9 10 ? 7 8
result:
wrong answer Too many queries , n = 10 , now_q 6 (test case 2)