Submission #62094322

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
#include<random>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define endl '\n'
using pll = pair<ll, ll>;
using pii = pair<int, int>;
const int N = 2e6 + 10;
mt19937 rnd(114514);
ll a[N], n;
map<ll, ll>vis;
map<vector<ll>, bool>isok;
vector<ll>tot;
void dfs(int x, vector<ll>v) {
  if (x > n) {
  
    ll sum = 0;
    for (const ll it : v)sum ^= it;
    tot.push_back(sum);
    return;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
#include<random>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define endl '\n'
using pll = pair<ll, ll>;
using pii = pair<int, int>;
const int N = 2e6 + 10;
mt19937 rnd(114514);
ll a[N], n;
map<ll, ll>vis;
map<vector<ll>, bool>isok;
vector<ll>tot;
void dfs(int x, vector<ll>v) {
	if (x > n) {
	
		ll sum = 0;
		for (const ll it : v)sum ^= it;
		tot.push_back(sum);
		return;
	}
	if (isok[v])return;
	isok[v] = 1;
	for (auto &V : v) {
	
		V += a[x];
		dfs(x + 1, v);
		V -= a[x];
	}
	v.push_back(a[x]);
	dfs(x + 1, v);
	v.pop_back();
}
void UraykevoliQwQ()
{
	cin >> n;
	for (int i = 1; i <= n; i++)cin >> a[i];
	dfs(1, {});
	//cout << vis.size();
	sort(tot.begin(), tot.end());
	tot.erase(unique(tot.begin(), tot.end()), tot.end());
	cout << tot.size();
}
int main()
{
	ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
	int _ = 1;
	//cin >>_;
	while (_--)UraykevoliQwQ();
	return 0;
}

Submission Info

Judge Result