oj.uz

Submission #469696

# Submission time Handle Problem Language Result Execution time Memory
469696 2021-09-01T15:41:37 Z keta_tsimakuridze Intergalactic ship (IZhO19_xorsum) C++14
100 / 100
 1787 ms 7752 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#define pii pair<int,int>
#define ll long long
using namespace std;
const int N = 1e3 + 5, M = 1e5 + 5, mod = 1e9 + 7; // !
int a[N],n,Q,ch[M][2],pwr[M],dp[N][N],p[5][N];
vector<pair<pii,int> > all;
int choose(int x,int t) {
	return ch[x][t];
}
main(){
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> a[i];
	cin >> Q;
	for(int j = 1; j <= Q; j++) {
		int l,r,x;
		cin >> l >> r >> x;
		all.push_back({{l,r},x});
	}
	
	ch[0][0] = 1;
	pwr[0] = 1;
	for(int i = 1; i <= Q; i++) {
		for(int t = 0; t < 2; t++){
			ch[i][t] = ch[i - 1][t] + ch[i - 1][1 - t];
			ch[i][t] %= mod;
		}
		pwr[i] = pwr[i - 1] * 2 % mod;
	}
	int ans = 0;
	for(int t1 = 0; t1 < 8; t1++) {
		for(int t2 = 0; t2 < 8; t2++) {
			for(int t = 0; t < 3; t++) 
			for(int i = 1; i <= n; i++) {
				p[t][i] = 0;
				for(int j = 1; j <= n; j++) dp[i][j] = 0;
			}
			for(int i = 0; i < Q; i++){
				int l = all[i].f.f, r = all[i].f.s, x = all[i].s;
				if((x & (1 << t1)) && (x & (1 << t2))) {
					dp[l][r]++;
					p[2][l]++;
					p[2][r + 1]--;
				}
				else if(x & (1 << t1)) p[0][l]++, p[0][r + 1]--;
				else if(x & (1 << t2)) p[1][l]++, p[1][r + 1]--;
			}
			
			for(int l = 1; l <= n; l++) {
				for(int r = n; r >= l; r--) dp[l][r] += dp[l - 1][r] + dp[l][r + 1] - dp[l - 1][r + 1];
			}
			for(int t = 0; t < 3; t++)
			for(int i = 1; i <= n; i++) {
				p[t][i] += p[t][i - 1];
			}
			for(int l = 1; l <= n; l++) {
				for(int r = l; r <= n; r++) {
					int b1 =( (1 << t1) & a[l] ) > 0;
					int b2 = ( (1 << t2) & a[r] ) > 0;
					int P = (ll)(1 << t1) % mod * (1 << t2) % mod 
							* l % mod * (n - r + 1) % mod* pwr[Q - p[0][l] - p[1][r] - p[2][l] - p[2][r] + dp[l][r] ] % mod;
					if(l < r) P *= 2;
					P %= mod;
					for(int x1 = 0; x1 < 2; x1++){
						for(int x2 = 0; x2 < 2; x2++) {
							int x3 = 1 ^ x1 ^ b1;
							
							if(x3 ^ x2 ^ b2) {
								ans += (ll)choose(p[0][l] + p[2][l] - dp[l][r],x1)% mod * choose(p[1][r] + p[2][r] - dp[l][r],x2) % mod * choose(dp[l][r],x3)% mod * P %mod; 
								ans %= mod;
							}
						}
					}
				}
			}	
		}
	}
	cout << ans;
 }

Compilation message

xorsum.cpp:13:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   13 | main(){
      | ^~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 17 ms 732 KB Output is correct
7 Correct 18 ms 736 KB Output is correct
8 Correct 18 ms 736 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 3176 KB Output is correct
2 Correct 24 ms 1036 KB Output is correct
3 Correct 18 ms 760 KB Output is correct
4 Correct 17 ms 740 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1660 ms 4280 KB Output is correct
2 Correct 1652 ms 4292 KB Output is correct
3 Correct 1645 ms 4264 KB Output is correct
4 Correct 1659 ms 4260 KB Output is correct

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 6 ms 680 KB Output is correct
5 Correct 6 ms 624 KB Output is correct
6 Correct 6 ms 588 KB Output is correct
7 Correct 6 ms 588 KB Output is correct

Subtask #7
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 17 ms 732 KB Output is correct
7 Correct 18 ms 736 KB Output is correct
8 Correct 18 ms 736 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 18 ms 752 KB Output is correct
13 Correct 18 ms 752 KB Output is correct
14 Correct 18 ms 756 KB Output is correct
15 Correct 17 ms 748 KB Output is correct

Subtask #8
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 17 ms 732 KB Output is correct
7 Correct 18 ms 736 KB Output is correct
8 Correct 18 ms 736 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 6 ms 680 KB Output is correct
13 Correct 6 ms 624 KB Output is correct
14 Correct 6 ms 588 KB Output is correct
15 Correct 6 ms 588 KB Output is correct
16 Correct 18 ms 752 KB Output is correct
17 Correct 18 ms 752 KB Output is correct
18 Correct 18 ms 756 KB Output is correct
19 Correct 17 ms 748 KB Output is correct
20 Correct 533 ms 4712 KB Output is correct
21 Correct 516 ms 4664 KB Output is correct
22 Correct 470 ms 4660 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 17 ms 732 KB Output is correct
7 Correct 18 ms 736 KB Output is correct
8 Correct 18 ms 736 KB Output is correct
9 Correct 90 ms 3176 KB Output is correct
10 Correct 24 ms 1036 KB Output is correct
11 Correct 18 ms 760 KB Output is correct
12 Correct 17 ms 740 KB Output is correct
13 Correct 1660 ms 4280 KB Output is correct
14 Correct 1652 ms 4292 KB Output is correct
15 Correct 1645 ms 4264 KB Output is correct
16 Correct 1659 ms 4260 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 6 ms 680 KB Output is correct
21 Correct 6 ms 624 KB Output is correct
22 Correct 6 ms 588 KB Output is correct
23 Correct 6 ms 588 KB Output is correct
24 Correct 18 ms 752 KB Output is correct
25 Correct 18 ms 752 KB Output is correct
26 Correct 18 ms 756 KB Output is correct
27 Correct 17 ms 748 KB Output is correct
28 Correct 533 ms 4712 KB Output is correct
29 Correct 516 ms 4664 KB Output is correct
30 Correct 470 ms 4660 KB Output is correct
31 Correct 1787 ms 6672 KB Output is correct
32 Correct 1732 ms 7752 KB Output is correct
33 Correct 1718 ms 7608 KB Output is correct
34 Correct 1757 ms 7600 KB Output is correct
35 Correct 1783 ms 7636 KB Output is correct
36 Correct 1767 ms 7636 KB Output is correct