제출 #1062350

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1062350		12345678	Intergalactic ship (IZhO19_xorsum)	C++17	17 / 100	407 ms	604 KiB

xorsum

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=105, mod=1e9+7;

ll n, q, a[nx], t[nx], qs[nx], l[nx], r[nx], x[nx], res;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++) cin>>a[i];
    cin>>q;
    for (int i=0; i<q; i++) cin>>l[i]>>r[i]>>x[i];
    for (int msk=0; msk<(1<<q); msk++)
    {
        ll sm=0;
        for (int i=1; i<=n; i++) t[i]=a[i];
        for (int i=0; i<q;i ++) if (msk&(1<<i)) for (int j=l[i]; j<=r[i]; j++) t[j]=t[j]^x[i];
        for (int i=1; i<=n; i++) qs[i]=(qs[i-1]+t[i])%mod, res=(res+(((n)*qs[i])%mod*(qs[i]))%mod), sm+=qs[i];
        sm=(sm*sm%mod);
        sm=((-sm)%mod+mod)%mod;
        for (int i=1; i<=n; i++) sm=(sm+qs[i]*qs[i])%mod;
        res=(res+sm)%mod;
    }
    cout<<res;
}

• Subtask 1: 4 / 4
• Subtask 2: 5 / 5
• Subtask 3: 0 / 6
• Subtask 4: 0 / 9
• Subtask 5: 8 / 8
• Subtask 6: 0 / 11
• Subtask 7: 0 / 19
• Subtask 8: 0 / 30
• Subtask 9: 0 / 8