oj.uz

Submission #564568

# Submission time Handle Problem Language Result Execution time Memory
564568 2022-05-19T11:15:29 Z Stickfish Intergalactic ship (IZhO19_xorsum) C++17
92 / 100
 2000 ms 4128 KB 
#include <iostream>
#include <vector>
#include <map>
#include <bitset>
#include <cassert>
using namespace std;
using ll = long long;
using ull = unsigned long long;

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

void updt(bitset<MAXVAL>& bs, int t) {
    if (bs[bs._Find_first() ^ t])
        return;
    if (bs.count() == 64) {
        for (int i = 0; i < MAXVAL; ++i)
            bs[i] = 1;
        return;
    }
    int sz = bs.count();
    for (int i = bs._Find_first(); i < MAXVAL; ++i) {
        if (bs[i])
            bs[i ^ t] = bs[i];
    }
}

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];
int change_ij[MAXN][MAXVAL];
int change_i[MAXN][MAXVAL];
int change_j[MAXN][MAXVAL];

struct sixple {
    ull first;
    ull second;
    ull third;
    ull fourth;
    ull fifth;
    ull sixth;

    bool operator<(sixple& s) {
        if (first != s.first)
            return first < s.first;
        if (second != s.second)
            return second < s.second;
        if (third != s.third)
            return third < s.third;
        if (fourth != s.fourth)
            return fourth < s.fourth;
        if (fifth != s.fifth)
            return fifth < s.fifth;
        return sixth < s.sixth;
    }
};

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    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});
        ++change_j[l][x];
        --change_j[r][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];
                --change_ij[e][x];
                ++change_j[e][x];
                ++change_i[e][x];
            }
        }
        vector<int> geni(MAXVAL);
        vector<int> genj(MAXVAL);
        vector<int> genij = genij0;

        for (int j = i; j < n; ++j) {
            if (j > i) {
                for (int x = 0; x < 128; ++x) {
                    genij[x] += change_ij[j][x];
                    geni[x] += change_i[j][x];
                    genj[x] += change_j[j][x];
                }
            }
            bitset<MAXVAL> bsi;
            bitset<MAXVAL> bsj;
            bitset<MAXVAL> bsij;
            bsi[a[i]] = bsj[a[j]] = bsij[0] = 1;
            for (int xi = 0; xi < MAXVAL; ++xi) {
                if (geni[xi])
                    updt(bsi, xi);
                if (bsi.count() == 128)
                    continue;
            }
            //if (n > 500 && q > 500)
                //continue;
            for (int xj = 0; xj < MAXVAL; ++xj) {
                if (genj[xj])
                    updt(bsj, xj);
                if (bsj.count() == 128)
                    continue;
            }
            for (int xij = 0; xij < MAXVAL; ++xij) {
                if (genij[xij])
                    updt(bsij, xij);
                if (bsij.count() == 128)
                    continue;
            }
            ll addans = 0;
            if (bsij.count() == 128 && (bsi.count() == 128 || bsj.count() == 128)) {
                if (bsi.count() == 128) {
                    addans += 64ll * 127 * 64 * 127 * bsj.count();
                } else {
                    addans += 64ll * 127 * 64 * 127 * bsi.count();
                }
            } else {
                vector<int> xj_from_xij(MAXVAL);
                for (int xij = bsij._Find_first(); xij < MAXVAL; xij = bsij._Find_next(xij)) {
                    if (bsj.count() == 128) {
                        xj_from_xij[xij] = 64 * 127;
                    } else {
                        for (int xj = bsj._Find_first(); xj < MAXVAL; xj = bsj._Find_next(xj)) {
                            xj_from_xij[xij] += xj ^ xij;
                        }
                    }
                }
                for (int xij = bsij._Find_first(); xij < MAXVAL; xij = bsij._Find_next(xij)) {
                    if (bsi.count() == 128) {
                        addans += xj_from_xij[xij] * 64 * 127;
                    } else {
                        for (int xi = bsi._Find_first(); xi < MAXVAL; xi = bsi._Find_next(xi)) {
                            addans += xj_from_xij[xij] * (xi ^ xij);
                        }
                    }
                    addans %= MOD;
                }
            }
            if (i != j) {
                addans *= 2;
            }
            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;
}

Compilation message

xorsum.cpp: In function 'void updt(std::bitset<128>&, int)':
xorsum.cpp:24:9: warning: unused variable 'sz' [-Wunused-variable]
   24 |     int sz = bs.count();
      |         ^~

Subtask #1
4.0 / 4.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 2488 KB Output is correct
2 Correct 16 ms 704 KB Output is correct
3 Correct 12 ms 504 KB Output is correct
4 Correct 6 ms 468 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 506 ms 1800 KB Output is correct
2 Correct 491 ms 1836 KB Output is correct
3 Correct 456 ms 1420 KB Output is correct
4 Correct 450 ms 964 KB Output is correct

Subtask #5
8.0 / 8.0

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

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 7 ms 580 KB Output is correct
5 Correct 8 ms 572 KB Output is correct
6 Correct 8 ms 468 KB Output is correct
7 Correct 8 ms 468 KB Output is correct

Subtask #7
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 9 ms 340 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 8 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 30 ms 468 KB Output is correct
13 Correct 30 ms 468 KB Output is correct
14 Correct 15 ms 456 KB Output is correct
15 Correct 57 ms 508 KB Output is correct

Subtask #8
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 9 ms 340 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 8 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 7 ms 580 KB Output is correct
13 Correct 8 ms 572 KB Output is correct
14 Correct 8 ms 468 KB Output is correct
15 Correct 8 ms 468 KB Output is correct
16 Correct 30 ms 468 KB Output is correct
17 Correct 30 ms 468 KB Output is correct
18 Correct 15 ms 456 KB Output is correct
19 Correct 57 ms 508 KB Output is correct
20 Correct 600 ms 3356 KB Output is correct
21 Correct 424 ms 3144 KB Output is correct
22 Correct 464 ms 3368 KB Output is correct

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 9 ms 340 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 8 ms 340 KB Output is correct
9 Correct 35 ms 2488 KB Output is correct
10 Correct 16 ms 704 KB Output is correct
11 Correct 12 ms 504 KB Output is correct
12 Correct 6 ms 468 KB Output is correct
13 Correct 506 ms 1800 KB Output is correct
14 Correct 491 ms 1836 KB Output is correct
15 Correct 456 ms 1420 KB Output is correct
16 Correct 450 ms 964 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 7 ms 580 KB Output is correct
21 Correct 8 ms 572 KB Output is correct
22 Correct 8 ms 468 KB Output is correct
23 Correct 8 ms 468 KB Output is correct
24 Correct 30 ms 468 KB Output is correct
25 Correct 30 ms 468 KB Output is correct
26 Correct 15 ms 456 KB Output is correct
27 Correct 57 ms 508 KB Output is correct
28 Correct 600 ms 3356 KB Output is correct
29 Correct 424 ms 3144 KB Output is correct
30 Correct 464 ms 3368 KB Output is correct
31 Execution timed out 2089 ms 4128 KB Time limit exceeded
32 Halted 0 ms 0 KB -