#include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }
using ll=long long;
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<pi,ll>; using dpi=pair<pi,pi>;
#define LLINF ((long long)1e18)
#define INF int(1e9+1e6)
#define MAXN (100006)
ll n, A[1006], B[1006][1006][7][7], fw[7][7][1006], q, mod=1e9+7, ans, psum[1006][7], p2[MAXN];
vector<spi> v, o;
void update(int b1,int b2,int x,ll nval) {
for(;x<=1000;x+=x&(-x)) fw[b1][b2][x]+=nval;
}
ll sum(int b1,int b2,int x) {
ll res=0;
for(;x;x-=x&(-x))res+=fw[b1][b2][x];
return res;
}
ll sum(int bit1,int bit2,int a,int b) {
return sum(bit1,bit2,b) - sum(bit1,bit2,a-1);
}
int main() {
FAST
cin>>n;
FOR(i,1,n) cin>>A[i];
cin>>q;
v.resize(q);
for(auto&i:v)cin>>i.f.f>>i.f.s>>i.s;
sort(all(v)), reverse(all(v));
o=v;
FOR(i,1,n) {
while(v.size()&&v.back().f.f==i) {
FOR(i,0,6)if(1<<i&v.back().s)FOR(j,0,6)if(1<<j&v.back().s)update(i, j, v.back().f.s, 1);
v.pop_back();
}
FOR(j,i,n)FOR(b1,0,6)FOR(b2,0,6){
B[i][j][b1][b2]=sum(b1,b2,j,n);
}
}
v=o, mmst(fw,0);
FOR(i,1,n)FOR(j,i+1,n)FOR(b1,0,6)FOR(b2,0,6)B[j][i][b1][b2]=B[i][j][b1][b2];
for(auto i:v){
FOR(b,0,6) if(1<<b&i.s) ++ psum[b][i.f.f], -- psum[b][i.f.s+1];
}
FOR(b,0,6) FOR(i,1,n) psum[b][i]+=psum[b][i-1];
p2[0]=1; FOR(i,1,MAXN-1)p2[i]=p2[i-1]*2%mod;
auto Cp=[&](ll x){return p2[x-1];};// make sure x!=0
FOR(i,1,n)FOR(j,i,n)FOR(b1,0,6)FOR(b2,0,6){
// ways for b1 to be activated for i, and b2 to be activated for j
// * 2 ah
ll x=psum[b1][i], y=psum[b2][j], ways1[2]={0,0}, ways2[2]={0,0}, c=B[i][j][b1][b2], ceff=i*(n-j+1)%mod;
if(i^j) ceff*=2, ceff%=mod;
x-=c, y-=c;
ll notin = q-x-y-c;
if(1<<b1&A[i]) ways1[0] = x ? Cp(x) : 0, ways1[1] = x ? Cp(x) : 1;
else ways1[0] = x ? Cp(x) : 1, ways1[1] = x ? Cp(x) : 0;
if(1<<b2&A[j]) ways2[0] = y ? Cp(y) : 0, ways2[1] = y ? Cp(y) : 1;
else ways2[0] = y ? Cp(y) : 1, ways2[1] = y ? Cp(y) : 0;
ans += ceff * ways1[0] % mod * ways2[0] % mod * (c ? Cp(c) : 0) % mod * (1ll<<b1) % mod * (1ll<<b2) % mod * p2[notin] % mod, ans %= mod;
ans += ceff * ways1[1] % mod * ways2[1] % mod * (c ? Cp(c) : 1) % mod * (1ll<<b1) % mod * (1ll<<b2) % mod * p2[notin] % mod, ans %= mod;
}
cout<<ans<<'\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1516 KB |
Output is correct |
| 2 |
Correct |
2 ms |
1516 KB |
Output is correct |
| 3 |
Runtime error |
23 ms |
3052 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1516 KB |
Output is correct |
| 2 |
Correct |
2 ms |
1516 KB |
Output is correct |
| 3 |
Runtime error |
23 ms |
3052 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
86 ms |
22124 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
510 ms |
262148 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
25 ms |
3968 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
25 ms |
3968 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1516 KB |
Output is correct |
| 2 |
Correct |
2 ms |
1516 KB |
Output is correct |
| 3 |
Runtime error |
23 ms |
3052 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1516 KB |
Output is correct |
| 2 |
Correct |
2 ms |
1516 KB |
Output is correct |
| 3 |
Runtime error |
23 ms |
3052 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1516 KB |
Output is correct |
| 2 |
Correct |
2 ms |
1516 KB |
Output is correct |
| 3 |
Runtime error |
23 ms |
3052 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 4 |
Halted |
0 ms |
0 KB |
- |
