Submission #1103154

#	Time	Username	Problem	Language	Result	Execution time	Memory
1103154		Zero_OP	Intergalactic ship (IZhO19_xorsum)	C++14	4 / 100	1 ms	596 KiB

xorsum

#include <bits/stdc++.h>

using namespace std;

#define rep(i, l, r) for(int i = (l), _r = (r); i < _r; ++i)
#define FOR(i, l, r) for(int i = (l), _r = (r); i <= _r; ++i)
#define ROF(i, r, l) for(int i = (r), _l = (l); i >= _l; --i)
#define all(v) begin(v), end(v)
#define compact(v) v.erase(unique(all(v)), end(v))
#define sz(v) (int)v.size()
#define dbg(x) "[" #x " = " << (x) << "]"

template<typename T>
bool minimize(T& a, const T& b){
    if(a > b) return a = b, true; return false;
}

template<typename T>
bool maximize(T& a, const T& b){
    if(a < b) return a = b, true; return false;
}

using ll = long long;
using ld = long double;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template<typename T> T random_int(T l, T r){ return uniform_int_distribution<T>(l, r)(rng); }
template<typename T> T random_real(T l, T r){ return uniform_real_distribution<T>(l, r)(rng); }

const int MAX = 1e3 + 5;
const int mod = 1e9 + 7;

struct mint{
    int v;
    mint(int v = 0) : v(v) {}
    mint(ll v = 0) : v(v % mod) {}

    mint& operator += (const mint& a){ v += a.v; if(v >= mod) v -= mod; return *this; }
    mint& operator -= (const mint& a){ v -= a.v; if(v < 0) v += mod; return *this; }
    mint& operator *= (const mint& a){ v = 1LL * v * a.v % mod; return *this; }
    mint& operator /= (const mint& a){ return (*this) *= a.inv(); }

    mint power(ll pw) const {
        mint res(1);
        mint base = *this;
        for(; pw > 0; pw /= 2, base *= base){
            if(pw & 1) res *= base;
        }
        return res;
    }

    mint inv() const {
        return power(mod - 2);
    }

    friend mint operator + (mint a, const mint& b){ return a += b; }
    friend mint operator - (mint a, const mint& b){ return a -= b; }
    friend mint operator * (mint a, const mint& b){ return a *= b; }
    friend mint operator / (mint a, const mint& b){ return a /= b; }

    friend istream& operator >> (istream& in, mint& x){ return in >> x.v; }
    friend ostream& operator << (ostream& out, const mint& x){ return out << x.v; }

    #define define_logical_operation(o) friend bool operator o (const mint& a, const mint& b){ return a.v o b.v; }
    define_logical_operation(==)
    define_logical_operation(!=)
    define_logical_operation(<)
    define_logical_operation(>)
    define_logical_operation(<=)
    define_logical_operation(>=)
};

int n, q, a[MAX], l[MAX], r[MAX], x[MAX];

namespace subtask_small{
    int diff[MAX];
    void solve(){
        mint ans(0);
        for(int mask = 0; mask < (1 << q); ++mask){
            for(int i = 1; i <= n; ++i) diff[i] = 0;

            for(int i = 0; i < q; ++i){
                if(mask >> i & 1){
                    diff[l[i + 1]] ^= x[i + 1];
                    diff[r[i + 1] + 1] ^= x[i + 1];
                }
            }

            for(int i = 1; i <= n; ++i){
                diff[i] ^= diff[i - 1];
                a[i] ^= diff[i];
            }


            for(int i = 1; i <= n; ++i){
                mint sum = 0;
                for(int j = i; j <= n; ++j){
                    sum += mint(a[j]);
                    ans += sum * sum;
                }
            }

            for(int i = 1; i <= n; ++i){
                a[i] ^= diff[i];
            }
        }

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

void testcase(){
    cin >> n;
    for(int i = 1; i <= n; ++i){
        cin >> a[i];
    }

    cin >> q;
    for(int i = 1; i <= q; ++i){
        cin >> l[i] >> r[i] >> x[i];
    }

    if(n <= 10 && q <= 10) subtask_small::solve();
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    #define filename "task"
    if(fopen(filename".inp", "r")){
        freopen(filename".inp", "r", stdin);
        freopen(filename".out", "w", stdout);
    }

    int T = 1; //cin >> T;
    while(T--) testcase();

    return 0;
}

Compilation message (stderr)

xorsum.cpp: In function 'bool minimize(T&, const T&)':
xorsum.cpp:15:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   15 |     if(a > b) return a = b, true; return false;
      |     ^~
xorsum.cpp:15:35: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   15 |     if(a > b) return a = b, true; return false;
      |                                   ^~~~~~
xorsum.cpp: In function 'bool maximize(T&, const T&)':
xorsum.cpp:20:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   20 |     if(a < b) return a = b, true; return false;
      |     ^~
xorsum.cpp:20:35: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   20 |     if(a < b) return a = b, true; return false;
      |                                   ^~~~~~
xorsum.cpp: In function 'int main()':
xorsum.cpp:132:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  132 |         freopen(filename".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
xorsum.cpp:133:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  133 |         freopen(filename".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 0 / 5
• Subtask 3: 0 / 6
• Subtask 4: 0 / 9
• Subtask 5: 0 / 8
• Subtask 6: 0 / 11
• Subtask 7: 0 / 19
• Subtask 8: 0 / 30
• Subtask 9: 0 / 8