Submission #843656

# Submission time Handle Problem Language Result Execution time Memory
843656 2023-09-04T11:05:41 Z Andrijanikolic73 Xor Sort (eJOI20_xorsort) C++17
0 / 100
0 ms 348 KB
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1001;
int n;
int s;
vector<pair<int,int>>v;
int a[N];
void zameni(int i,int j){
    v.push_back({i,j});
    v.push_back({j,i});
    v.push_back({i,j});
    for(auto it:v)a[it.first]^=a[it.second];
    v.clear();
}
void Swap(int i,int j){
    while(j>i){
        zameni(j-1,j);
        j--;
    }
}
signed main(){
    cin>>n>>s;
    for(int i=1;i<=n;i++)cin>>a[i];
    // kako da zamenim dva suseda ???
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            if(a[i]>a[j]){
                Swap(i,j);
            }
        }
    }
    for(int i=1;i<=n;i++)cout<<a[i]<<" ";
}
/*
5 1
3 2 8 4 1
*/
/*
max 40000 operacija
s=1 a[i]<a[i+1]
s=2 a[i]<=a[i+1]
*/
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Integer 176425 violates the range [1, 5]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Integer 176425 violates the range [1, 5]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Integer 321675 violates the range [1, 5]
2 Halted 0 ms 0 KB -