Submission #1262650

#TimeUsernameProblemLanguageResultExecution timeMemory
1262650iordache_Xor Sort (eJOI20_xorsort)C++20
25 / 100
71 ms18568 KiB
#include <bits/stdc++.h>
#define pb push_back
#define int long long
using namespace std;
const int N=1e3+5,LOG=20;
int v[N];
signed main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n,cer;
    cin>>n>>cer;
    for(int i=1;i<=n;++i) cin>>v[i];
    vector<pair<int,int>> sol;
    while(1)
    {
        int before=sol.size();
        for(int i=1;i+1<=n;++i)
        {
            if(v[i]>v[i+1])
            {
                sol.pb({i,i+1});sol.pb({i+1,i});sol.pb({i,i+1});
                swap(v[i],v[i+1]);
            }
        }
        if(sol.size()==before) break;
    }
    //for(int i=1;i<=n;++i) cout<<v[i]<<" ";
    //cout<<'\n';
    cout<<sol.size()<<'\n';
    for(auto x:sol) cout<<x.first<<" "<<x.second<<'\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...