oj.uz

Submission #498880

# Submission time Handle Problem Language Result Execution time Memory
498880 2021-12-26T14:04:24 Z ahmedfouadnew XOR Sum (info1cup17_xorsum) C++17
45 / 100
 604 ms 1648 KB 
#pragma GCC optimize ("O3")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
int n;
int a[100005];
signed main()
{
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>a[i];
    int ans=0;
    for(int i=0;i<n;i++)
    {
        for(int j=i;j<n;j++)
        {
            ans^=(a[i]+a[j]);
        }
    }
    cout<<ans<<endl;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 204 KB Output is correct
2 Correct 2 ms 204 KB Output is correct

Subtask #2
0 / 11.0

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

Subtask #3
0 / 21.0

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

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 204 KB Output is correct
2 Correct 2 ms 204 KB Output is correct
3 Correct 604 ms 1360 KB Output is correct
4 Correct 536 ms 1648 KB Output is correct

Subtask #5
0 / 23.0

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