Codeforces 862C Mahmoud and Ehab and the xor

$Problem:$ 找$n$个不同的且小于等于1e6的数使得异或和等于$x$$(n<=1e5, x<=1e5)$

$Idea:$
$n>2$时选择$1\sim n-3$, $1<<18$, $1<<19$,$x$^$(1<<18)$^$(1<<19)$^$res(res=1\sim n-3的异或和)$
$n=2$ && $x=0$时无解

$Code:$

#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define CLR(A, X) memset(A, X, sizeof(A))
#define bitcount(X) __builtin_popcountll(X)
typedef long long LL;
typedef pair<int, int> PII;
const double eps = 1e-10;
const int MOD = 255;
const LL INF = 1e18;
int dcmp(double x) { if(fabs(x) < eps) return 0; return x<0?-1:1; }

const int MAXN = 1e5+5;

int main() {
    int n, x;
    scanf("%d%d", &n, &x);
    if(n==2 && x==0) puts("NO");
    else {
        puts("YES");
        if(n == 1) printf("%d\n", x);
        else if(n == 2) printf("0 %d\n", x);
        else {
            int res = 0, d0 = 1<<18, d1 = 1<<19;
            for(int i = 1; i <= n-3; i++) {
                printf("%d ", i);
                res ^= i;
            }
            printf("%d %d %d\n", d0, d1, d0^d1^x^res);
        }
    }
    return 0;
}