Submission #947472

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
947472	2024-03-16T08:54:21 Z	dilanyan	Intergalactic ship (IZhO19_xorsum)	C++17	0 / 100	2000 ms	1628 KB

xorsum

//-------------dilanyan------------\\ 
 
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
 
//------------------KarginDefines--------------------\\ 
 
#define ll long long
#define pb push_back
#define all(u) (u).begin(), (u).end()
#define pqueue priority_queue
#define upper upper_bound
#define lower lower_bound
#define umap unordered_map
#define uset unordered_set
#define Kargin ios_base::sync_with_stdio(false);cin.tie(NULL);
#define Usaco freopen(".in", "r", stdin); freopen(".out", "w", stdout);
 
 
//-------------------KarginConstants------------------\\ 
 
const ll mod = 1000000007;
const ll inf = 1e9 + 15;
 
//-------------------KarginCode------------------------\\ 
 
const int N = 1005,M = 100005;
int a[N];

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

query q[M];


void KarginSolve() {
    int n; cin >> n;
    for (int i = 0;i < n;i++) cin >> a[i];
    int m; cin >> m;
    for (int i = 0;i < m;i++) {
        cin >> q[i].l >> q[i].r >> q[i].x;
        q[i].l--;
    }
    ll ans = 0;
    for (int i = 0;i < (1 << m);i++) {
        for (int j = 0;j < m;j++) {
            if (i & (1 << j)) {
                for (int k = q[j].l;k < q[i].r;k++) a[k] ^= q[i].x;
            }
        }
        for (int x = 0;x < n;x++) {
            ll sum = 0;
            for (int j = x;j < n;j++) {
                sum += a[j];
                ans += sum * sum;
            }
        }
        for (int j = 0;j < m;j++) {
            if (i & (1 << j)) {
                for (int k = q[j].l;k < q[i].r;k++) a[k] ^= q[i].x;
            }
        }
    }
    cout << ans << '\n';
}
 
int main() {
    Kargin;
    int test = 1;
    //cin >> test;
    while (test--) {
        KarginSolve();
    }
    return 0;
}

Compilation message

xorsum.cpp:1:1: warning: multi-line comment [-Wcomment]
    1 | //-------------dilanyan------------\\
      | ^
xorsum.cpp:8:1: warning: multi-line comment [-Wcomment]
    8 | //------------------KarginDefines--------------------\\
      | ^
xorsum.cpp:22:1: warning: multi-line comment [-Wcomment]
   22 | //-------------------KarginConstants------------------\\
      | ^
xorsum.cpp:27:1: warning: multi-line comment [-Wcomment]
   27 | //-------------------KarginCode------------------------\\
      | ^

Subtask #1
0 / 4.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Incorrect	348 KB	Output isn't correct
4	Halted	0 KB	-

Subtask #2
0 / 5.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Incorrect	348 KB	Output isn't correct
4	Halted	0 KB	-

Subtask #3
0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	13 ms	1628 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	2029 ms	344 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	49 ms	440 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	49 ms	440 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #7
0 / 19.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Incorrect	348 KB	Output isn't correct
4	Halted	0 KB	-

Subtask #8
0 / 30.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Incorrect	348 KB	Output isn't correct
4	Halted	0 KB	-

Subtask #9
0 / 8.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Incorrect	348 KB	Output isn't correct
4	Halted	0 KB	-