Jon Snow and his Favourite Number CodeForces - 768C (技巧)

链接

题意

给定数组, 每次操作先将数组排序, 再将奇数位全部异或x, 求k次操作后数组最大值与最小值

(1 ≤ n ≤ 10⁵, 0 ≤ k ≤ 10⁵, 0 ≤ x ≤ 10³)

题解

直接暴力模拟是O(nk)的, 注意到元素范围均较小可以用桶达到O(1024*k)

该题k过大时会好像一定出现循环, 然后暴力模拟几次也能过, 没看出来怎么证明...

#include <iostream>
#include <cstdio>
#include <algorithm>
#define REP(i,a,n) for(int i=a;i<=n;++i)
using namespace std;

const int N = 1e5+;
int n, k, x, t;
int a[N], delta[N];

int main() {
    cin>>n>>k>>x;
    REP(i,,n) cin>>t, ++a[t];
    REP(i,,k) {
        REP(i,,) delta[i] = ;
        int cur = ;
        REP(i,,) {
            int cnt = (a[i]+cur)/;
            delta[i] -= cnt;
            delta[i^x] += cnt;
            cur ^= a[i]&;
        }
        REP(i,,) a[i] += delta[i];
    }
    int mi = 1e9, ma = ;
    REP(i,,) if (a[i]) {
        mi = min(mi, i);
        ma = max(ma, i);
    }
    cout<<ma<<' '<<mi<<endl;
}