2025牛客暑期多校训练营2——Bitwise Perfect · znzryb

## 思路讲解

我们在想问题的时候，只要确定我们检查的数对其他数有没有增加作用，不用太想。

## AC代码

[https://ac.nowcoder.com/acm/contest/view-submission?submissionId=78290963](https://ac.nowcoder.com/acm/contest/view-submission?submissionId=78290963)



::: 源代码

```cpp
// Problem: Bitwise Perfect
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/108299/B
// Memory Limit: 1024 MB
// Time Limit: 4000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
#define pb push_back
#define SZ(a) ((int) a.size())
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
#define debug(var) cerr << #var <<":"<<var<<"\n";
#define lson(var) (var<<1)
#define rson(var) ((var<<1)+1)
#define V vector

using namespace std;

using  ll = long long;using ull = unsigned long long;
using DB=double;using LD=long double;
// using i128 = __int128;
using pdd = pair<DB,DB>;using plb = pair<ll,bool>;
using pll = pair<ll,ll>;using vll=vector<ll>;
using arr3 = array<ll,3> ;using arr2 = array<ll,2>;
constexpr ll MAXN=static_cast<ll>(1e6)+10,INF=static_cast<ll>(1e17)+9; // 1e18+9也是素数
constexpr ll MAXM=(ll)1e6+10;constexpr ll MAXV=(ll)1e6+10;
constexpr ll mod=static_cast<ll>(1e9)+7;
constexpr double eps=1e-8;const double pi=acos(-1.0);

ll N,M,Q,X,K,T,lT,A[MAXN];
/*

*/

inline void __(){
	cin>>N;
	// vector<vector<ll> > bits(N+5,vll(N+5,0));
	vll bits(76,0);
	FOR(i,1,N){
		cin>>A[i];
		bitset<70> bi(A[i]);
		FOR(j,0,67){
			if(bi[j]) bits[j]++;
		}
	}
	FOR(i,1,N){
		ll t=__lg(A[i]);
		if(bits[t]>1){
			cout<<"NO\n";
			return;
		}
	}
	cout<<"YES\n";
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	
	cin>>lT;
	while(lT--)
		__();
	return 0;
}
/*
AC
https://ac.nowcoder.com/acm/contest/view-submission?submissionId=78290963
*/
```


:::


## 心路历程（WA，TLE，MLE……）