题目
题意: 略。
思路: 考虑复杂了,其实只需要考虑一下除了那三个数其他都是各自独立2种选择即可。另外需要特判一下,如果某个节点没有右儿子,是除了那两个数之外。
时间复杂度: O(nloga[i])
代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<complex>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<list>
#include<set>
#include<queue>
#include<stack>
#define OldTomato ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define fir(i,a,b) for(int i=a;i<=b;++i)
#define mem(a,x) memset(a,x,sizeof(a))
#define p_ priority_queue
// round() 四舍五入 ceil() 向上取整 floor() 向下取整
// lower_bound(a.begin(),a.end(),tmp,greater<ll>()) 第一个小于等于的
// #define int long long //QAQ
using namespace std;
typedef complex<double> CP;
typedef pair<int,int> PII;
typedef long long ll;
// typedef __int128 it;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const ll inf = 1e18;
const int N = 2e5+10;
const int M = 1e6+10;
const int mod = 1e9+7;
const double eps = 1e-6;
inline int lowbit(int x){ return x&(-x);}
template<typename T>void write(T x)
{
if(x<0)
{
putchar('-');
x=-x;
}
if(x>9)
{
write(x/10);
}
putchar(x%10+'0');
}
template<typename T> void read(T &x)
{
x = 0;char ch = getchar();ll f = 1;
while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
int n,m,k,T;
ll a[N];
ll ans = 0;
ll qpow(int a,int k)
{
if(k <= 0) return 1;
ll res = 1;
while(k)
{
if(k&1) res = res * a % mod;
a = a * a % mod;
k >>= 1;
}
return res;
}
void solve()
{
cin>>n;
for(int i=1;i<=n;++i) cin>>a[i];
if(n==2)
{
cout<<(a[1]^a[2])%mod;
return ;
}
for(int i=1;i<=n;++i)
{
int l = i*2;
int r = i*2+1;
if(l>n) break;
if(r>n)
{
ll c = qpow(2,n-2);
ans += (a[i]^a[l])*c%mod;
continue;
}
ll c = qpow(2,n-3);
ans += (a[i]^a[l]^a[r]) * c % mod;ans %= mod;
ans += (a[i]^a[l]) * c % mod;ans %= mod;
ans += (a[i]^a[r]) * c % mod;ans %= mod;
ans += (a[l]^a[r]) * c % mod;ans %= mod;
}
cout<<ans;
}
signed main(void)
{
T = 1;
OldTomato;
// read(T);
while(T--)
{
solve();
}
return 0;
}