# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
775798 | vjudge1 | Xor Sort (eJOI20_xorsort) | C++17 | 5 ms | 1040 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
vector<pair<int, int>> tt;
int a[1001], re[1001];
void op(int i, int j)
{
tt.push_back(make_pair(i, j));
a[i] ^= a[j];
}
bool getbit(int num, int bit)
{
return (num >> bit)&1;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, s;
cin>>n>>s;
for(int i = 1; i <= n; i++) cin>>a[i];
if(s == 2){
int last = n;
for(int bit = 19; bit >= 0; bit--){
int c = 0;
for(int i = 1; i <= last; i++) if(getbit(a[i], bit) == 1) c = i;
if(c == 0) continue;
for(int i = c-1; i >= 1; i--) if(getbit(a[i], bit) == 0) op(i, i+1);
for(int i = c+1; i <= last; i++) if(getbit(a[i], bit) == 0) op(i, i-1);
for(int i = 2; i <= last; i++) op(i-1, i);
last--;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |