oj.uz

Submission #369815

# Submission time Handle Problem Language Result Execution time Memory
369815 2021-02-22T13:37:21 Z AdamGS Xor Sort (eJOI20_xorsort) C++14
0 / 100
 1 ms 364 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(ll a = 0; a < (b); ++a)
#define lg(a) (!a?0:64-__builtin_clzll(a))
#define st first
#define nd second
#define pb push_back
const ll LIM=1e3+7;
ll T[LIM];
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    ll n, l=1;
    cin >> n;
    rep(i, n) cin >> T[i];
    vector<pair<ll,ll>>ans;
    for(int i=20; i; --i) {
        int p=0;
        rep(j, n-l) {
            if(lg(T[j])==i) {
                p=1;
                if(lg(T[j])!=lg(T[j+1])) {
                    ans.pb({j+1, j});
                    T[j+1]^=T[j];
                }
                ans.pb({j, j+1});
                T[j]^=T[j+1];
            }
        }
        l+=p;
    }
    cout << ans.size() << '\n';
    for(auto i : ans) cout << i.st+1 << " " << i.nd+1 << '\n';
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Not sorted
2 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Not sorted
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Not sorted
2 Halted 0 ms 0 KB -