QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#455909 | #8819. CNOI Knowledge | ucup-team4074 | WA | 1ms | 3548kb | C++14 | 712b | 2024-06-27 00:03:07 | 2024-06-27 00:03:07 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N = 1005;
int n, cnt(0), col[N];
int check(int l, int r) {
int x;
cout << "? " << l << " " << r;
cout.flush();
cin >> x;
return x == ((r - l + 1) * (r - l + 2) / 2);
}
signed main() {
cin >> n;
for (int i = 1; i <= n; i++) {
int l(1), r(i);
while (l < r) {
int mid((l + r) >> 1);
if (check(mid, i))r = mid;
else l = mid + 1;
}
if (l == 1) {
col[i] = ++cnt;
} else col[i] = col[l - 1];
cout << col[i] << '\n';
}
cout << "! ";
for (int i = 1; i <= n; i++)cout << col[i] << " ";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3548kb
input:
12
output:
1 ? 1 2
result:
wrong answer Invalid output.