Submission #336040

#	Time	Username	Problem	Language	Result	Execution time	Memory
336040		amunduzbaev	Intergalactic ship (IZhO19_xorsum)	C++14	0 / 100	2098 ms	83368 KiB

xorsum

#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define int long long
#define ll long long 
#define ld long double 
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define prc(n) fixed << setprecision(n)
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1);
const int inf = 1e9+7;
const int N = 1e6+5;
int n, m, res;

void solve(){
	cin>>n;
	vector<int>a(n);
	for(int i=0;i<n;i++){
		cin>>a[i];
	}
	cin>>m;
	vector<vector<int>>pos(m);
	for(int i=0;i<m;i++){
		pos[i] = a;
		int l, r, x;
		cin>>l>>r>>x;
		for(int j=l;j<=r;j++){
			pos[i][j] = (pos[i][j] ^ x);
		}
	}
	for(int i=0;i<(1<<m);i++){
		vector<int>ans(n, 0);
		for(int j=0;j<m;j++){
			if(i & (1<<j)){
				for(int l=0;l<n;l++)
					ans[l] ^= pos[j][l];
			}
		}
		
		for(int j=0;j<n;j++){
			int cur = a[j];
			for(int l=j;l<n;l++){
				res = (res + (cur * cur)) % inf;
				cur += a[l+1];
			}
		}
	}
	cout<<res<<'\n';
	return;
}
 
signed main(){
	fastios
	int t = 1;
	//cin>>t;
	while(t--) solve();
	return 0;
}
 
 

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