Codeforces Round #750 (Div. 2)的其他题解点我
F1. Korney Korneevich and XOR (easy version)
题目大意:
给出一个长度为n的序列,问其递增子序列的异或和有多少种情况,并输出所有情况
子序列为原序列删除若干个元素得到的序列
思路:
DP,因为ai最大只有500,异或和最大也就是512,用dp[j]表示异或和为j的递增子序列中的末尾值的最小值,只要ai比这个最小值大,我们就可以把x和j异或起来,更新dp[x ^ j]
AC代码:
#include <bits/stdc++.h>
#define PII pair<int,int>
#define ll long long
using namespace std;
const double eps = 1e-8;
const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;
const int INF = 0x7fffffff;
inline void swap(int &x, int &y){x^=y^=x^=y;}
inline int gcd(int a,int b) {return !b ? a : gcd(b,a%b);}
int dp[maxn];
int main(){
int n;
scanf("%d", &n);
for(int i = 1; i <= 512; ++i)dp[i] = INF;
dp[0] = 0;
for(int i = 1; i <= n; ++i){
int x;
scanf("%d", &x);
for(int j = 0; j <= 512; ++j){
if(x > dp[j])dp[j ^ x] = min(dp[j ^ x], x);
}
}
int cnt = 0;
for(int i = 0; i <= 512; ++i)
if(dp[i] != INF)cnt++;
printf("%d\n", cnt);
for(int i = 0; i <= 512; ++i){
if(dp[i] != INF)printf("%d ", i);
}
return 0;
}