# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1087862 | idk__ | Xor Sort (eJOI20_xorsort) | C++14 | 0 ms | 348 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;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, t;
cin >> n >> t;
int a[n];
for(int i = 0;i < n; i++){
cin >> a[i];
}
//3 2 8 4 1
//1 2 8 12 13
if(t==1){
vector<pair<int, int>>op;
for(int i = 0;i < n-1; i++){
if(a[i+1] <= a[i]){
int nw = (a[i+1]^a[i]);
if(a[i+1] > nw){
a[i] = nw;
op.push_back({i, i+1});
}
else if(a[i] < nw){
a[i+1]=nw;
op.push_back({i+1, i});
}
}
}
cout << op.size() << endl;
for(auto [i, j] : op)cout << i+1 << " " << j+1 << endl;
}
else{
vector<pair<int, int>>op;
for(int i = 0;i < n-1; i++){
if(a[i+1] < a[i]){
int nw = (a[i+1]^a[i]);
if(a[i+1] >= nw){
a[i] = nw;
op.push_back({i, i+1});
}
else if(a[i] <= nw){
a[i+1]=nw;
op.push_back({i+1, i});
}
}
}
cout << op.size() << endl;
for(auto [i, j] : op)cout << i+1 << " " << j+1 << endl;
}
}
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... |