oj.uz

Submission #342354

# Submission time Handle Problem Language Result Execution time Memory
342354 2021-01-01T23:39:19 Z kekw Intergalactic ship (IZhO19_xorsum) C++17
53 / 100
 673 ms 12140 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>

#define range(i, n) for (int i = 0; i < (n); ++i)
#define ar array
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()


typedef long long ll;
typedef long double ld;
using namespace std;

//using namespace __gnu_pbds;

const ll INF = 1e18 + 5;
const int INFi = 1e9;
const int maxN = 1e5 + 1500;
const int md2 = 998244353;
const int md = 1e9 + 7;


int add(int a, int b) {
    if (a + b >= md) return a + b - md;
    return a + b;
}

int sub(int a, int b) {
    if (a - b < 0) return a - b + md;
    return a - b;
}

int mul(int a, int b) {
    return (1ll * a * b) % md;
}

int st2[100001];
int a[100];
int b[100000][3];

int Cnt[3][1005][1005];

void solve() {
    int n;
    cin >> n;
    range(i, n) cin >> a[i];
    int q;
    cin >> q;
    st2[0] = 1;
    for (int i = 1; i <= q; ++i) st2[i] = mul(st2[i - 1], 2);
    range(i, q) range(j, 3) cin >> b[i][j];
    int ans = 0;
    range(b1, 8) {
        range(b2, 8) {
            int result = 0;
            range(i, n) range(e, 3) memset(Cnt[e][i], 0, sizeof(Cnt[e][i]));
            auto ADD = [&](int x1, int y1, int x2, int y2, int m) {
                Cnt[m][x1][y1] += 1;
                Cnt[m][x2 + 1][y2 + 1] += 1;
                Cnt[m][x1][y2 + 1] -= 1;
                Cnt[m][x2 + 1][y1] -= 1;
            };
            range(i, q) {
                auto[l, r, x] = b[i];
                if ((x & (1 << b1)) && (x & (1 << b2))) {
                    ADD(l - 1, l - 1, r - 1, r - 1, 0);
                    ADD(l - 1, r, r - 1, n, 1);
                    if (l != 1) ADD(0, l - 1, l - 2, r - 1, 2);
                } else if (x & (1 << b1)) {
                    ADD(l - 1, 0, r - 1, n, 1);
                } else if (x & (1 << b2)) {
                    ADD(0, l - 1, n, r - 1, 2);
                }
            }
            range(i, n) {
                range(j, n) {
                    range(e, 3) {
                        if (i) Cnt[e][i][j] += Cnt[e][i - 1][j];
                        if (j) Cnt[e][i][j] += Cnt[e][i][j - 1];
                        if (i && j) Cnt[e][i][j] -= Cnt[e][i - 1][j - 1];
                    }
                }
            }
            range(i, n) {
                for (int j = i; j < n; ++j) {
                    int cur = 0;
                    if (Cnt[1][i][j] && Cnt[2][i][j]) {
                        cur = st2[q - 2];
                    } else if (Cnt[1][i][j] && Cnt[0][i][j]) {
                        cur = st2[q - 2];
                    } else if (Cnt[2][i][j] && Cnt[0][i][j]) {
                        cur = st2[q - 2];
                    } else if (Cnt[1][i][j]) {
                        if (a[j] & (1 << b2)) {
                            cur = st2[q - 1];
                        }
                    } else if (Cnt[2][i][j]) {
                        if (a[i] & (1 << b1)) {
                            cur = st2[q - 1];
                        }
                    } else if (Cnt[0][i][j]) {
                        int A = (a[i] >> b1) & 1;
                        int B = (a[j] >> b2) & 1;
                        if (A == B) {
                            cur = st2[q - 1];
                        }
                    } else if (((a[i] >> b1) & 1) && ((a[j] >> b2) & 1)) {
                        cur = st2[q];
                    }
                    result = add(result, mul(1 + (i != j), mul(cur, mul(i + 1, n - j))));
                }
            }
            ans = add(ans, mul(result, 1 << (b1 + b2)));
        }
    }
    cout << ans << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    // cout << setprecision(15) << fixed;
    int tests = 1;
    //cin >> tests;
    range(_, tests) {
        solve();
    }
    return 0;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 10 ms 1516 KB Output is correct
7 Correct 10 ms 1516 KB Output is correct
8 Correct 10 ms 1516 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 3052 KB Output is correct
2 Correct 18 ms 1772 KB Output is correct
3 Correct 10 ms 1516 KB Output is correct
4 Correct 10 ms 1516 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 673 ms 12140 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
8.0 / 8.0

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

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 896 KB Output is correct
2 Correct 2 ms 748 KB Output is correct
3 Correct 2 ms 748 KB Output is correct
4 Correct 7 ms 876 KB Output is correct
5 Correct 6 ms 748 KB Output is correct
6 Correct 6 ms 748 KB Output is correct
7 Correct 6 ms 748 KB Output is correct

Subtask #7
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 10 ms 1516 KB Output is correct
7 Correct 10 ms 1516 KB Output is correct
8 Correct 10 ms 1516 KB Output is correct
9 Correct 2 ms 896 KB Output is correct
10 Correct 2 ms 748 KB Output is correct
11 Correct 2 ms 748 KB Output is correct
12 Correct 10 ms 1516 KB Output is correct
13 Correct 12 ms 1644 KB Output is correct
14 Correct 11 ms 1644 KB Output is correct
15 Correct 12 ms 1516 KB Output is correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 10 ms 1516 KB Output is correct
7 Correct 10 ms 1516 KB Output is correct
8 Correct 10 ms 1516 KB Output is correct
9 Correct 2 ms 896 KB Output is correct
10 Correct 2 ms 748 KB Output is correct
11 Correct 2 ms 748 KB Output is correct
12 Correct 7 ms 876 KB Output is correct
13 Correct 6 ms 748 KB Output is correct
14 Correct 6 ms 748 KB Output is correct
15 Correct 6 ms 748 KB Output is correct
16 Correct 10 ms 1516 KB Output is correct
17 Correct 12 ms 1644 KB Output is correct
18 Correct 11 ms 1644 KB Output is correct
19 Correct 12 ms 1516 KB Output is correct
20 Incorrect 325 ms 7852 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 10 ms 1516 KB Output is correct
7 Correct 10 ms 1516 KB Output is correct
8 Correct 10 ms 1516 KB Output is correct
9 Correct 93 ms 3052 KB Output is correct
10 Correct 18 ms 1772 KB Output is correct
11 Correct 10 ms 1516 KB Output is correct
12 Correct 10 ms 1516 KB Output is correct
13 Incorrect 673 ms 12140 KB Output isn't correct
14 Halted 0 ms 0 KB -