oj.uz

Submission #467110

# Submission time Handle Problem Language Result Execution time Memory
467110 2021-08-21T17:53:40 Z TlenekWodoru Xor Sort (eJOI20_xorsort) C++14
25 / 100
 1000 ms 12484 KB 
#include <bits/stdc++.h>
using namespace std;
int tab[1009];
bool zaj[2000000];
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];
        zaj[tab[i]]=1;
    }
    for(int i=1;i<=5000;i++)
    {
        int a=(rand()%n)+1;
        int b=rand()%2;
        if(a==1||(b%2==1&&a!=n))
        {
            if(s==2||zaj[xorr(tab[a],tab[a+1])]==0)
            {
                odp.push_back({a,a+1});
                zaj[tab[a]]=0;
                swap_true(a,a+1);
                zaj[tab[a]]=1;
            }
        }
        else
        {
            if(s==2||zaj[xorr(tab[a],tab[a-1])]==0)
            {
                odp.push_back({a,a-1});
                zaj[tab[a]]=0;
                swap_true(a,a-1);
                zaj[tab[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:88: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]
   88 |     for(int i=0;i<odp.size();i++)
      |                 ~^~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 460 KB Output is correct
2 Correct 10 ms 1452 KB Output is correct
3 Correct 13 ms 1496 KB Output is correct
4 Correct 38 ms 1676 KB Output is correct
5 Correct 40 ms 1740 KB Output is correct
6 Correct 38 ms 1816 KB Output is correct
7 Correct 39 ms 1720 KB Output is correct
8 Correct 37 ms 1744 KB Output is correct
9 Correct 39 ms 1772 KB Output is correct
10 Correct 36 ms 1740 KB Output is correct
11 Correct 28 ms 1628 KB Output is correct
12 Correct 50 ms 1872 KB Output is correct
13 Correct 48 ms 1828 KB Output is correct
14 Correct 46 ms 1824 KB Output is correct
15 Correct 46 ms 1872 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 460 KB Output is correct
2 Correct 10 ms 1452 KB Output is correct
3 Correct 13 ms 1496 KB Output is correct
4 Correct 38 ms 1676 KB Output is correct
5 Correct 40 ms 1740 KB Output is correct
6 Correct 38 ms 1816 KB Output is correct
7 Correct 39 ms 1720 KB Output is correct
8 Correct 37 ms 1744 KB Output is correct
9 Correct 39 ms 1772 KB Output is correct
10 Correct 36 ms 1740 KB Output is correct
11 Correct 28 ms 1628 KB Output is correct
12 Correct 50 ms 1872 KB Output is correct
13 Correct 48 ms 1828 KB Output is correct
14 Correct 46 ms 1824 KB Output is correct
15 Correct 46 ms 1872 KB Output is correct
16 Correct 10 ms 1356 KB Output is correct
17 Correct 37 ms 1752 KB Output is correct
18 Correct 59 ms 2000 KB Output is correct
19 Correct 61 ms 2000 KB Output is correct
20 Correct 61 ms 2008 KB Output is correct
21 Correct 58 ms 2000 KB Output is correct
22 Correct 57 ms 2000 KB Output is correct
23 Correct 57 ms 2000 KB Output is correct
24 Correct 59 ms 2000 KB Output is correct
25 Correct 62 ms 2000 KB Output is correct
26 Incorrect 72 ms 1988 KB Integer 42462 violates the range [0, 40000]
27 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 564 KB Output is correct
2 Correct 10 ms 1356 KB Output is correct
3 Correct 13 ms 1484 KB Output is correct
4 Correct 61 ms 2000 KB Output is correct
5 Execution timed out 1100 ms 12484 KB Time limit exceeded
6 Halted 0 ms 0 KB -