oj.uz

답안 #342349

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
342349 2021-01-01T23:30:55 Z kekw Intergalactic ship (IZhO19_xorsum) C++17
92 / 100
 2000 ms 19292 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 = 1e7 + 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 binpow(int a, int b) {
    if (b <= 0) return 1;
    if (b % 2) return mul(a, binpow(a, b - 1));
    int m = binpow(a, b / 2);
    return mul(m, m);
}


int rev(int a) {
    return binpow(a, md - 2);
}

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    range(i, n) cin >> a[i];
    int q;
    cin >> q;
    vector<int> st2(q + 5);
    st2[0] = 1;
    for (int i = 1; i < st2.size(); ++i) st2[i] = mul(st2[i - 1], 2);
    vector<ar<int, 3>> b(q);
    range(i, q) range(j, 3) cin >> b[i][j];
    int ans = 0;
    sort(all(b));
    range(b1, 8) {
        range(b2, 8) {
            int result = 0;
            vector<vector<ar<int, 4>>> Cnt(n + 5, vector<ar<int, 4>>(n + 5));
            auto ADD = [&](int x1, int y1, int x2, int y2, int m) {
                Cnt[x1][y1][m] += 1;
                Cnt[x2 + 1][y2 + 1][m] += 1;
                Cnt[x1][y2 + 1][m] -= 1;
                Cnt[x2 + 1][y1][m] -= 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[i][j][e] += Cnt[i - 1][j][e];
                        if (j) Cnt[i][j][e] += Cnt[i][j - 1][e];
                        if (i && j) Cnt[i][j][e] -= Cnt[i - 1][j - 1][e];
                    }
                }
            }
            range(i, n) {
                for (int j = i; j < n; ++j) {
                    int cur = 0;
                    if (Cnt[i][j][1] && Cnt[i][j][2]) {
                        cur = st2[q - 2];
                    } else if (Cnt[i][j][1] && Cnt[i][j][0]) {
                        cur = st2[q - 2];
                    } else if (Cnt[i][j][2] && Cnt[i][j][0]) {
                        cur = st2[q - 2];
                    } else if (Cnt[i][j][1]) {
                        if (a[j] & (1 << b2)) {
                            cur = st2[q - 1];
                        }
                    } else if (Cnt[i][j][2]) {
                        if (a[i] & (1 << b1)) {
                            cur = st2[q - 1];
                        }
                    } else if (Cnt[i][j][0]) {
                        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;
}

Compilation message

xorsum.cpp: In function 'void solve()':
xorsum.cpp:62:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     for (int i = 1; i < st2.size(); ++i) st2[i] = mul(st2[i - 1], 2);
      |                     ~~^~~~~~~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 16 ms 568 KB Output is correct
7 Correct 16 ms 568 KB Output is correct
8 Correct 16 ms 568 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 150 ms 2140 KB Output is correct
2 Correct 30 ms 728 KB Output is correct
3 Correct 18 ms 664 KB Output is correct
4 Correct 16 ms 568 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1859 ms 16640 KB Output is correct
2 Correct 1871 ms 16696 KB Output is correct
3 Correct 1869 ms 16936 KB Output is correct
4 Correct 1855 ms 16712 KB Output is correct

Subtask #5
8.0 / 8.0

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

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 10 ms 492 KB Output is correct
5 Correct 10 ms 492 KB Output is correct
6 Correct 10 ms 492 KB Output is correct
7 Correct 10 ms 492 KB Output is correct

Subtask #7
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 16 ms 568 KB Output is correct
7 Correct 16 ms 568 KB Output is correct
8 Correct 16 ms 568 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 19 ms 576 KB Output is correct
13 Correct 17 ms 576 KB Output is correct
14 Correct 17 ms 576 KB Output is correct
15 Correct 16 ms 576 KB Output is correct

Subtask #8
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 16 ms 568 KB Output is correct
7 Correct 16 ms 568 KB Output is correct
8 Correct 16 ms 568 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 10 ms 492 KB Output is correct
13 Correct 10 ms 492 KB Output is correct
14 Correct 10 ms 492 KB Output is correct
15 Correct 10 ms 492 KB Output is correct
16 Correct 19 ms 576 KB Output is correct
17 Correct 17 ms 576 KB Output is correct
18 Correct 17 ms 576 KB Output is correct
19 Correct 16 ms 576 KB Output is correct
20 Correct 710 ms 6112 KB Output is correct
21 Correct 652 ms 5992 KB Output is correct
22 Correct 538 ms 6084 KB Output is correct

Subtask #9
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 16 ms 568 KB Output is correct
7 Correct 16 ms 568 KB Output is correct
8 Correct 16 ms 568 KB Output is correct
9 Correct 150 ms 2140 KB Output is correct
10 Correct 30 ms 728 KB Output is correct
11 Correct 18 ms 664 KB Output is correct
12 Correct 16 ms 568 KB Output is correct
13 Correct 1859 ms 16640 KB Output is correct
14 Correct 1871 ms 16696 KB Output is correct
15 Correct 1869 ms 16936 KB Output is correct
16 Correct 1855 ms 16712 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 10 ms 492 KB Output is correct
21 Correct 10 ms 492 KB Output is correct
22 Correct 10 ms 492 KB Output is correct
23 Correct 10 ms 492 KB Output is correct
24 Correct 19 ms 576 KB Output is correct
25 Correct 17 ms 576 KB Output is correct
26 Correct 17 ms 576 KB Output is correct
27 Correct 16 ms 576 KB Output is correct
28 Correct 710 ms 6112 KB Output is correct
29 Correct 652 ms 5992 KB Output is correct
30 Correct 538 ms 6084 KB Output is correct
31 Execution timed out 2083 ms 19292 KB Time limit exceeded
32 Halted 0 ms 0 KB -