# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1132302 | KasymK | Intergalactic ship (IZhO19_xorsum) | C++20 | 2095 ms | 1980 KiB |
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 105;
const int MOD = 1e9+7;
int v[N], same[N];
ll par[N];
int main(){
int n;
scanf("%d", &n);
for(int i = 1; i <= n; ++i)
scanf("%d", v+i), same[i]=v[i];
using node = tuple<int, int, int>;
vector<node> A;
int q;
scanf("%d", &q);
for(int i = 0; i < q; ++i){
int l, r, x;
scanf("%d%d%d", &l, &r, &x);
A.pb({l, r, x});
}
vector<node> must;
ll answer=0;
for(int mk = 0; mk < (1<<q); ++mk){
must.clear();
memset(par, 0, sizeof par);
for(int i = 0; i < q; ++i)
if(mk>>i&1)
must.pb(A[i]);
tr(it, A){
int l, r, x;
tie(l, r, x)=*it;
for(int i = l; i <= r; ++i)
v[i]^=x;
}
for(int i = 1; i <= n; ++i)
par[i]=par[i-1]+v[i];
ll sm=0;
for(int i = 1; i <= n; ++i)
for(int j = i; j <= n; ++j)
(sm+=(par[j]-par[i-1])*(par[j]-par[i-1]))%=MOD;
(answer+=sm)%=MOD;
for(int i = 1; i <= n; ++i)
v[i]=same[i];
}
printf("%lld\n", answer);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |