oj.uz

Submission #227530

# Submission time Handle Problem Language Result Execution time Memory
227530 2020-04-27T17:14:35 Z srvlt Intergalactic ship (IZhO19_xorsum) C++14
43 / 100
 440 ms 47224 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define ull unsigned long long
#define db long double
#define pb push_back
#define ppb pop_back
#define F first
#define S second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
 
const int N = 1003, M = 100003, K = 128, MOD = 1e9 + 7;
int n, q, a[N], pw[M];
vector <pii> L[N], R[N];

int bit[K], mask[K];
 
struct basis {
	short int b[7];
	int sz = 0, bsz = 0;
	bitset <K> can;
	basis() {
		memset(& b, 0, sizeof(b));
		can[0] = 1;
	}
	void clear() {
		memset(& b, 0, sizeof(b));
		sz = 0;
		bsz = 0;
		can.reset();
		can[0] = 1;
	};
	void upd() {
		can.reset();
		for (int i = 0; i < (1 << bsz); i++) {
			if (i > 0) {
				mask[i] = mask[i ^ (1 << bit[i])] ^ b[bit[i]];
			}
			can[mask[i]] = 1;
		}
	};
	bool add(int x) {
		sz++;
		if (can[x]) {
			return false;
		}
		for (int i = 0; i < bsz; i++) {
			x = min(x, x ^ b[i]);
		}
		b[bsz++] = x;
		upd();
		return true;
	}
	int ways() {
		return pw[sz - bsz];
	}
};
 
basis cur, C[N][N], A[N][7];
short int f[K][N][7], g[K];
int last[N][N];
 
int main() {
	ios_base::sync_with_stdio(false), cin.tie(NULL);
	#ifdef LOCAL
		freopen("input.txt", "r", stdin);
	#endif
	
	pw[0] = 1;
	for (int i = 1; i < M; i++) {
		pw[i] = pw[i - 1] * 2 % MOD;
	}
	
	for (int i = 1; i < K; i++) {
		for (int j = 6; j >= 0; j--) {
			if (i >> j & 1) {
				bit[i] = j;
				break;
			}
		}
	}
	
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	cin >> q;
	for (int i = 1; i <= q; i++) {
		int l, r, x;
		cin >> l >> r >> x;
		R[r].pb({l, x});
		L[l].pb({r, x});
	}
	for (int l = 1; l <= n; l++) {
		cur.clear();
		for (int r = n; r >= l; r--) {
			for (auto i : R[r]) {
				if (i.F <= l) {
					cur.add(i.S);
				}
			}
			C[l][r] = cur;
		}
	}
	memset(& last, -1, sizeof(last));
	for (int l = 1; l <= n; l++) {
		cur.clear();
		int cnt = 0;
		last[l][l] = cnt;
		for (int r = l; r <= n; r++) {
			int pos = last[l][r];
			if (pos == cnt) {
				A[l][pos] = cur;
				for (int i = 0; i < K; i++) {
					for (int j = 0; j < K; j++) {
						f[i][l][pos] += j * cur.can[j ^ i];
					}
				}
				cnt++;
			}	else {
				last[l][r] = last[l][r - 1];
			}
			for (auto i : R[r]) {
				if (i.F <= l && cur.add(i.S)) {
					last[l][r + 1] = cnt;
				}
			}
		}
	}
	int ans = 0;
	for (int r = n; r >= 1; r--) {
		cur.clear();
		for (int i = 0; i < K; i++) {
			g[i] = 0;
			for (int j = 0; j < K; j++) {
				g[i] += j * cur.can[j ^ i];
			}
		}
		for (int l = r; l >= 1; l--) {
			int res = 0, pos = last[l][r];
			for (int i = 0; i < K; i++) {
				res += (int)C[l][r].can[i] * f[i ^ a[l]][l][pos] * g[i ^ a[r]];
				if (res >= MOD) {
					res -= MOD;
				}
			}
			res = (ll)res * C[l][r].ways() % MOD;
			res = (ll)res * A[l][pos].ways() % MOD;
			res = (ll)res * cur.ways() % MOD;
			res = (ll)res * pw[q - C[l][r].sz - A[l][pos].sz - cur.sz] % MOD;
			if (l == r) {
				res = (ll)res * ((MOD + 1) / 2) % MOD;
			}
			int occ = l * (n - r + 1);
			ans += (ll)res * occ % MOD;
			if (ans >= MOD) {
				ans -= MOD;
			}
    		for (auto i : L[l]) {
    			if (i.F >= r && cur.add(i.S)) {
    				for (int k = 0; k < K; k++) {
    					g[k] = 0;
    					for (int j = 0; j < K; j++) {
    						g[k] += j * cur.can[j ^ k];
    					}
    				}
    			}
    		}
    	}
    }
    cout << 2 * ans % MOD;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 44920 KB Output is correct
2 Correct 27 ms 44928 KB Output is correct
3 Correct 30 ms 44920 KB Output is correct
4 Correct 31 ms 44928 KB Output is correct
5 Correct 29 ms 44928 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 44920 KB Output is correct
2 Correct 27 ms 44928 KB Output is correct
3 Correct 30 ms 44920 KB Output is correct
4 Correct 31 ms 44928 KB Output is correct
5 Correct 29 ms 44928 KB Output is correct
6 Correct 51 ms 45048 KB Output is correct
7 Correct 36 ms 45048 KB Output is correct
8 Correct 40 ms 45056 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 47224 KB Output is correct
2 Correct 56 ms 45208 KB Output is correct
3 Correct 50 ms 45056 KB Output is correct
4 Correct 40 ms 45056 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 440 ms 46192 KB Output is correct
2 Correct 424 ms 46200 KB Output is correct
3 Correct 392 ms 46200 KB Output is correct
4 Correct 405 ms 46072 KB Output is correct

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 44920 KB Output is correct
2 Correct 36 ms 44920 KB Output is correct
3 Correct 37 ms 44920 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 44920 KB Output is correct
2 Correct 36 ms 44920 KB Output is correct
3 Correct 37 ms 44920 KB Output is correct
4 Correct 37 ms 45048 KB Output is correct
5 Correct 35 ms 45056 KB Output is correct
6 Correct 36 ms 45056 KB Output is correct
7 Correct 38 ms 45048 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 44920 KB Output is correct
2 Correct 27 ms 44928 KB Output is correct
3 Correct 30 ms 44920 KB Output is correct
4 Correct 31 ms 44928 KB Output is correct
5 Correct 29 ms 44928 KB Output is correct
6 Correct 51 ms 45048 KB Output is correct
7 Correct 36 ms 45048 KB Output is correct
8 Correct 40 ms 45056 KB Output is correct
9 Correct 36 ms 44920 KB Output is correct
10 Correct 36 ms 44920 KB Output is correct
11 Correct 37 ms 44920 KB Output is correct
12 Incorrect 66 ms 45048 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 44920 KB Output is correct
2 Correct 27 ms 44928 KB Output is correct
3 Correct 30 ms 44920 KB Output is correct
4 Correct 31 ms 44928 KB Output is correct
5 Correct 29 ms 44928 KB Output is correct
6 Correct 51 ms 45048 KB Output is correct
7 Correct 36 ms 45048 KB Output is correct
8 Correct 40 ms 45056 KB Output is correct
9 Correct 36 ms 44920 KB Output is correct
10 Correct 36 ms 44920 KB Output is correct
11 Correct 37 ms 44920 KB Output is correct
12 Correct 37 ms 45048 KB Output is correct
13 Correct 35 ms 45056 KB Output is correct
14 Correct 36 ms 45056 KB Output is correct
15 Correct 38 ms 45048 KB Output is correct
16 Incorrect 66 ms 45048 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 44920 KB Output is correct
2 Correct 27 ms 44928 KB Output is correct
3 Correct 30 ms 44920 KB Output is correct
4 Correct 31 ms 44928 KB Output is correct
5 Correct 29 ms 44928 KB Output is correct
6 Correct 51 ms 45048 KB Output is correct
7 Correct 36 ms 45048 KB Output is correct
8 Correct 40 ms 45056 KB Output is correct
9 Correct 81 ms 47224 KB Output is correct
10 Correct 56 ms 45208 KB Output is correct
11 Correct 50 ms 45056 KB Output is correct
12 Correct 40 ms 45056 KB Output is correct
13 Correct 440 ms 46192 KB Output is correct
14 Correct 424 ms 46200 KB Output is correct
15 Correct 392 ms 46200 KB Output is correct
16 Correct 405 ms 46072 KB Output is correct
17 Correct 36 ms 44920 KB Output is correct
18 Correct 36 ms 44920 KB Output is correct
19 Correct 37 ms 44920 KB Output is correct
20 Correct 37 ms 45048 KB Output is correct
21 Correct 35 ms 45056 KB Output is correct
22 Correct 36 ms 45056 KB Output is correct
23 Correct 38 ms 45048 KB Output is correct
24 Incorrect 66 ms 45048 KB Output isn't correct
25 Halted 0 ms 0 KB -