样例和讨论区的HACK全过，WA了

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=300000;
int n,m;
int a[N+5];
int vis[N+5];
bool cmp(int l1,int l2){
	return l1>l2;
}
signed main(){
	scanf("%lld",&n);
	m=(1<<n);
	for(int i=1;i<=m;i++) scanf("%lld",&a[i]);
	sort(a+1,a+1+m,cmp);
	vis[1]=INT_MAX;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(!vis[j] || vis[j]==i) continue;
			int l=1,r=m;
			int wz=0;
			while(l<=r){
				int mid=(l+r)>>1;
				if(a[mid]<a[j] && !vis[mid]){
					wz=mid;
					r=mid-1;
				}
				else l=mid+1;
			}
			vis[wz]=i;
		}
	}
	int cnt=0;
	for(int i=1;i<=m;i++){
		if(vis[i]) cnt++;
	}
	printf(cnt==m?"Yes":"No");
	return 0;
}