제출 #646399

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
646399		murad_2005	XOR Sum (info1cup17_xorsum)	C++17	45 / 100	1693 ms	1604 KiB

xorsum

    #pragma GCC optimize("Ofast")
    #pragma GCC target("avx,avx2")
    #pragma GCC optimize("unroll-loops")
    #include<bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using pl = pair<ll,ll>;
    using tl = tuple<ll,ll,ll>;
    using ld = long double;
    #define all(x) (x).begin(),(x).end()
    #define sz(x) ll((x).size())
    #define pb emplace_back
    #define F first
    #define S second
    const ll inf = (1ll<<60);
    const ll N = 1e6 + 100;
    const ll K = 3;
    const ld PI = 3.141592653589793238462643383279;
    //mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
    int a[N];
    void solve(){
        int n;
        cin >> n;
        int ans = 0;
        for(ll i = 1;i<=n;i++){
            cin >> a[i];
            for(ll j = 1;j<=i;j++){
                ans^=(a[i]+a[j]);
            }
        }
        cout << ans;
    }
     
     
    int main(){
        ios::sync_with_stdio(0);
        cin.tie(0);
        ll t = 1;
        //cin >> t;
        //cout << fixed << setprecision(20);
        while(t--){
            solve();
        }
    }

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