Submission #1131914

#	Time	Username	Problem	Language	Result	Execution time	Memory
1131914		Agageldi	Intergalactic ship (IZhO19_xorsum)	C++20	17 / 100	2096 ms	6724 KiB

xorsum

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define N 400005
#define ff first
#define ss second
#define pb push_back
#define sz(s) (int)s.size()
const int M = 1e9 + 7;

ll n, t, T, a[N], c[N], d[N], sum, q, x[N], y[N], l[N];

void solve(int b) {
	if(b == q+1) {
		for(int i = 1; i<= n;i++) {
			d[i] = a[i];
		}
		for(int i = 1; i <= q; i++) {
			if(c[i]) {
				for(int j = x[i]; j <= y[i]; j++) {
					d[j] = (d[j]^l[i]);
				}
			}
		}
		for(int i = 1; i <= n; i++) {
			int jog = 0;
			for(int j = i; j <= n; j++) {
				jog += d[j];
				sum += jog * jog;
				sum %= M;
			}
		}
		return;
	}
	c[b] = 1;
	solve(b + 1);
	c[b] = 0;
	solve(b + 1);
}

int main () {
	ios::sync_with_stdio(0);cin.tie(0);
	cin >> n;
	for(int i =1;i <= n;i++) {
		cin >> a[i];
	}
	cin >> q;
	for(int i = 1;i<=q;i++) {
		cin >> x[i] >> y[i] >> l[i];
	}
	solve(1);
	cout << sum << '\n';
}

• 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