传送门
题目描述
一共有 2 m 2 ^ m 2m个长度为 m m m的二进制数,现在要删去 n n n个长度为 m m m的二进制数,求剩下的所有数中的中位数的二进制形式是多少
分析
今天上线突然发现有一场d3没补完,点开来看了看感觉,,好水啊
我们去暴力把每一个二进制数转化成十进制,然后计算一下如果无视这
n
n
n个数,
2
m
−
n
2 ^ m - n
2m−n的中位数是多少,判断二分一下有多少删除数字在
0
∼
(
2
m
−
n
)
0 \sim (2 ^ m - n)
0∼(2m−n)之间,然后往后挪即可,因为
n
n
n最大为
60
60
60,所以最多挪动
60
60
60次即可
代码
#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 a[N];
ll t;
ll n,m;
map<ll,int> M;
char str[N];
ll run(){
ll res = 0;
for(ll i = 1;i <= m;i++){
if(str[i] == '1') res += (1ll << (m - i));
}
M[res] = 1;
return res;
}
void print(ll x){
int idx = 0;
int ans[N];
while(x){
ans[++idx] = x % 2;
x /= 2;
}
for(int i = idx;i < m;i++) printf("0");
for(int i = idx;i;i--) printf("%d",ans[i]);
puts("");
}
int main(){
int T;
read(T);
while(T--){
read(n),read(m);
M.clear();
memset(a,0,sizeof a);
for(ll i = 1;i <= n;i++){
scanf("%s",str + 1);
a[i] = run();
}
ll t = 0;
for(ll i = 0;i < m;i++) t += (1ll << i);
sort(a + 1,a + 1 + n);
ll ans = t - n;
ans = ans / 2;
int p = upper_bound(a + 1,a + 1 + n,ans) - a;
p--;
while(p--){
ans++;
while(M[ans]) ans++;
}
print(ans);
}
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/