oj.uz

답안 #1090081

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1090081 2024-09-17T17:19:30 Z idk__ Xor Sort (eJOI20_xorsort) C++14
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
int a[1001], n, s;
vector<pair<int, int>>op;
void s1(){
    int b[n]={};
    for(int i = 0;i < n; i++)b[i] = a[i];
    for(int i = 0;i < n-1; i++)op.push_back({i, i+1});

    for(int i = n-1; i>=0; i--){
        int mxi = 0;
        for(int j = 0;j <= i; j++)if(b[j] > b[mxi])mxi = j;
        for(int j = mxi; j < i; j++)op.push_back({j+1, j});
        for(int j = mxi; j >=1; j--)op.push_back({j, j-1});
    }

}

void s2(){
    for(int i = 19; i>=0; i--){

        for(int j = 0;j < n-1; j++){
            
            int bt = (1 << i);

            if(a[j+1] >= (1<<(i+1)))break;
            //1, 0, C=1
            //0, 1
            //1, 1, c = 2
            //0, 0
            if((bt&a[j]) and !(bt&a[j+1]))op.push_back({j+1, j}), a[j+1]^=a[j];
            if((bt&a[j]) and (bt&a[j+1]))op.push_back({j, j+1}), a[j]^=a[j+1];
            

        }
       for(int j = 0;j < n; j++)cout << a[j] << " ";
        cout <<endl;
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> s;
    for(int i = 0;i < n; i++)cin >> a[i];

    if(s==1)s1();
    else s2();

 //   cout << op.size() << endl;
   // for(auto [i, j] : op)cout << i+1 << " " << j+1 << endl;
    
   for(int i = 0;i < n; i++)cout << a[i] << " ";

    
    
    }

Subtask #1
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Integer 195718 violates the range [0, 40000]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Integer 195718 violates the range [0, 40000]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Integer 321675 violates the range [1, 5]
2 Halted 0 ms 0 KB -