mirror of
https://github.com/Kiritow/OJ-Problems-Source.git
synced 2024-03-22 13:11:29 +08:00
107 lines
3.2 KiB
C++
107 lines
3.2 KiB
C++
#include <iostream>
|
|
#include <cstdio>
|
|
#include <algorithm>
|
|
#include <bitset>
|
|
#include <vector>
|
|
#include <ctime>
|
|
using namespace std;
|
|
typedef long long LL;
|
|
const int N = 100000;
|
|
const int M = 50;
|
|
const LL MAXS = 1LL<<50;
|
|
const LL MAXT = (LL)1e16;
|
|
inline LL two( int x ) { return 1LL<<x; }
|
|
LL f[M+1][N+5], g[M+1][N+5], a[N+5];
|
|
int ran[2][2][N+5];
|
|
int n , m;
|
|
LL s;
|
|
void solve( LL t , LL &ans1, LL &ans2) {
|
|
fill( f[0], f[0]+n+1, 0 );
|
|
fill( g[0], g[0]+n+1, 0 );
|
|
f[0][0] = 1;
|
|
int bits[55], bitt[55];
|
|
for( int i = 0 ; i < m; ++i ) {
|
|
bits[i] = (s&two(i))>0;
|
|
bitt[i] = (t&two(i))>0;
|
|
}
|
|
ran[0][0][0] = n;
|
|
ran[0][1][0] = 0;
|
|
for( int i = 1; i <= n; ++i ) {
|
|
ran[0][0][i] = i-1;
|
|
}
|
|
for( int i = 1; i <= m; ++i ) {
|
|
int cur = i&1, pre = cur^1 ;
|
|
fill( f[i], f[i]+n+1, 0 );
|
|
fill( g[i], g[i]+n+1, 0 );
|
|
for( int j = 0 ; j < 2; ++j ) ran[cur][j][0] = 0;
|
|
for( int j = 1 ; j >= 0; --j ) {
|
|
for( int k = 1 ; k <= ran[pre][j][0]; ++k ) {
|
|
int idx = ran[pre][j][k];
|
|
if( a[idx] & two(i-1) ) ran[cur][1][ ++ran[cur][1][0] ] = idx ;
|
|
else ran[cur][0][ ++ran[cur][0][0] ] = idx ;
|
|
}
|
|
}
|
|
int oneCnt = 0, curOnes = ran[cur][1][0], curZeros = ran[cur][0][0];
|
|
for( int j = 0; j <= n; ++j ) {
|
|
int idx = -1, presize1 = ran[pre][1][0];
|
|
if( j > presize1 ) {
|
|
idx = ran[pre][0][j-presize1];
|
|
} else {
|
|
if( j > 0 ) idx = ran[pre][1][j];
|
|
}
|
|
if( idx != -1 && (a[idx]&two(i-1)) != 0 ) {
|
|
++oneCnt;
|
|
}
|
|
int tBit = bitt[i-1];
|
|
int curOne = curOnes + j - 2*oneCnt;
|
|
if( (curOne&1) == bits[i-1] ) {
|
|
if( tBit == 0 ) {
|
|
f[i][ oneCnt ] += f[i-1][j];
|
|
g[i][ oneCnt ] += g[i-1][j];
|
|
} else {
|
|
f[i][ oneCnt ] += f[i-1][j]+g[i-1][j];
|
|
}
|
|
}
|
|
curOne = curZeros - j + 2*oneCnt;
|
|
int nextOne = j + curOnes - oneCnt;
|
|
if( (curOne&1) == bits[i-1] ) {
|
|
if( tBit == 0 ) {
|
|
g[i][ nextOne ] += g[i-1][j] + f[i-1][j];
|
|
} else {
|
|
f[i][ nextOne] += f[i-1][j];
|
|
g[i][ nextOne] += g[i-1][j];
|
|
}
|
|
}
|
|
}
|
|
}
|
|
ans1 = ans2 = 0;
|
|
for( int i = 0 ; i <= n; ++i ) {
|
|
ans1 += f[m][i];
|
|
ans2 += g[m][i];
|
|
}
|
|
ans2 += ans1;
|
|
return ;
|
|
}
|
|
int main() {
|
|
LL t;
|
|
int start = clock();
|
|
while( scanf("%d%d%lld%lld",&n,&m,&s,&t) != EOF ) {
|
|
if( t > MAXT ) {
|
|
cerr<<t<<" "<<MAXT<<endl;
|
|
}
|
|
LL x = 0;
|
|
for( int i = 0 ; i < n; ++i ) {
|
|
scanf("%lld",&a[i]);
|
|
x ^= a[i];
|
|
}
|
|
LL M = 1LL << m, loops = t/M;
|
|
LL ans1, ans2;
|
|
solve( t%M ,ans1, ans2);
|
|
loops *= ans2;
|
|
loops += ans1;
|
|
if( x == s ) loops--;
|
|
printf("%lld\n", loops);
|
|
}
|
|
return 0;
|
|
}
|