제출 #497019

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
497019		kingline	XOR Sum (info1cup17_xorsum)	C++17	18 / 100	1690 ms	49456 KiB

xorsum

/*#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;
    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]]++;
    }
    int ans = 0;
    for(unordered_set < int >::iterator it = st.begin(); it != st.end();  it++) {
        int cnt = use[*it]; int cnt2 = (use[*it] + 1);
        if(cnt % 2) {
            if((cnt2 >> 1) % 2 == 1) ans ^= (*it) * 2;
        } else {
            if((cnt >> 1) % 2 == 1) ans ^= (*it) * 2;
        }
        unordered_set < int >::iterator itt = it;
        ++itt;
        while(itt != st.end()) {
            if(use[*it] % 2 == 1 && use[*itt] % 2 == 1) ans ^= (*itt) + (*it);
            ++itt;
        }
    }
    cout << ans;
}

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

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 0 / 21
• Subtask 4: 0 / 38
• Subtask 5: 0 / 23