oj.uz

답안 #467079

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
467079 2021-08-21T16:43:51 Z TlenekWodoru Xor Sort (eJOI20_xorsort) C++14
25 / 100
 1000 ms 11748 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);
    int n,s;cin>>n>>s;
    for(int i=1;i<=n;i++)
    {
        cin>>tab[i];
    }
    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:60: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]
   60 |     for(int i=0;i<odp.size();i++)
      |                 ~^~~~~~~~~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 25 ms 640 KB Output is correct
5 Correct 30 ms 592 KB Output is correct
6 Correct 28 ms 652 KB Output is correct
7 Correct 27 ms 632 KB Output is correct
8 Correct 28 ms 672 KB Output is correct
9 Correct 31 ms 680 KB Output is correct
10 Correct 30 ms 644 KB Output is correct
11 Correct 0 ms 312 KB Output is correct
12 Correct 55 ms 976 KB Output is correct
13 Correct 55 ms 976 KB Output is correct
14 Correct 56 ms 976 KB Output is correct
15 Correct 57 ms 976 KB Output is correct

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 25 ms 640 KB Output is correct
5 Correct 30 ms 592 KB Output is correct
6 Correct 28 ms 652 KB Output is correct
7 Correct 27 ms 632 KB Output is correct
8 Correct 28 ms 672 KB Output is correct
9 Correct 31 ms 680 KB Output is correct
10 Correct 30 ms 644 KB Output is correct
11 Correct 0 ms 312 KB Output is correct
12 Correct 55 ms 976 KB Output is correct
13 Correct 55 ms 976 KB Output is correct
14 Correct 56 ms 976 KB Output is correct
15 Correct 57 ms 976 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 29 ms 640 KB Output is correct
18 Correct 49 ms 884 KB Output is correct
19 Correct 50 ms 840 KB Output is correct
20 Correct 48 ms 836 KB Output is correct
21 Correct 49 ms 816 KB Output is correct
22 Correct 53 ms 932 KB Output is correct
23 Correct 51 ms 884 KB Output is correct
24 Correct 49 ms 860 KB Output is correct
25 Correct 48 ms 868 KB Output is correct
26 Incorrect 101 ms 1244 KB Integer 59568 violates the range [0, 40000]
27 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 58 ms 788 KB Output is correct
5 Execution timed out 1090 ms 11748 KB Time limit exceeded
6 Halted 0 ms 0 KB -