oj.uz

Submission #497012

# Submission time Handle Problem Language Result Execution time Memory
497012 2021-12-22T08:23:37 Z kingline XOR Sum (info1cup17_xorsum) C++17
18 / 100
 1600 ms 51196 KB 
/*#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")*/
#include <bits/stdc++.h>
#pragma GCC optimize ("unroll-loops,Ofast,O3")
#pragma GCC target("avx,avx2,fma")
//#define file(data) freopen(data".in", "r", stdin); freopen(data".out", "w", stdout);
#define pb push_back
//#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(data) data.begin() , data.end()
#define endl '\n'
//freopen("nenokku_easy.in", "r", stdin);
//freopen("nenokku_easy.out", "w", stdout);
//#define int long long
#define pii pair < int, int >
#define pll pair < long long, long long >

using namespace std;

typedef long long ll;
const int N = 1e6 + 5;
const int M = 350;
const int mod = 1e9 + 7;

int n, v[N];

main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //file("pieaters");
    cin >> n;
    int mx = 0;
    unordered_set < int > st;
    unordered_map < int, int > use;
    for(int i = 1; i <= n; i++) {
        cin >> v[i];
        st.insert(v[i]);
        use[v[i]]++;
        mx = max(mx, v[i]);
    }
    int ans = 0;
    for(unordered_set < int >::iterator it = st.begin(); it != st.end();  it++) {
        int cnt = use[*it] * (use[*it] + 1) / 2;
        if(cnt % 2) ans ^= (*it) * 2;
        unordered_set < int >::iterator itt = it;
        ++itt;
        while(itt != st.end()) {
            cnt = use[*itt] * use[*it];
            if(cnt % 2) ans ^= (*itt) + (*it);
            ++itt;
        }
    }
    cout << ans;
}

/*
5 9 7
...##....
..#.##..#
..#....##
.##...#..
....#....
WS?EE??
*/

Compilation message

xorsum.cpp:29:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   29 | main() {
      | ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 576 KB Output is correct
2 Correct 194 ms 700 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 7364 KB Output is correct
2 Correct 189 ms 5696 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 7364 KB Output is correct
2 Correct 189 ms 5696 KB Output is correct
3 Execution timed out 1617 ms 51196 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 576 KB Output is correct
2 Correct 194 ms 700 KB Output is correct
3 Execution timed out 1686 ms 10496 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 576 KB Output is correct
2 Correct 194 ms 700 KB Output is correct
3 Correct 200 ms 7364 KB Output is correct
4 Correct 189 ms 5696 KB Output is correct
5 Execution timed out 1617 ms 51196 KB Time limit exceeded
6 Halted 0 ms 0 KB -