제출 #395178

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
395178		NekoRolly	Intergalactic ship (IZhO19_xorsum)	C++17	9 / 100	2090 ms	1508 KiB

xorsum

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = 1e5+7;
const ll inf = 1e9;
const ll mod = 1e9+7;

int n,q;
int a[M],l[M],r[M],x[M];
ll b[M];
ll ans;

int main(){
	ios_base::sync_with_stdio(0); cin.tie(0);

	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 m=0; m<(1<<q); m++){
		for (int i=1; i<=n; i++) b[i] = 0;

		for (int i=0; i<q; i++)
			if (1<<i&m) b[l[i]] ^= x[i], b[r[i]+1] ^= x[i];

		for (int i=1; i<=n; i++) b[i] ^= b[i-1];
		for (int i=1; i<=n; i++) b[i] ^= a[i];
		for (int i=1; i<=n; i++) for (int j=1; j<=n; j++) ans = (ans + b[i]*b[j]*min(i,j)*(n-max(i,j)+1))%mod;
	}

	cout << ans << "\n";

	return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 5 / 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