Submission #440857

#	Time	Username	Problem	Language	Result	Execution time	Memory
440857		MrDeboo	Xor Sort (eJOI20_xorsort)	C++17	0 / 100	640 ms	524292 KiB

xorsort

#include <bits/stdc++.h>
#define int long long
#define mod 1000000007
#define endl '\n'
using namespace std;
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n,s;
    cin>>n>>s;
    int arr[n];
    for(int i=0;i<n;i++){
        cin>>arr[i];
    }
    vector<pair<int,int>>vct;
    bool bl;
    do{
        bl=false;
        for(int i=0;i<n;i++){
            if(i>0&&((arr[i]<arr[i-1]&&(arr[i]^arr[i-1])>arr[i-1])||(i<n-1&&arr[i]>arr[i+1]&&(arr[i]^arr[i-1])<arr[i+1]))){vct.push_back({i+1,i});bl=true;arr[i]^=arr[i-1];}
            if(i<n-1&&((i>0&&arr[i]<arr[i-1]&&(arr[i]^arr[i+1])>arr[i-1])||(arr[i]>arr[i+1]&&(arr[i]^arr[i+1])<arr[i+1]))){vct.push_back({i+1,i});bl=true;arr[i]^=arr[i+1];}
        }
    }while(bl);
    cout<<vct.size()<<endl;
    for(auto i:vct)cout<<i.first<<' '<<i.second<<endl;
}
//5 1 1 1 6 5
//5 5 6 5 6

• Subtask 1: 0 / 25
• Subtask 2: 0 / 35
• Subtask 3: 0 / 40