oj.uz

Submission #469691

# Submission time Handle Problem Language Result Execution time Memory
469691 2021-09-01T15:36:07 Z keta_tsimakuridze Intergalactic ship (IZhO19_xorsum) C++14
83 / 100
 2000 ms 23980 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#define int long long
#define pii pair<int,int>
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[5][N][N],p[5][N];
vector<pair<pii,int> > all;
int choose(int x,int t) {
	return ch[x][t];
}
main(){
	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[t][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[2][l][r]++;
					p[2][l]++;
					p[2][r + 1]--;
				}
				else if(x & (1 << t1)) dp[0][l][r]++,p[0][l]++, p[0][r + 1]--;
				else if(x & (1 << t2))dp[1][l][r]++, p[1][l]++, p[1][r + 1]--;
			}
			
			for(int t = 0; t < 3; t++) {
				for(int l = 1; l <= n; l++) {
					for(int r = n; r >= l; r--) dp[t][l][r] += dp[t][l - 1][r] + dp[t][l][r + 1] - dp[t][l - 1][r + 1];
				}
			}
		//	cout<<"++"<<endl;
			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 = (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[2][l][r] ] % mod;
					if(l < r) P *= 2;//cout<<P<<"++"<<endl;
					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) {
							
				//				cout << p[0][l] + p[2][l] - dp[2][l][r] << endl;
				//			if(t1 == 1 && t2 == 0 && l == 1 && r == 2)
				//			cout << p[0][l] + p[2][l] - dp[2][l][r] << "_"<<x1 <<" "<< p[1][r] + p[2][r] - dp[2][l][r] <<" "<<x2<< endl;
								ans += choose(p[0][l] + p[2][l] - dp[2][l][r],x1)% mod * choose(p[1][r] + p[2][r] - dp[2][l][r],x2) % mod * choose(dp[2][l][r],x3)% mod * P %mod; 
								ans %= mod;
							}
						}
					}
					
					// wth
					
			//	 cout <<l <<" ____  "<<r<<" "<< t1 <<" "<< t2 <<" "<< ans << endl;
				}
			}	
		}
	}
	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 1 ms 332 KB Output is correct
2 Correct 0 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 1 ms 332 KB Output is correct
2 Correct 0 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 20 ms 1764 KB Output is correct
7 Correct 20 ms 1740 KB Output is correct
8 Correct 20 ms 1740 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 6440 KB Output is correct
2 Correct 31 ms 2352 KB Output is correct
3 Correct 21 ms 1868 KB Output is correct
4 Correct 20 ms 1740 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1992 ms 23976 KB Output is correct
2 Correct 1992 ms 23980 KB Output is correct
3 Execution timed out 2025 ms 23948 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
8.0 / 8.0

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

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 2 ms 588 KB Output is correct
3 Correct 2 ms 716 KB Output is correct
4 Correct 8 ms 1012 KB Output is correct
5 Correct 9 ms 1036 KB Output is correct
6 Correct 10 ms 1036 KB Output is correct
7 Correct 8 ms 1036 KB Output is correct

Subtask #7
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 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 20 ms 1764 KB Output is correct
7 Correct 20 ms 1740 KB Output is correct
8 Correct 20 ms 1740 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 25 ms 1708 KB Output is correct
13 Correct 20 ms 1804 KB Output is correct
14 Correct 20 ms 1800 KB Output is correct
15 Correct 20 ms 1800 KB Output is correct

Subtask #8
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 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 20 ms 1764 KB Output is correct
7 Correct 20 ms 1740 KB Output is correct
8 Correct 20 ms 1740 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 8 ms 1012 KB Output is correct
13 Correct 9 ms 1036 KB Output is correct
14 Correct 10 ms 1036 KB Output is correct
15 Correct 8 ms 1036 KB Output is correct
16 Correct 25 ms 1708 KB Output is correct
17 Correct 20 ms 1804 KB Output is correct
18 Correct 20 ms 1800 KB Output is correct
19 Correct 20 ms 1800 KB Output is correct
20 Correct 723 ms 17952 KB Output is correct
21 Correct 653 ms 17952 KB Output is correct
22 Correct 626 ms 17836 KB Output is correct

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 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 20 ms 1764 KB Output is correct
7 Correct 20 ms 1740 KB Output is correct
8 Correct 20 ms 1740 KB Output is correct
9 Correct 132 ms 6440 KB Output is correct
10 Correct 31 ms 2352 KB Output is correct
11 Correct 21 ms 1868 KB Output is correct
12 Correct 20 ms 1740 KB Output is correct
13 Correct 1992 ms 23976 KB Output is correct
14 Correct 1992 ms 23980 KB Output is correct
15 Execution timed out 2025 ms 23948 KB Time limit exceeded
16 Halted 0 ms 0 KB -