Submission #1114502

#TimeUsernameProblemLanguageResultExecution timeMemory
1114502stdfloatIntergalactic ship (IZhO19_xorsum)C++17
17 / 100
934 ms262144 KiB
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int md = (int)1e9 + 7;

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);

	int n;
	cin >> n;

	vector<int> a(n + 1);
	for (int i = 1; i <= n; i++)
		cin >> a[i];

	int q;
	cin >> q;

	vector<int> l(q + 1), r(q + 1), x(q + 1);
	for (int i = 1; i <= q; i++)
		cin >> l[i] >> r[i] >> x[i];

	int ans = 0;
	vector<int> v[1 << q];
	v[0] = a;
	for (int mk = 0; mk < 1 << q; mk++) {
		for (int i = 1; i <= q; i++) {
			if ((mk >> (i - 1)) & 1) {
				v[mk] = v[mk ^ (1 << (i - 1))];
				for (int j = l[i]; j <= r[i]; j++)
					v[mk][j] ^= x[i];
			
				break;
			}
		}

		vector<int> p(n + 1);
		for (int i = 1; i <= n; i++)
			p[i] = p[i - 1] + v[mk][i];

		int sm = 0, sms = 0;
		for (int i = 1; i <= n; i++) {
			int x = (ll)p[i] * p[i] % md;

			ans = (ans + (((ll)i * x % md - (ll)p[i] * sm % md + md) % md + sms) % md) % md;

			sms = (sms + x) % md;
			sm = (sm + (p[i] << 1)) % md;
		}
	}

	cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...