oj.uz

답안 #564811

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
564811 2022-05-19T16:43:29 Z Stickfish Intergalactic ship (IZhO19_xorsum) C++17
92 / 100
 2000 ms 4836 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[t])
        return;
    int sz = bs.count();
    for (int i = 0; i < MAXVAL;) {
        if (bs[i])
            bs[i ^ t] = bs[i];
        if (sz <= 8)
            i = bs._Find_next(i);
        else
            ++i;
    }
}

bitset<MAXVAL> xorbs(bitset<MAXVAL>& bs, int t) {
    bitset<MAXVAL> ans;
    for (int i = 0; i < MAXVAL; ++i)
        ans[i ^ t] = bs[i];
    return ans;
}

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;
}

bitset<MAXVAL> get_bs(bitset<MAXVAL> genbs) {
    for (int bt = 1; bt < 128; bt *= 2) {
        for (int x = bt; x < 128; x += bt * 2) {
            if (genbs[x]) {
                for (int y = bt; y < 128; y += bt * 2) {
                    if (y != x && genbs[y]) {
                        genbs[y ^ x] = 1;
                        genbs[y] = 0;
                    }
                }
                break;
            }
        }
    }
    genbs[0] = 0;
    int t = genbs.count();
    bitset<MAXVAL> ans;
    if (t == 0) {
        ans[0] = 1;
        return ans;
    }
    int x = 0;
    for (int msk = 0; msk < (1 << t); ++msk) {
        ans[x] = 1;
        int deltax = genbs._Find_first();
        for (int bt = 1; bt < (1 << t); bt *= 2) {
            x ^= deltax;
            if ((msk & bt) == 0) {
                break;
            }
            deltax = genbs._Find_next(deltax);
        }
    }
    return ans;
}

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);
        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 (int x = 0; x < 128; ++x) {
                    genbsij[x] = (genij[x] += change_ij[j][x]);
                    genbsi[x] = (geni[x] += change_i[j][x]);
                    genbsj[x] = (genj[x] += change_j[j][x]);
                }
            }
            bitset<MAXVAL> bsi = get_bs(genbsi);
            bitset<MAXVAL> bsj = get_bs(genbsj);
            bitset<MAXVAL> bsij = get_bs(genbsij);
            bsi = xorbs(bsi, a[i]);
            bsj = xorbs(bsj, a[j]);
            ll addans = 0;
            //ans += bsi.count() + bsj.count() + bsij.count();
            //continue;
            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;
            addans *= pw(bsi.count() * bsj.count() * bsij.count(), MOD - 2);
            ans += addans;
            ans %= MOD;
        }
    }
    cout << ans << endl;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 352 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 13 ms 340 KB Output is correct
7 Correct 12 ms 340 KB Output is correct
8 Correct 12 ms 340 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 3276 KB Output is correct
2 Correct 19 ms 852 KB Output is correct
3 Correct 14 ms 500 KB Output is correct
4 Correct 11 ms 468 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1117 ms 1804 KB Output is correct
2 Correct 1119 ms 1900 KB Output is correct
3 Correct 1075 ms 1552 KB Output is correct
4 Correct 1085 ms 820 KB Output is correct

Subtask #5
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 2 ms 356 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 2 ms 356 KB Output is correct
4 Correct 8 ms 624 KB Output is correct
5 Correct 8 ms 628 KB Output is correct
6 Correct 7 ms 620 KB Output is correct
7 Correct 7 ms 504 KB Output is correct

Subtask #7
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 13 ms 340 KB Output is correct
7 Correct 12 ms 340 KB Output is correct
8 Correct 12 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 2 ms 356 KB Output is correct
12 Correct 31 ms 468 KB Output is correct
13 Correct 33 ms 496 KB Output is correct
14 Correct 27 ms 448 KB Output is correct
15 Correct 62 ms 468 KB Output is correct

Subtask #8
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 13 ms 340 KB Output is correct
7 Correct 12 ms 340 KB Output is correct
8 Correct 12 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 2 ms 356 KB Output is correct
12 Correct 8 ms 624 KB Output is correct
13 Correct 8 ms 628 KB Output is correct
14 Correct 7 ms 620 KB Output is correct
15 Correct 7 ms 504 KB Output is correct
16 Correct 31 ms 468 KB Output is correct
17 Correct 33 ms 496 KB Output is correct
18 Correct 27 ms 448 KB Output is correct
19 Correct 62 ms 468 KB Output is correct
20 Correct 776 ms 4136 KB Output is correct
21 Correct 617 ms 4024 KB Output is correct
22 Correct 638 ms 4144 KB Output is correct

Subtask #9
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 13 ms 340 KB Output is correct
7 Correct 12 ms 340 KB Output is correct
8 Correct 12 ms 340 KB Output is correct
9 Correct 36 ms 3276 KB Output is correct
10 Correct 19 ms 852 KB Output is correct
11 Correct 14 ms 500 KB Output is correct
12 Correct 11 ms 468 KB Output is correct
13 Correct 1117 ms 1804 KB Output is correct
14 Correct 1119 ms 1900 KB Output is correct
15 Correct 1075 ms 1552 KB Output is correct
16 Correct 1085 ms 820 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 2 ms 356 KB Output is correct
20 Correct 8 ms 624 KB Output is correct
21 Correct 8 ms 628 KB Output is correct
22 Correct 7 ms 620 KB Output is correct
23 Correct 7 ms 504 KB Output is correct
24 Correct 31 ms 468 KB Output is correct
25 Correct 33 ms 496 KB Output is correct
26 Correct 27 ms 448 KB Output is correct
27 Correct 62 ms 468 KB Output is correct
28 Correct 776 ms 4136 KB Output is correct
29 Correct 617 ms 4024 KB Output is correct
30 Correct 638 ms 4144 KB Output is correct
31 Execution timed out 2066 ms 4836 KB Time limit exceeded
32 Halted 0 ms 0 KB -