oj.uz

답안 #774790

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
774790 2023-07-06T03:27:52 Z huutuan Xor Sort (eJOI20_xorsort) C++14
0 / 100
 368 ms 524288 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)x.size())
#define sumof(x) accumulate(all(x), 0ll)

const int N=1001;
int n, s, a[N];

void solve(int tc){
    // cout << "Case #" << tc << ": ";
    vector<pair<int, int>> v;
    cin >> n >> s;
    for (int i=1; i<=n; ++i) cin >> a[i];
    if (n<=200){
        while (1){
            bool stop=true;
            for (int i=1; i<n; ++i) if (a[i]>=a[i+1]){
                if ((a[i]^a[i+1])<a[i+1]){
                    a[i]^=a[i+1];
                    v.emplace_back(i, i+1);
                }else if (a[i]<(a[i]^a[i+1])){
                    a[i+1]^=a[i];
                    v.emplace_back(i+1, i);
                }else{
                    v.emplace_back(i+1, i);
                    a[i+1]^=a[i];
                    v.emplace_back(i, i+1);
                    a[i]^=a[i+1];
                }
                // swap(a[i], a[i+1]);
                stop=false;
                // v.emplace_back(i, i+1);
                // v.emplace_back(i+1, i);
                // v.emplace_back(i, i+1);
            }
            if (stop) break;
        }
        cout << sz(v) << '\n';
        for (auto& i:v) cout << i.first << ' ' << i.second << '\n';
        return;
    }
    for (int i=19; i>=0; --i){
        vector<int> idx;
        for (int j=1; j<=n; ++j) if (a[j]>>i&1) idx.push_back(j);
        if (idx.empty()) continue;
        for (int j=1; j<sz(idx); ++j){
            int i1=idx[j-1], i2=idx[j];
            for (int k=i1; k<i2-1; ++k){
                v.emplace_back(k+1, k);
                a[k+1]^=a[k];
                v.emplace_back(k, k+1);
                a[k]^=a[k+1];
            }
            v.emplace_back(i2-1, i2);
            a[i2-1]^=a[i2];
        }
        if (idx.back()!=n){
            for (int j=idx.back(); j<n; ++j){
                v.emplace_back(j+1, j);
                a[j+1]^=a[j];
                v.emplace_back(j, j+1);
                a[j]^=a[j+1];
            }
        }
        --n;
    }
    cout << sz(v) << '\n';
    for (auto& i:v) cout << i.first << ' ' << i.second << '\n';
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int ntests=1;
    // cin >> ntests;
    for (int i=1; i<=ntests; ++i) solve(i);
    return 0;
}

Subtask #1
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 349 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 349 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 368 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -