oj.uz

Submission #720136

# Submission time Handle Problem Language Result Execution time Memory
720136 2023-04-07T13:39:19 Z fuad27 Xor Sort (eJOI20_xorsort) C++17
0 / 100
 1 ms 296 KB 
#include<bits/stdc++.h>
using namespace std;
int main () {
  int n, s;
  cin >> n >> s;
  int a[n];
  for(int i = 0;i<n;i++)cin >> a[i];
  if(s==2) {
    vector<pair<int,int>> op;
    for(int i = 19;i>=0;i--) {
      for(int j = 1;j<n;j++) {
        if((a[j]&(1<<i))==0 and (a[j-1]&(1<<i))!=0) {
          a[j]^=a[j-1];
          op.push_back({j,j-1});
        }
        if((a[j-1]&(1<<i))!=0) {
          if((a[j-1]^a[j])<a[j-1]) {
            a[j-1]^=a[j];
            op.push_back({j-1,j});
          }
        }
      }
    }
    cout << op.size() << "\n";
    for(auto i:op) {
      cout << i.first << " " << i.second << "\n";
    }
  }
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 296 KB Integer 0 violates the range [1, 5]
2 Halted 0 ms 0 KB -