Submission #956499

#	Time	Username	Problem	Language	Result	Execution time	Memory
956499		Darren0724	Intergalactic ship (IZhO19_xorsum)	C++17	17 / 100	2066 ms	4188 KiB

xorsum

#include <bits/stdc++.h>
using namespace std;
#define LCBorz ios_base::sync_with_stdio(false); cin.tie(0);
#define int long long
#define all(x) x.begin(), x.end()
#define endl '\n'
const int N=200005;
const int INF=1e18;
const int mod=1e9+7;
int n,ans=0;
vector<int> v(N);
void cal(){
    int total=0;
    for(int i=0;i<n;i++){
        int cnt=0;
        for(int j=i;j<n;j++){
            cnt+=v[j];
            total+=cnt*cnt;
            total%=mod;
        }
    } 
    ans+=total;
    ans%=mod;
}
int32_t main() {
    LCBorz;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>v[i];
    }
    int q;cin>>q;
    vector<int> a(q),b(q),c(q);
    for(int i=0;i<q;i++){
        cin>>a[i]>>b[i]>>c[i];
    }
    for(int mask=0;mask<(1<<q);mask++){
        for(int i=0;i<q;i++){
            if(mask&(1<<i)){
                for(int j=a[i]-1;j<b[i];j++){
                    v[j]^=c[i];
                }
            }
        }
        cal();
        for(int i=0;i<q;i++){
            if(mask&(1<<i)){
                for(int j=a[i]-1;j<b[i];j++){
                    v[j]^=c[i];
                }
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}

• 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