异或+桶——cf768C

有个结论是到最后肯定出现循环节。。感觉这种做法有点歪

正解当然是题解啦

虽然到了1e8，但是cf上还是能过的

#include<bits/stdc++.h>
#define rep(i,start,lim) for(int i=start;i<lim;i++)
using namespace std;
#define N 100005
int freq[],tmp[];
int main()
{
    int n,k,maxm=,minm=INT_MAX,p,x;
    cin>>n>>k>>x;
    rep(i,,n) cin>>p,freq[p]++;
    rep(i,,k)
    {
        rep(j,,) tmp[j]=freq[j];
        int par=;
        rep(j,,)
        {
            if(freq[j]>)
            {
                int curr = (j^x),change = (freq[j]/);
                if(par==) change+=(freq[j]&);
                tmp[j]-=change;
                tmp[curr]+=change;
                par^=(freq[j]&);
            }
        }
        rep(j,,) freq[j]=tmp[j];
    }
    rep(i,,) if(freq[i]>) minm=min(minm,i),maxm=max(maxm,i);
    cout<<maxm<<" "<<minm;
    return ;
}