icontofig | 发布于 2019-08-08 14:16:06 | 阅读量 297 | 二分

There is an array of length N consisting of non-negative integers. The array is sorted in non-decreasing order. Each number in the array appears exactly K times, except one element, which appears at least once, but less than K times. Your task is to identify that element.

This is an interactive problem. You are only given the integer N in the input. Both the array and the value of K are hidden. You are allowed to ask the judge the following queries: What is the value of the element at index i of the array? Identify the value of the element with frequency less than K by asking at most 60 such queries.

### Input and Output

The first line of the input contains a single integer T denoting the number of test cases.

For each test case, you should start by reading a single line containing one integer N from the input.

You can interact with the judge using the standard input and output. There are two types of operations: to perform one operation, you should print to the standard output a line containing two space-separated integers type and val.

• If type = 1, you are asking the judge a query for the value of the element of the array at index val. After printing this line, the judge will print to the standard input a line containing one integer corresponding to the value of the element at index val.
• If type = 2, you are telling the judge that the element with frequency less than K is val. For each test case, you should perform this operation exactly once at the end. This is not counted towards the 60 queries.

### Note

Don't forget to flush the standard output after printing each line. It can be done using fflush(stdout) in C/C++, System.out.flush() in Java and sys.out.flush() in Python.

### Constraints

• 1 ≤ T ≤ 104
• 3 ≤ N ≤ 105
• 2 ≤ K ≤ N - 1
• each element of the array lies between 1 and 109 inclusive

### Example

```Input / judge feedback	your output
1
3
1 2
1
1 3
5
1 1
1
2 5```

### Explanation

Example case 1: Suppose the array is [1, 1, 5]. Note that the value of K is 2, but it is hidden from you.

In the first query, you request the value of the 2nd element and the judge answers 1. Then you request the value of the 3rd element and the judge answers 5, then the value of the first element and the judge answers 1.

Now, you tell the judge that the answer is 5. You made a total of 3 queries.

## 代码

```#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+5;
int T,n;
int mp[maxn];
int main(){
scanf("%d",&T);
while (T--){
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
mp[i] = -1;
printf("1 1\n");
fflush(stdout);
scanf("%d", &mp);
printf("1 %d\n", n);
fflush(stdout);
scanf("%d", &mp[n]);
int l = 1, r = n;
int k = 0;
while (l <= r){
int mid = (l + r) >> 1;
if (mp[mid] == -1){
printf("1 %d\n",mid);
fflush(stdout);
scanf("%d",&mp[mid]);
}
if (mp < mp[mid])
r = mid - 1;
else{
k = max(k,mid);
l = mid + 1;
}
}
if (mp[n - k] == -1){
printf("1 %d\n", n - k);
fflush(stdout);
scanf("%d", &mp[n - k]);
}
if (mp[n - k] == mp[n]){
printf("2 %d\n", mp);
fflush(stdout);
continue;
}
if (mp[n - k + 1] == -1){
printf("1 %d\n", n - k + 1);
fflush(stdout);
scanf("%d", &mp[n - k + 1]);
}
if (mp[n - k + 1] != mp[n]){
printf("2 %d\n", mp[n]);
fflush(stdout);
continue;
}
int ans = 2147483647;
l = k+1,r = n-k;
while (l <= r){
int mid = (l + r) >> 1;
if (mp[mid - (mid-1) % k] == -1){
printf("1 %d\n",mid - (mid-1) % k);
fflush(stdout);
scanf("%d",&mp[mid - (mid-1) % k]);
}
if (mp[mid - (mid-1) % k + k - 1] == -1){
printf("1 %d\n", mid - (mid-1) % k + k - 1);
fflush(stdout);
scanf("%d", &mp[mid - (mid-1) % k + k - 1]);
}
if (mp[mid - (mid-1) % k] == mp[mid - (mid-1) % k + k - 1]){
l = mid + 1;
}
else{
ans = mp[mid-(mid-1)%k];
r = mid - 1;
}
}
printf("2 %d\n",ans);
fflush(stdout);
}
return 0;
}```

297 人读过

0 条评论 