oj.uz

Submission #344189

# Submission time Handle Problem Language Result Execution time Memory
344189 2021-01-05T08:45:05 Z Nurlykhan Intergalactic ship (IZhO19_xorsum) C++17
9 / 100
 2000 ms 1516 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = (int)1e5 + 10;
const int mod = (int)1e9 + 7;

int n, q;
int a[N], b[N];
int l[N], r[N], x[N], xr[N];

int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
        scanf("%d", &a[i]);
    scanf("%d", &q);
    for (int i = 0; i < q; i++)
        scanf("%d%d%d", &l[i], &r[i], &x[i]);

    int ans = 0;
    for (int i = 0; i < (1 << q); i++) {
        for (int j = 1; j <= n; j++) {
            xr[j] = 0;
        }
        for (int j = 0; j < q; j++) {
            if ((i >> j) % 2) {
                xr[l[j]] ^= x[j];
                xr[r[j] + 1] ^= x[j];
            }
        }
        for (int i = 1; i <= n; i++) {
            xr[i] ^= xr[i - 1];
            b[i] = a[i] ^ xr[i];
        }
        for (int i = 1; i <= n; i++) {
            int s = 0;
            for (int j = i; j <= n; j++) {
                s += b[j];
                (ans += (s * 1ll * s) % mod) %= mod;
            }
        }
    }

    cout << ans;
    return 0;
}

Compilation message

xorsum.cpp: In function 'int main()':
xorsum.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   13 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
xorsum.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   15 |         scanf("%d", &a[i]);
      |         ~~~~~^~~~~~~~~~~~~
xorsum.cpp:16:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   16 |     scanf("%d", &q);
      |     ~~~~~^~~~~~~~~~
xorsum.cpp:18:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   18 |         scanf("%d%d%d", &l[i], &r[i], &x[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 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 0 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 25 ms 492 KB Output is correct
7 Correct 23 ms 364 KB Output is correct
8 Correct 23 ms 364 KB Output is correct

Subtask #3
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 1516 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 2085 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 2067 ms 364 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 2067 ms 364 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 0 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 25 ms 492 KB Output is correct
7 Correct 23 ms 364 KB Output is correct
8 Correct 23 ms 364 KB Output is correct
9 Execution timed out 2067 ms 364 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 0 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 25 ms 492 KB Output is correct
7 Correct 23 ms 364 KB Output is correct
8 Correct 23 ms 364 KB Output is correct
9 Execution timed out 2067 ms 364 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 0 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 25 ms 492 KB Output is correct
7 Correct 23 ms 364 KB Output is correct
8 Correct 23 ms 364 KB Output is correct
9 Incorrect 23 ms 1516 KB Output isn't correct
10 Halted 0 ms 0 KB -