oj.uz

Submission #467113

# Submission time Handle Problem Language Result Execution time Memory
467113 2021-08-21T17:57:07 Z TlenekWodoru Xor Sort (eJOI20_xorsort) C++14
25 / 100
 1000 ms 12380 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<=n*2;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 1 ms 480 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 4 ms 724 KB Output is correct
4 Correct 30 ms 1356 KB Output is correct
5 Correct 29 ms 1380 KB Output is correct
6 Correct 36 ms 1484 KB Output is correct
7 Correct 37 ms 1432 KB Output is correct
8 Correct 28 ms 1368 KB Output is correct
9 Correct 32 ms 1484 KB Output is correct
10 Correct 28 ms 1388 KB Output is correct
11 Correct 20 ms 1144 KB Output is correct
12 Correct 50 ms 1396 KB Output is correct
13 Correct 39 ms 1276 KB Output is correct
14 Correct 39 ms 1376 KB Output is correct
15 Correct 38 ms 1296 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 480 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 4 ms 724 KB Output is correct
4 Correct 30 ms 1356 KB Output is correct
5 Correct 29 ms 1380 KB Output is correct
6 Correct 36 ms 1484 KB Output is correct
7 Correct 37 ms 1432 KB Output is correct
8 Correct 28 ms 1368 KB Output is correct
9 Correct 32 ms 1484 KB Output is correct
10 Correct 28 ms 1388 KB Output is correct
11 Correct 20 ms 1144 KB Output is correct
12 Correct 50 ms 1396 KB Output is correct
13 Correct 39 ms 1276 KB Output is correct
14 Correct 39 ms 1376 KB Output is correct
15 Correct 38 ms 1296 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 54 ms 1484 KB Output is correct
18 Correct 50 ms 1664 KB Output is correct
19 Correct 52 ms 1672 KB Output is correct
20 Correct 51 ms 1672 KB Output is correct
21 Correct 48 ms 1596 KB Output is correct
22 Correct 52 ms 1736 KB Output is correct
23 Correct 53 ms 1616 KB Output is correct
24 Correct 63 ms 1716 KB Output is correct
25 Correct 46 ms 1568 KB Output is correct
26 Incorrect 77 ms 1744 KB Integer 44089 violates the range [0, 40000]
27 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

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