oj.uz

Submission #564465

# Submission time Handle Problem Language Result Execution time Memory
564465 2022-05-19T09:24:51 Z Stickfish Intergalactic ship (IZhO19_xorsum) C++17
43 / 100
 216 ms 2440 KB 
#include <iostream>
#include <vector>
#include <bitset>
using namespace std;
using ll = long long;

const int MAXN = 1008;
const ll MOD = 1000000007;
const int MAXVAL = 128;
int a[MAXN];

void updt(bitset<MAXVAL>& bs, int t) {
    if (bs[bs._Find_first() ^ t])
        return;
    vector<int> it;
    for (int i = bs._Find_first(); i < MAXVAL; i = bs._Find_next(i)) {
        it.push_back(i ^ t);
    }
    for (auto i : it)
        bs[i] = 1;
}

ll pw(ll a, ll m) {
    if (!m)
        return 1;
    a %= MOD;
    if (m % 2)
        return a * pw(a, m - 1) % MOD;
    return pw(a * a, m / 2);
}

bool in(pair<int, int> sg, int i) {
    return sg.first <= i && i < sg.second;
}

vector<pair<int, int>> events[MAXN];

signed main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i)
        cin >> a[i];
    int q;
    cin >> q;
    for (int i = 0; i < q; ++i) {
        int l, r, x;
        cin >> l >> r >> x;
        --l;
        events[l].push_back({r, x});
        events[r].push_back({l, x});
    }
    ll ans = 0;
    vector<int> genij0(MAXVAL, 0);
    bitset<MAXVAL> genbsij0;
    for (int i = 0; i < n; ++i) {
        for (auto [e, x] : events[i]) {
            if (e < i)
                genbsij0[x] = --genij0[x];
            else
                genbsij0[x] = ++genij0[x];
        }
        vector<int> geni(MAXVAL);
        bitset<MAXVAL> genbsi;
        vector<int> genj(MAXVAL);
        bitset<MAXVAL> genbsj;
        vector<int> genij = genij0;
        bitset<MAXVAL> genbsij = genbsij0;

        for (int j = i; j < n; ++j) {
            if (j > i) {
                for (auto [e, x] : events[j]) {
                    if (e <= i) {
                        genbsij[x] = --genij[x];
                        genbsi[x] = ++geni[x];
                    } else if (e < j) {
                        genbsj[x] = --genj[x];
                    } else {
                        genbsj[x] = ++genj[x];
                    }
                }
            }
            bitset<MAXVAL> bsi;
            bitset<MAXVAL> bsj;
            bitset<MAXVAL> bsij;
            bsi[a[i]] = bsj[a[j]] = bsij[0] = 1;
            //cout << "---" << i << ' ' << j << "---\n";
            for (int xi = genbsi._Find_first(); xi < MAXVAL; xi = genbsi._Find_next(xi)) {
                //cout << xi << ' ';
                updt(bsi, xi);
            }
            //cout << endl;
            for (int xj = genbsj._Find_first(); xj < MAXVAL; xj = genbsj._Find_next(xj)) {
                //cout << xj << ' ';
                updt(bsj, xj);
            }
            //cout << endl;
            for (int xij = genbsij._Find_first(); xij < MAXVAL; xij = genbsij._Find_next(xij)) {
                //cout << xij << ' ';
                updt(bsij, xij);
            }
            //cout << endl;
            ll addans = 0;
            if (1ll * n * n * bsi.count() * bsj.count() * bsij.count() > 1e9)
                continue;
            for (int xi = bsi._Find_first(); xi < MAXVAL; xi = bsi._Find_next(xi)) {
                for (int xj = bsj._Find_first(); xj < MAXVAL; xj = bsj._Find_next(xj)) {
                    for (int xij = bsij._Find_first(); xij < MAXVAL; xij = bsij._Find_next(xij)) {
                        if (i != j)
                            addans += 2ll * (xi ^ xij) * (xj ^ xij);
                        else
                            addans += 1ll * (xi ^ xij) * (xj ^ xij);
                        addans %= MOD;
                    }
                }
            }
            addans *= (i + 1) * (n - j);
            addans %= MOD;
            addans *= pw(2, q);
            addans %= MOD;
            //cout << bsi.count() << ' ' << bsj.count() << ' ' << bsij.count() << endl;
            addans *= pw(bsi.count() * bsj.count() * bsij.count(), MOD - 2);
            ans += addans;
            ans %= MOD;
            //cout << i << ' ' << j << ": " << ans - ans0 << endl;
        }
    }
    cout << ans << endl;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 6 ms 328 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 2440 KB Output is correct
2 Correct 56 ms 468 KB Output is correct
3 Correct 19 ms 344 KB Output is correct
4 Correct 3 ms 212 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 340 KB Output is correct
2 Correct 204 ms 320 KB Output is correct
3 Correct 180 ms 312 KB Output is correct
4 Correct 199 ms 304 KB Output is correct

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 212 KB Output is correct
2 Correct 3 ms 212 KB Output is correct
3 Correct 4 ms 328 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 212 KB Output is correct
2 Correct 3 ms 212 KB Output is correct
3 Correct 4 ms 328 KB Output is correct
4 Correct 94 ms 468 KB Output is correct
5 Correct 94 ms 468 KB Output is correct
6 Correct 104 ms 468 KB Output is correct
7 Correct 101 ms 468 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 6 ms 328 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 3 ms 212 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Correct 4 ms 328 KB Output is correct
12 Incorrect 134 ms 320 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 6 ms 328 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 3 ms 212 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Correct 4 ms 328 KB Output is correct
12 Correct 94 ms 468 KB Output is correct
13 Correct 94 ms 468 KB Output is correct
14 Correct 104 ms 468 KB Output is correct
15 Correct 101 ms 468 KB Output is correct
16 Incorrect 134 ms 320 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 6 ms 328 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 174 ms 2440 KB Output is correct
10 Correct 56 ms 468 KB Output is correct
11 Correct 19 ms 344 KB Output is correct
12 Correct 3 ms 212 KB Output is correct
13 Correct 216 ms 340 KB Output is correct
14 Correct 204 ms 320 KB Output is correct
15 Correct 180 ms 312 KB Output is correct
16 Correct 199 ms 304 KB Output is correct
17 Correct 3 ms 212 KB Output is correct
18 Correct 3 ms 212 KB Output is correct
19 Correct 4 ms 328 KB Output is correct
20 Correct 94 ms 468 KB Output is correct
21 Correct 94 ms 468 KB Output is correct
22 Correct 104 ms 468 KB Output is correct
23 Correct 101 ms 468 KB Output is correct
24 Incorrect 134 ms 320 KB Output isn't correct
25 Halted 0 ms 0 KB -