Submission #334552

#	Time	Username	Problem	Language	Result	Execution time	Memory
334552		Trickster	Intergalactic ship (IZhO19_xorsum)	C++14	0 / 100	2077 ms	262152 KiB

xorsum

//Suleyman Atayew
 
#include <algorithm>
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <bitset>
#include <vector>
#include <queue>
#include <cmath>
#include <map>
#include <set>
 
#define N 200010
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define mod 1000000007
#define pii pair <ll, ll>
#define sz(a) (ll)(a.size())
ll bigmod(ll a, ll b) { if(b==0)return 1; ll ret = bigmod(a, b/2); return ret * ret % mod * (b%2 ? a : 1) % mod; }

using namespace std;

struct st {
    ll l, r, x;
} p[N];

ll n, q, ans;
ll v[N];
ll arr[N];

void f(ll x)
{
    if(x == q+1) {
        ll A[N];
        for(ll i = 1; i <= n; i++) A[i] = v[i];

        for(ll i = 1; i <= q; i++) if(arr[i]) for(ll h = p[i].l; h <= p[i].r; h++) A[h] ^= p[i].x;

        for(ll i = 1; i <= n; i++) A[i] += A[i-1];

        for(ll i = 1; i <= n; i++)
            for(ll h = i; h <= n; h++)
                ans += (A[h]-A[i-1]) * (A[h]-A[i-1]);

        return;
    }

    for(ll i = 0; i <= 1; i++) {
        arr[x] = i;
        f(x+1);
    }
}

int main()
{
    ios::sync_with_stdio(false);
	cin.tie(0);
    
    cin >> n;

    for(ll i = 1; i <= n; i++) cin >> v[i];

    cin >> q;

    for(ll i = 1; i <= q; i++) cin >> p[i].l >> p[i].r >> p[i].x;

    f(1);

    cout << ans;
}

• 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