제출 #992875

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
992875		n3rm1n	Intergalactic ship (IZhO19_xorsum)	C++17	0 / 100	2065 ms	348 KiB

xorsum

#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
using namespace std;
const int MAXN = 500;
void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}
int n, m;
int a[MAXN], aa[MAXN];
int ql[MAXN], qr[MAXN], xx[MAXN];
long long mod = 1e9 + 7, total = 0;
void apply(int subset)
{
    for (int i = 1; i <= n; ++ i)
        aa[i] = a[i];
    for (int i = 0; i < m; ++ i)
    {
        if((1 << i) & subset)
        {
            for (int j = ql[i]; j <= qr[i]; ++ j)
                aa[i] = (aa[i] ^ xx[i]);

        }
    }
    long long ans = 0;
    for (int i = 1; i <= n; ++ i)
    {
        long long current = 0;
        for (int j = i; j <= n; ++ j)
        {
            current += a[j];
            current %= mod;
            ans += current * current;
            ans %= mod;
        }
    }
    total += ans;
    total %= mod;
}
void read()
{
    cin >> n;
    for (int i = 1; i <= n; ++ i)
    {
        cin >> a[i];
    }
    long long pow = 1;
    cin >> m;
    for (int i = 0; i < m; ++ i)
    {
        pow *= 2;
        cin >> ql[i] >> qr[i] >> xx[i];
    }
    for (int i = 0; i < pow; ++ i)
    {
        apply(i);
    }
    cout << total << endl;
}
int main()
{
    speed();
    read();
    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