oj.uz

답안 #348546

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
348546 2021-01-15T07:33:21 Z 2qbingxuan Intergalactic ship (IZhO19_xorsum) C++14
62 / 100
 2000 ms 33260 KB 
#pragma GCC optimize("Ofast")
#pragma GCC targat("avx2")
#pragma loop_opt(on)
#include <bits/stdc++.h>
#ifdef local
#define debug(args...) qqbx(#args, args)
template <typename ...T> void qqbx(const char *s, T ...args) {
    int cnt = sizeof...(T);
    ((std::cerr << "(" << s << ") = (") , ... , (std::cerr << args << (--cnt ? ", " : ")\n")));
}
#define TAK(args...) std::ostream &operator<<(std::ostream &O, args)
#define NIE(STL, BEG, END, OUT) template <typename ...T> TAK(std::STL<T...> v) \
    { int f=0; O << BEG; for(auto e: v) O << (f++ ? ", " : "") << OUT; return O << END; }
NIE(vector, "[", "]", e)
NIE(map, "{", "}", e.first << ',' << e.second)
template <typename T, size_t N> TAK(std::array<T,N> v) { return O << std::vector<T>(v.begin(), v.end()); }
#else
#define debug(...) ((void)0)
#define safe ((void)0)
#endif // local
#define pb emplace_back
#define all(v) begin(v),end(v)
#define int ll

using namespace std;
using ll = long long;
using ld = double;
const int N = 100002, MOD = 1000000007;
const ll INF = 1e18;
const ld PI = acos(-1);

struct Basis {
    vector<int> b;
    Basis & operator+=(int x) {
        for(int y: b)
            x = min(x, x^y);
        if(x)
            b.pb(x);
        return *this;
    }
    vector<int> span() const {
        int n = b.size();
        vector<int> res(1<<n);
        for(int i = 0; i < n; i++) res[1<<i] = b[i];
        for(int i = 1; i < (1<<n); i++) res[i] = res[i&-i] ^ res[i-(i&-i)];
        return res;
    }
    size_t size() const { return b.size(); }
    int calc(int x) {
        // return sum(y^x for y in span());
        int res = 0;
        // for(int y: span())
        //     res += y ^ x;
        // return res;
        auto take = [](int n, int d) {
            if(n == 0) return d ? 0 : 1;
            return 1 << n-1;
        };
        int n = b.size();
        for(int j = 0; j < 7; j++) {
            int cnt = 0;
            for(int y: b) if(y >> j & 1) ++cnt;
            res += (1<<j) * (1<<(n-cnt)) * take(cnt, ~x>>j&1);
        }
        return res;
    }
};

int cnt[1005][1005];
bitset<128> bA[1005][1005], bB[1005][1005], bC[1005][1005];
int query(int pre[][1005], int lx, int ly, int rx, int ry) {
    return pre[rx][ry] - (lx ? pre[lx-1][ry] : 0) - (ly ? pre[rx][ly-1] : 0) + (lx && ly ? pre[lx-1][ly-1] : 0);
}
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int n, q;
    cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    cin >> q;
    vector<int> pw(q+1);
    pw[0] = 1;
    for(int i = 1; i <= q; i++) pw[i] = pw[i-1] * 2LL % MOD;
    vector<tuple<int,int,int>> Qs(q);
    vector<tuple<int,int,int>> evt;
    for(auto &[l, r, x]: Qs) {
        cin >> l >> r >> x;
        --l, --r;
        evt.pb(l, 1, x);
        evt.pb(r+1, -1, x);
    }

    int ans = 0;
    sort(all(evt));
    map<int,int> mp;
    for(int i = 0, j = 0; i < n; i++) {
        while(j < q*2 && get<0>(evt[j]) <= i) {
            auto [_, v, x] = evt[j++];
            if(_ != i) continue;
            mp[x] += v;
            if(mp[x] == 0) mp.erase(x);
        }
        debug(mp);
        Basis b;
        // make basis
        for(auto [val, cnt]: mp)
            b += val;
        // enumerate basis
        int cnt = 1LL * pw[q - b.size()] * (i+1) * (n-i);
        for(int x: b.span()) {
            int ai = a[i] ^ x;
            ans = (ans + 1LL * ai * ai * cnt) % MOD;
            debug(ai, cnt);
        }
    }
    
    for(int b = 0; b < 128; b++) {
        for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) cnt[i][j] = 0;
        for(auto [l, r, x]: Qs) if(x == b) cnt[l][r] += 1;
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < n; j++) {
                if(i) cnt[i][j] += cnt[i-1][j];
                if(j) cnt[i][j] += cnt[i][j-1];
                if(i && j) cnt[i][j] -= cnt[i-1][j-1];
            }
        }
        for(int i = 0; i < n; i++) {
            for(int j = i+1; j < n; j++) {
                if(query(cnt, 0, j, i, n-1))
                    bC[i][j][b] = true;
                if(query(cnt, 0, i, i, j-1))
                    bA[i][j][b] = true;
                if(query(cnt, i+1, j, j, n-1))
                    bB[i][j][b] = true;
            }
        }
    }

    auto calc = [&](int i, int j) {
        /*
        for(auto [l, r, x]: Qs) {
            if(l <= i && j <= r) {
                C += x;
            } else if(l <= i && r >= i && r < j) {
                A += x;
            } else if(l > i && l <= j && r >= j) {
                debug(l, r, i, j);
                B += x;
            }
        }
        */
        Basis A, B, C;
        for(int b = 0; b < 128; b++) {
            if(bA[i][j][b])
                A += b;
            if(bB[i][j][b])
                B += b;
            if(bC[i][j][b])
                C += b;
        }
        int res = 0;
        for(int x: C.span()) {
            int ai = a[i] ^ x, aj = a[j] ^ x;
            debug(ai, aj);
            res = (res + 1LL * A.calc(ai) * B.calc(aj)) % MOD;
        }
        debug(res);
        return 1LL * res * pw[q - (C.size() + A.size() + B.size())] % MOD;
    };

    for(int i = 0; i < n; i++) {
        for(int j = i+1; j < n; j++) {
            int cnt = 2 * (i+1) * (n-j);
            ans = (ans + 1LL * calc(i, j) * cnt) % MOD;
        }
    }

    cout << ans << '\n';
}

Compilation message

xorsum.cpp:2: warning: ignoring #pragma GCC targat [-Wunknown-pragmas]
    2 | #pragma GCC targat("avx2")
      | 
xorsum.cpp:3: warning: ignoring #pragma loop_opt  [-Wunknown-pragmas]
    3 | #pragma loop_opt(on)
      | 
xorsum.cpp: In lambda function:
xorsum.cpp:57:26: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   57 |             return 1 << n-1;
      |                         ~^~
xorsum.cpp: In function 'int main()':
xorsum.cpp:86:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   86 |     for(auto &[l, r, x]: Qs) {
      |               ^
xorsum.cpp:98:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   98 |             auto [_, v, x] = evt[j++];
      |                  ^
xorsum.cpp:106:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  106 |         for(auto [val, cnt]: mp)
      |                  ^
xorsum.cpp:119:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  119 |         for(auto [l, r, x]: Qs) if(x == b) cnt[l][r] += 1;
      |                  ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 364 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 364 KB Output is correct
6 Correct 13 ms 2028 KB Output is correct
7 Correct 9 ms 1388 KB Output is correct
8 Correct 10 ms 1900 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 9952 KB Output is correct
2 Correct 19 ms 2756 KB Output is correct
3 Correct 13 ms 1772 KB Output is correct
4 Correct 10 ms 1644 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1101 ms 33260 KB Output is correct
2 Correct 1093 ms 32108 KB Output is correct
3 Correct 1042 ms 28140 KB Output is correct
4 Correct 1047 ms 29036 KB Output is correct

Subtask #5
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 876 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

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

Subtask #7
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 364 KB Output is correct
6 Correct 13 ms 2028 KB Output is correct
7 Correct 9 ms 1388 KB Output is correct
8 Correct 10 ms 1900 KB Output is correct
9 Correct 2 ms 876 KB Output is correct
10 Correct 2 ms 748 KB Output is correct
11 Correct 2 ms 748 KB Output is correct
12 Correct 91 ms 2412 KB Output is correct
13 Correct 93 ms 2284 KB Output is correct
14 Correct 16 ms 2028 KB Output is correct
15 Correct 43 ms 2332 KB Output is correct

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 364 KB Output is correct
6 Correct 13 ms 2028 KB Output is correct
7 Correct 9 ms 1388 KB Output is correct
8 Correct 10 ms 1900 KB Output is correct
9 Correct 2 ms 876 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 1388 KB Output is correct
13 Correct 7 ms 1388 KB Output is correct
14 Correct 6 ms 1388 KB Output is correct
15 Correct 7 ms 1388 KB Output is correct
16 Correct 91 ms 2412 KB Output is correct
17 Correct 93 ms 2284 KB Output is correct
18 Correct 16 ms 2028 KB Output is correct
19 Correct 43 ms 2332 KB Output is correct
20 Execution timed out 2033 ms 24144 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 364 KB Output is correct
6 Correct 13 ms 2028 KB Output is correct
7 Correct 9 ms 1388 KB Output is correct
8 Correct 10 ms 1900 KB Output is correct
9 Correct 80 ms 9952 KB Output is correct
10 Correct 19 ms 2756 KB Output is correct
11 Correct 13 ms 1772 KB Output is correct
12 Correct 10 ms 1644 KB Output is correct
13 Correct 1101 ms 33260 KB Output is correct
14 Correct 1093 ms 32108 KB Output is correct
15 Correct 1042 ms 28140 KB Output is correct
16 Correct 1047 ms 29036 KB Output is correct
17 Correct 2 ms 876 KB Output is correct
18 Correct 2 ms 748 KB Output is correct
19 Correct 2 ms 748 KB Output is correct
20 Correct 7 ms 1388 KB Output is correct
21 Correct 7 ms 1388 KB Output is correct
22 Correct 6 ms 1388 KB Output is correct
23 Correct 7 ms 1388 KB Output is correct
24 Correct 91 ms 2412 KB Output is correct
25 Correct 93 ms 2284 KB Output is correct
26 Correct 16 ms 2028 KB Output is correct
27 Correct 43 ms 2332 KB Output is correct
28 Execution timed out 2033 ms 24144 KB Time limit exceeded
29 Halted 0 ms 0 KB -