oj.uz

답안 #1023410

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1023410 2024-07-14T18:00:38 Z NintsiChkhaidze XOR Sum (info1cup17_xorsum) C++17
45 / 100
 1600 ms 26476 KB 
#include <bits/stdc++.h>
#include <ostream>
#define pb push_back
#define s second
#define f first
#define pb push_back
#define pii pair <int,int>
#define ll long long
#define left h*2,l,(l + r)/2
#define right h*2+1,(l + r)/2 + 1,r
#define int ll
using namespace std;
 
const int N = 1e6 + 5,inf = 1e9;
int a[N];
pii arr[N],b[N];
bool fix[N];

signed main() {
  ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
  
  int n;
  cin>>n;

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

  for (int j = 1; j <= n; j++)
      arr[j] = {(a[j] & ((1<<(0 + 1)) - 1)),j};
  sort(arr+1,arr+n+1);

  int ans=0,add=0;
  for (int i = 0; i <= 30; i++){
    for (int j = 1; j <= n; j++)
      arr[j] = {(a[j] & ((1<<(i + 1)) - 1)),j};
 
    sort(arr+1,arr+n+1);
    int cnt = 0;
    int r0 = 0,r1 = 0,r2 = 0;

    for (int j = n; j >= 1; j--){
        while (r0 + 1 <= n && (((arr[j].f + arr[r0 + 1].f) >> i) & 3) <= 0) r0++;
        while (r1 + 1 <= n && (((arr[j].f + arr[r1 + 1].f) >> i) & 3) <= 1) r1++;
        while (r2 + 1 <= n && (((arr[j].f + arr[r2 + 1].f) >> i) & 3) <= 2) r2++;

        int l = max(j,r0 + 1),r = r1;
        cnt += max(0LL,r - l + 1);

        l = max(j,r2 + 1),r = n;
        cnt += max(0LL,r - l + 1);
    }

    if (cnt & 1) ans |= (1LL<<i);
  }

  cout<<ans;
}

Compilation message

xorsum.cpp: In function 'int main()':
xorsum.cpp:33:13: warning: unused variable 'add' [-Wunused-variable]
   33 |   int ans=0,add=0;
      |             ^~~

Subtask #1
7.0 / 7.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 21.0

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

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 4440 KB Output is correct
2 Correct 9 ms 2396 KB Output is correct
3 Correct 288 ms 4700 KB Output is correct
4 Correct 257 ms 4700 KB Output is correct

Subtask #5
0 / 23.0

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