oj.uz

Submission #467103

# Submission time Handle Problem Language Result Execution time Memory
467103 2021-08-21T17:33:11 Z TlenekWodoru Xor Sort (eJOI20_xorsort) C++14
25 / 100
 1000 ms 11624 KB 
#include <bits/stdc++.h>
using namespace std;
int tab[1009];
vector<pair<int,int>>odp;
int xorr(int a, int b)
{
    int u=1;
    int wynik=0;
    while(a>0||b>0)
    {
        if(a%2!=b%2)
        {
            wynik+=u;
        }
        a=a/2;
        b=b/2;
        u=u*2;
    }
    return wynik;
}
void swap_true(int a, int b)
{
    tab[a]=xorr(tab[a],tab[b]);
}
void swapp(int a, int b)
{
    /**swap_true(a,b);
    swap_true(b,a);
    swap_true(a,b);**/
    odp.push_back({a,b});
    odp.push_back({b,a});
    odp.push_back({a,b});
    swap(tab[a],tab[b]);
}
int main()
{ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    srand(time(0));
    int n,s;cin>>n>>s;
    for(int i=1;i<=n;i++)
    {
        cin>>tab[i];
    }
    for(int i=1;i<=1500;i++)
    {
        int a=(rand()%n)+1;
        int b=rand()%2;
        if(a==1||(b%2==1&&a!=n))
        {
            odp.push_back({a,a+1});
            swap_true(a,a+1);
        }
        else
        {
            odp.push_back({a,a-1});
            swap_true(a,a-1);
        }
    }
    for(int i=1;i<=n;i++)
    {
        int minn=2000000000;
        int ind=-1;
        for(int j=i;j<=n;j++)
        {
            if(tab[j]<minn)
            {
                minn=tab[j];
                ind=j;
            }
        }
        for(int j=ind;j-1>=i;j--)
        {
            swapp(j,j-1);
        }
    }
    cout<<odp.size()<<endl;
    for(int i=0;i<odp.size();i++)
    {
        cout<<odp[i].first<<" "<<odp[i].second<<endl;
    }
    /**for(int i=1;i<=n;i++)
    {
        cout<<tab[i]<<endl;
    }**/
    return 0;
}

Compilation message

xorsort.cpp: In function 'int main()':
xorsort.cpp:76:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |     for(int i=0;i<odp.size();i++)
      |                 ~^~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 6 ms 332 KB Output is correct
4 Correct 32 ms 620 KB Output is correct
5 Correct 31 ms 664 KB Output is correct
6 Correct 29 ms 592 KB Output is correct
7 Correct 33 ms 716 KB Output is correct
8 Correct 27 ms 644 KB Output is correct
9 Correct 31 ms 720 KB Output is correct
10 Correct 32 ms 684 KB Output is correct
11 Correct 24 ms 608 KB Output is correct
12 Correct 44 ms 788 KB Output is correct
13 Correct 42 ms 736 KB Output is correct
14 Correct 39 ms 784 KB Output is correct
15 Correct 47 ms 680 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 6 ms 332 KB Output is correct
4 Correct 32 ms 620 KB Output is correct
5 Correct 31 ms 664 KB Output is correct
6 Correct 29 ms 592 KB Output is correct
7 Correct 33 ms 716 KB Output is correct
8 Correct 27 ms 644 KB Output is correct
9 Correct 31 ms 720 KB Output is correct
10 Correct 32 ms 684 KB Output is correct
11 Correct 24 ms 608 KB Output is correct
12 Correct 44 ms 788 KB Output is correct
13 Correct 42 ms 736 KB Output is correct
14 Correct 39 ms 784 KB Output is correct
15 Correct 47 ms 680 KB Output is correct
16 Correct 3 ms 316 KB Output is correct
17 Correct 30 ms 720 KB Output is correct
18 Correct 54 ms 872 KB Output is correct
19 Correct 56 ms 888 KB Output is correct
20 Correct 55 ms 888 KB Output is correct
21 Correct 52 ms 808 KB Output is correct
22 Correct 50 ms 888 KB Output is correct
23 Correct 54 ms 904 KB Output is correct
24 Correct 53 ms 900 KB Output is correct
25 Correct 56 ms 976 KB Output is correct
26 Incorrect 69 ms 1012 KB Integer 41079 violates the range [0, 40000]
27 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 6 ms 332 KB Output is correct
4 Correct 52 ms 848 KB Output is correct
5 Execution timed out 1089 ms 11624 KB Time limit exceeded
6 Halted 0 ms 0 KB -