제출 #1156492

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1156492		Jawad_Akbar_JJ	Intergalactic ship (IZhO19_xorsum)	C++20	9 / 100	2096 ms	1604 KiB

xorsum

#include <iostream>

using namespace std;
const int N = 1e5;
int l[N], r[N], x[N], a[N], b[N], mod = 1e9 + 7;

int main(){
	int n, q, Ans = 0;
	cin>>n;

	for (int i=1;i<=n;i++)
		cin>>a[i], b[i] = a[i];
	
	cin>>q;
	for (int i=0;i<q;i++)
		cin>>l[i]>>r[i]>>x[i];

	for (int mask = 0;mask < (1<<q);mask++){
		for (int j=0;j<q;j++){
			if ((1<<j) & mask)
				for (int k=l[j];k<=r[j];k++)
					a[k] ^= x[j];
		}

		for (int i=1;i<=n;i++){
			for (int j=i, S = 0;j<=n;j++)
				S += a[j], Ans = (Ans + S * S) % mod;
			a[i] = b[i];
		}
	}
	cout<<Ans<<'\n';
}

• 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