oj.uz

답안 #496737

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
496737 2021-12-22T03:42:59 Z ergagan XOR Sum (info1cup17_xorsum) C++17
18 / 100
 101 ms 8232 KB 
//я так много думал, что опять попал
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define f first
#define s second
#define left(v) v + v
#define right(v) v + v + 1
#define ub upper_bound
#define lb lower_bound

using namespace std;
typedef long long ll;

//17 SEVENTEEN
const long double Pi = acos(-1.0);
const ll dx[] = {0,0,1,-1};
const ll dy[] = {1,-1,0,0};
const ll N = (ll) 1e6 + 17;
const ll M = (ll) 5e3 + 69;
const ll inf = (ll) 1e14 + 3;
const ll mod = (ll) 1e9 + 7;
ll sq(ll x) { return x * x; }

ll zxc = 1, a[N], cnt[N];

void solve() {
    ll n, xr = 0;
    cin >> n;
    for(ll i = 1; i <= n; i++) {
        cin >> a[i];
        if(a[i] <= M) cnt[a[i]]++;
    }
    if(n <= M) {
        for(ll i = 1; i <= n; i++) {
            for(ll j = i; j <= n; j++) {
                xr ^= (a[i] + a[j]);
            }
        }
        cout << xr;
        return;
    }
    for(ll i = 1; i <= M; i++) {
        for(ll j = i; j <= M; j++) {
            if(cnt[i] && cnt[j]) {
                if(i == j && (cnt[i] * (cnt[i] + 1) / 2) % 2) xr ^= (i + j);
                if(cnt[i] * cnt[j] % 2 && i != j) xr ^= (i + j);
            }
        }
    }
    cout << xr;
}

int main(/*Уверенно*/) {
ios_base::sync_with_stdio(0);
    cin.tie(0);
/*
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
*/
//    cin >> zxc;
    while(zxc--) {
        solve();
    }
  	return 0;
}
// さよならさ いかなくちゃ

Subtask #1
7.0 / 7.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 8072 KB Output is correct
2 Correct 85 ms 7632 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 8072 KB Output is correct
2 Correct 85 ms 7632 KB Output is correct
3 Incorrect 101 ms 8232 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 332 KB Output is correct
2 Correct 6 ms 332 KB Output is correct
3 Incorrect 19 ms 1144 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 332 KB Output is correct
2 Correct 6 ms 332 KB Output is correct
3 Correct 75 ms 8072 KB Output is correct
4 Correct 85 ms 7632 KB Output is correct
5 Incorrect 101 ms 8232 KB Output isn't correct
6 Halted 0 ms 0 KB -