CodeForces 1556D :Take a Guess 位运算

最新推荐文章于 2023-03-13 20:59:38 发布

匿枫

最新推荐文章于 2023-03-13 20:59:38 发布

阅读量126

点赞数

分类专栏：大学ACM 文章标签： c语言算法

本文链接：https://blog.csdn.net/tlyzxc/article/details/120079618

版权

大学ACM 专栏收录该内容

162 篇文章 5 订阅

订阅专栏

传送门

题意

在这里插入图片描述

分析

推出公式 $\& a[j]) + (a[i] | a[j])$ 就好了
交互题注意格式，注意格式，注意格式
重要的事情重复三遍

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
ll sum[N],a[N];
int n,m;

int main() {
	scanf("%d %d",&n,&m);
	for(int i = 2;i <= n;i++){
		printf("and %d %d\n", 1, i);
		ll x,y;
		cin >> x;
		printf("or %d %d\n", 1, i);
		cin >> y;
		a[i] = y + x;
	}
	ll x,y;
	printf("and %d %d\n", 2, 3);
	cin >> x;
	printf("or %d %d\n", 2, 3);
	cin >> y;
	a[1] = (a[2] + a[3] - x - y) / 2;
	for(int i = 2;i <= n;i++) a[i] = a[i] - a[1];
	sort(a + 1,a + 1 + n);
	printf("finish %lld", a[m]);
	return 0; 

}