oj.uz

Submission #903919

# Submission time Handle Problem Language Result Execution time Memory
903919 2024-01-11T14:38:11 Z LucaLucaM Intergalactic ship (IZhO19_xorsum) C++17
0 / 100
 2000 ms 2268 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cstring>
#warning That's the baby, that's not my baby

typedef long long ll;

const int mod = 1e9 + 7;

struct Update {
  int l, r, x;
};

int power(int a, int b) {
  int p = 1;
  while (b) {
    if (b & 1) {
      p = (ll) p * a % mod;
    }
    a = (ll) a * a % mod;
    b >>= 1;
  }
  return p;
}

int solve(std::vector<int> a) {
  int n = (int) a.size();
  ll ret = 0;
  for (int i = 0; i < n; i++) {
    ret += (ll) a[i] * a[i] * (i + 1) * (n - i) % mod;
    for (int j = i + 1; j < n; j++) {
      ret += (ll) 2 * a[i] * a[j] * (i + 1) * (n - j) % mod;
    }
  }
  return ret % mod;
}

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

  int n;
  std::cin >> n;
  std::vector<int> a(n);
  for (auto &x : a) {
    std::cin >> x;
  }

  int q;
  std::cin >> q;

  if (q == 0) {
    std::cout << solve(a);
    return 0;
  }

  std::vector<Update> Q(q);

  for (auto &[l, r, x] : Q) {
    std::cin >> l >> r >> x;
    --l, --r;
  }

  ll answer = 0;

  for (int mask = 0; mask < (1 << q); mask++) {
    std::vector<int> b = a;
    for (int i = 0; i < q; i++) {
      if (mask & (1 << i)) {
        for (int k = Q[i].l; k <= Q[i].r; k++) {
          b[k] ^= Q[i].x;
        }
      }
      answer += solve(b);
    }
  }

  std::cout << answer % mod;


  return 0;
}

Compilation message

xorsum.cpp:6:2: warning: #warning That's the baby, that's not my baby [-Wcpp]
    6 | #warning That's the baby, that's not my baby
      |  ^~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 360 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Incorrect 2 ms 504 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 360 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Incorrect 2 ms 504 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1101 ms 2268 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 2037 ms 348 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 2019 ms 348 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 2019 ms 348 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 360 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Incorrect 2 ms 504 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 360 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Incorrect 2 ms 504 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 360 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Incorrect 2 ms 504 KB Output isn't correct
4 Halted 0 ms 0 KB -