oj.uz

답안 #889394

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
889394 2023-12-19T15:48:23 Z boris_mihov XOR Sum (info1cup17_xorsum) C++17
7 / 100
 1600 ms 5324 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 1000000 + 10;
const int MAXLOG = 30;

int n;
int cnt[2];
int a[MAXN];
int b[MAXN];
int c[MAXN];
int perm[MAXN];
int perm2[MAXN];
int answer;

void solve()
{
    for (int i = 1 ; i <= n ; ++i)
    {
        for (int j = i ; j <= n ; ++j)
        {
            answer ^= a[i] + a[j];
        }
    }

    std::cout << answer << '\n';
}

void input()
{
    std::cin >> n;
    for (int i = 1 ; i <= n ; ++i)
    {
        std::cin >> a[i];
    }
}

void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}  

int main()
{
    fastIOI();
    input();
    solve();

    return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2396 KB Output is correct
2 Correct 4 ms 2552 KB Output is correct

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1664 ms 5324 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1664 ms 5324 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2396 KB Output is correct
2 Correct 4 ms 2552 KB Output is correct
3 Execution timed out 1687 ms 3416 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2396 KB Output is correct
2 Correct 4 ms 2552 KB Output is correct
3 Execution timed out 1664 ms 5324 KB Time limit exceeded
4 Halted 0 ms 0 KB -