Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2) D. Take a Guess

传送门

题意：

有一个长度为n的隐藏数列，你可以询问最多2*n次数列中某两个位置的数的与或者并，问你这个数列中倒数第k大的数是多少。

思路：

结论：a+b = a&b+a|b，所以，我们可以求得$a_1$与其它数的和，再次询问获得$a_2+a_3$的和，通过$a_1+a_2与a_2+a_3与a_1+a_3$可以求得$a_1$的值，从而求出所有数的值。

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<map>
#include<queue>
#include<math.h>
#include<vector>
using namespace std;
#define ll long long
ll o[10010];
ll a[10010];
ll c[10010];
ll ans[10010];

int main()
{
	int n,k;
	cin>>n>>k;
	for(int i = 2; i <= n; i++)
	{
		cout<<"or "<<1<<" "<<i<<endl;
		fflush(stdout);
		scanf("%lld",&o[i]);
		cout<<"and "<<1<<" "<<i<<endl;
		fflush(stdout);
		scanf("%lld",&a[i]);
		c[i] = o[i]+a[i];
	}
	cout<<"or "<<2<<" "<<3<<endl;
	fflush(stdout);
	ll sum = 0;
	scanf("%lld",&sum);
	ll d = 0;
	cout<<"and "<<2<<" "<<3<<endl;
	fflush(stdout);
	scanf("%lld",&d);
	sum += d;
	d = c[2]-c[3];
	ll a2 = (sum+d)/2;
	ans[1] = c[2]-a2;
	for(int i = 2; i <= n; i++)
	{
		ans[i] = c[i]-ans[1];
	}
	sort(ans+1, ans+1+n);
	printf("finish %lld\n",ans[k]);
}