oj.uz

답안 #467154

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
467154 2021-08-21T19:39:43 Z TlenekWodoru Xor Sort (eJOI20_xorsort) C++14
60 / 100
 1000 ms 12636 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*3;i++)  
    {
        int a=(rand()%n)+1;
        int b=rand()%2;
        if(a==1||(b%2==1&&a!=n))
        {
            if(tab[a]>tab[a+1])
            {
                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(tab[a]>tab[a-1])
            {
                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:94: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]
   94 |     for(int i=0;i<odp.size();i++)
      |                 ~^~~~~~~~~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 4 ms 588 KB Output is correct
4 Correct 28 ms 1344 KB Output is correct
5 Correct 29 ms 1364 KB Output is correct
6 Correct 27 ms 1356 KB Output is correct
7 Correct 31 ms 1356 KB Output is correct
8 Correct 27 ms 1356 KB Output is correct
9 Correct 31 ms 1376 KB Output is correct
10 Correct 30 ms 1420 KB Output is correct
11 Correct 21 ms 1100 KB Output is correct
12 Correct 45 ms 1240 KB Output is correct
13 Correct 37 ms 1276 KB Output is correct
14 Correct 40 ms 1308 KB Output is correct
15 Correct 47 ms 1288 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 4 ms 588 KB Output is correct
4 Correct 28 ms 1344 KB Output is correct
5 Correct 29 ms 1364 KB Output is correct
6 Correct 27 ms 1356 KB Output is correct
7 Correct 31 ms 1356 KB Output is correct
8 Correct 27 ms 1356 KB Output is correct
9 Correct 31 ms 1376 KB Output is correct
10 Correct 30 ms 1420 KB Output is correct
11 Correct 21 ms 1100 KB Output is correct
12 Correct 45 ms 1240 KB Output is correct
13 Correct 37 ms 1276 KB Output is correct
14 Correct 40 ms 1308 KB Output is correct
15 Correct 47 ms 1288 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 30 ms 1424 KB Output is correct
18 Correct 52 ms 1596 KB Output is correct
19 Correct 50 ms 1600 KB Output is correct
20 Correct 51 ms 1652 KB Output is correct
21 Correct 52 ms 1664 KB Output is correct
22 Correct 51 ms 1660 KB Output is correct
23 Correct 49 ms 1584 KB Output is correct
24 Correct 50 ms 1660 KB Output is correct
25 Correct 47 ms 1644 KB Output is correct
26 Correct 62 ms 1616 KB Output is correct
27 Correct 62 ms 1656 KB Output is correct
28 Correct 64 ms 1640 KB Output is correct
29 Correct 62 ms 1624 KB Output is correct
30 Correct 60 ms 1616 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 4 ms 588 KB Output is correct
4 Correct 49 ms 1624 KB Output is correct
5 Execution timed out 1084 ms 12636 KB Time limit exceeded
6 Halted 0 ms 0 KB -