oj.uz

Submission #646401

# Submission time Handle Problem Language Result Execution time Memory
646401 2022-09-29T18:10:16 Z murad_2005 XOR Sum (info1cup17_xorsum) C++17
45 / 100
 616 ms 1252 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2")
#pragma GCC optimize("unroll-loops")

using namespace std;

const int up = 1e5 + 5;

int a[up];

void solve(){
    int n;
    cin >> n;
    int Res = 0;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        for(int j = 1; j <= i; j++){
            Res^=(a[i]+a[j]);
        }
    }
    cout << Res;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t;
    t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 212 KB Output is correct

Subtask #2
0 / 11.0

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

Subtask #3
0 / 21.0

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

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 616 ms 752 KB Output is correct
4 Correct 549 ms 668 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Runtime error 583 ms 1252 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -