oj.uz

Submission #342518

# Submission time Handle Problem Language Result Execution time Memory
342518 2021-01-02T10:05:13 Z dxz05 Intergalactic ship (IZhO19_xorsum) C++14
9 / 100
 2000 ms 2412 KB 
//#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

typedef long long ll;
//mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.00001;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 2e6 + 4e4;
const int M = 1234;
const int LOG = 19;

int a[N], b[N];
int l[N], r[N], x[N];
void solve(int TC) {
    int n;
    cin >> n;

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

    int q;
    cin >> q;

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

    ll ans = 0;

    for (int mask = 0; mask < (1 << q); mask++){
        for (int i = 1; i <= n; i++) b[i] = a[i];
        for (int i = 0; i < q; i++){
            if (mask & (1 << i)){
                for (int j = l[i]; j <= r[i]; j++){
                    b[j] ^= x[i];
                }
            }
        }

        for (int i = 1; i <= n; i++){
            ll cur = 0;
            for (int j = i; j <= n; j++){
                cur += b[j];
                cur %= MOD;
                ans += cur * cur % MOD;
            }
        }
        ans %= MOD;
    }

    cout << ans;

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false);

    bool llololcal = false;
#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    llololcal = true;
#endif

    int TC = 1;
    //cin >> TC;

    for (int test = 1; test <= TC; test++) {
        debug(test);
        solve(test);
    }

    if (llololcal) cerr << endl << "Time: " << getCurrentTime() * 1000 << " ms" << endl;

    return 0;
}

Compilation message

xorsum.cpp: In function 'int main()':
xorsum.cpp:18:20: warning: statement has no effect [-Wunused-value]
   18 | #define debug(...) 42
      |                    ^~
xorsum.cpp:98:9: note: in expansion of macro 'debug'
   98 |         debug(test);
      |         ^~~~~

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

# 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 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 28 ms 364 KB Output is correct
7 Correct 27 ms 364 KB Output is correct
8 Correct 28 ms 364 KB Output is correct

Subtask #3
0 / 6.0

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

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2077 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2039 ms 492 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2039 ms 492 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
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 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 28 ms 364 KB Output is correct
7 Correct 27 ms 364 KB Output is correct
8 Correct 28 ms 364 KB Output is correct
9 Execution timed out 2039 ms 492 KB Time limit exceeded
10 Halted 0 ms 0 KB -

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 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 28 ms 364 KB Output is correct
7 Correct 27 ms 364 KB Output is correct
8 Correct 28 ms 364 KB Output is correct
9 Execution timed out 2039 ms 492 KB Time limit exceeded
10 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 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 28 ms 364 KB Output is correct
7 Correct 27 ms 364 KB Output is correct
8 Correct 28 ms 364 KB Output is correct
9 Incorrect 23 ms 2412 KB Output isn't correct
10 Halted 0 ms 0 KB -