oj.uz

답안 #322540

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
322540 2020-11-14T18:57:46 Z ryansee Intergalactic ship (IZhO19_xorsum) C++14
26 / 100
 1550 ms 193260 KB 
#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=int; 
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<pair<int,int>,int>; using dpi=pair<pi,pi>; 

#define LLINF ((long long)1e18)
#define INF int(1e9+1e6)
#define MAXN (100006)
int n, A[1006], B[1002][1002][7][7], fw[7][7][1002], q, psum[7][1002];
long long mod=1e9+7;
int ans, p2[MAXN];
vector<spi> v, o;
void update(int b1,int b2,int x) {
	for(;x<=1000;x+=x&(-x)) ++ fw[b1][b2][x];
}
int sum(int b1,int b2,int x) {
	ll res=0;
	for(;x;x-=x&(-x))res+=fw[b1][b2][x];
	return res;
}
int sum(int bit1,int bit2,int a,int b) {
	return sum(bit1,bit2,b) - sum(bit1,bit2,a-1);
}
#define gc getchar_unlocked
int in() {
	int x=0;
	char ch=gc();
	while(ch<'0'||ch>'9')ch=gc();
	while(ch>='0'&&ch<='9'){
		x=(x<<3)+(x<<1)+(ch&15);
		ch=gc();
	}
	return x;
}
int main() {
	// FAST
	n=in();
	FOR(i,1,n) A[i]=in();
	q=in();
	v.reserve(q), v.resize(q);
	for(auto&i:v)i.f.f=in(),i.f.s=in(),i.s=in();
	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);
			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;
	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=ll(i)*(n-j+1)%mod;
		if(i^j) { ceff*=2; if(ceff>=mod) 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 += (ll)ceff * (ll)ways1[0] % mod * (ll)ways2[0] % mod * (ll)(c ? Cp(c) : 0) % mod * (ll)(1<<b1) % mod * (ll)(1<<b2) % mod * (ll)p2[notin] % mod, ans %= mod;
		ans += (ll)ceff * (ll)ways1[1] % mod * (ll)ways2[1] % mod * (ll)(c ? Cp(c) : 1) % mod * (ll)(1<<b1) % mod * (ll)(1<<b2) % mod * (ll)p2[notin] % mod, ans %= mod;
	}
	cout<<ans<<'\n';
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 2 ms 1004 KB Output is correct
4 Correct 2 ms 1004 KB Output is correct
5 Correct 2 ms 1004 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 2 ms 1004 KB Output is correct
4 Correct 2 ms 1004 KB Output is correct
5 Correct 2 ms 1004 KB Output is correct
6 Correct 16 ms 3308 KB Output is correct
7 Correct 17 ms 3308 KB Output is correct
8 Correct 18 ms 3052 KB Output is correct

Subtask #3
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 44 ms 5612 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1550 ms 193260 KB Output is correct
2 Correct 1497 ms 193164 KB Output is correct
3 Correct 1456 ms 193132 KB Output is correct
4 Correct 1466 ms 193260 KB Output is correct

Subtask #5
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1132 KB Output is correct
2 Correct 4 ms 1132 KB Output is correct
3 Correct 3 ms 1132 KB Output is correct

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1132 KB Output is correct
2 Correct 4 ms 1132 KB Output is correct
3 Correct 3 ms 1132 KB Output is correct
4 Incorrect 6 ms 1292 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 2 ms 1004 KB Output is correct
4 Correct 2 ms 1004 KB Output is correct
5 Correct 2 ms 1004 KB Output is correct
6 Correct 16 ms 3308 KB Output is correct
7 Correct 17 ms 3308 KB Output is correct
8 Correct 18 ms 3052 KB Output is correct
9 Correct 3 ms 1132 KB Output is correct
10 Correct 4 ms 1132 KB Output is correct
11 Correct 3 ms 1132 KB Output is correct
12 Incorrect 27 ms 3308 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 2 ms 1004 KB Output is correct
4 Correct 2 ms 1004 KB Output is correct
5 Correct 2 ms 1004 KB Output is correct
6 Correct 16 ms 3308 KB Output is correct
7 Correct 17 ms 3308 KB Output is correct
8 Correct 18 ms 3052 KB Output is correct
9 Correct 3 ms 1132 KB Output is correct
10 Correct 4 ms 1132 KB Output is correct
11 Correct 3 ms 1132 KB Output is correct
12 Incorrect 6 ms 1292 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 2 ms 1004 KB Output is correct
4 Correct 2 ms 1004 KB Output is correct
5 Correct 2 ms 1004 KB Output is correct
6 Correct 16 ms 3308 KB Output is correct
7 Correct 17 ms 3308 KB Output is correct
8 Correct 18 ms 3052 KB Output is correct
9 Incorrect 44 ms 5612 KB Output isn't correct
10 Halted 0 ms 0 KB -