oj.uz

Submission #725309

# Submission time Handle Problem Language Result Execution time Memory
725309 2023-04-17T08:24:24 Z NemanjaSo2005 Xor Sort (eJOI20_xorsort) C++14
100 / 100
 65 ms 1028 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll N,S,niz[1005],pniz[205],niz2[205],MaxO;
bool pncmp(int a,int b){
   return niz[a]<niz[b];
}
struct slog{
   int x,y;
}pp;
struct elem{
   bool bit[205];
   elem operator ^ (const elem &a){
      elem r;
      for(int i=1;i<=N;i++)
         r.bit[i]=a.bit[i]^bit[i];
      return r;
   }
} sniz[205],zniz[205];
queue<slog> Q;
void dodaj(int a,int b){
   pp.x=a;
   pp.y=b;
   Q.push(pp);
}
void ispis(){
   cout<<Q.size()<<endl;
   while(Q.size()){
      pp=Q.front();
      niz[pp.x]^=niz[pp.y];
      Q.pop();
      cout<<pp.x<<" "<<pp.y<<endl;
   }
   exit(0);
}
void uradi(int a,int b){
   sniz[a]=sniz[a]^sniz[b];
   dodaj(a,b);
}
void pisibit(){
   for(int i=N;i>=1;i--){
      for(int j=1;j<=N;j++)
         cout<<sniz[j].bit[i]<<" ";
      cout<<endl;
   }
}
int main(){
 //  freopen("Input.txt","r",stdin);
   cin>>N>>S;
   for(int i=1;i<=N;i++)
      cin>>niz[i];
   MaxO=40000;
   if(S==1){
      for(int i=1;i<=N;i++)
         pniz[i]=i;
      sort(pniz+1,pniz+1+N,pncmp);
      for(int i=1;i<=N;i++){
         sniz[pniz[i]].bit[i]=1;
         zniz[i].bit[i]=1;
      }
      for(int i=1;i<=N;i++)
         niz2[pniz[i]]=i;
      for(int i=1;i<=N;i++)
         for(int j=i;j<=N;j++){
            if(niz2[j]!=i)
               continue;
            for(int k=N-1;k>j;k--)
               uradi(k+1,k);
            for(int k=j;k<N;k++)
               uradi(k+1,k);
            for(int k=j;k>i;k--){
               swap(niz2[k],niz2[k-1]);
               uradi(k,k-1);
               uradi(k-1,k);
            }
           // pisibit();
            //cout<<endl;
            break;
         }

      for(int i=2;i<=N;i++)
         uradi(i,i-1);
      ispis();
      return 0;
   }
   for(int step=(1<<19);step>=1;step/=2){
      bool nemoj=true;
      for(int i=1;i<=N;i++)
         if(niz[i]&step)
            nemoj=false;
      if(nemoj)
         continue;
      for(int i=1;i<N;i++)
         if((niz[i]&step)>0 and (niz[i+1]&step)==0){
            niz[i+1]^=niz[i];
            dodaj(i+1,i);
         }
      for(int i=1;i<N;i++){
         if(niz[i]&step){
            niz[i]^=niz[i+1];
            dodaj(i,i+1);
         }
      }
      N--;
   }
   ispis();
   return 0;
}
/*
5 1
4 2 5 3 1
*/

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 32 ms 644 KB Output is correct
5 Correct 32 ms 632 KB Output is correct
6 Correct 31 ms 704 KB Output is correct
7 Correct 33 ms 720 KB Output is correct
8 Correct 40 ms 736 KB Output is correct
9 Correct 40 ms 616 KB Output is correct
10 Correct 42 ms 688 KB Output is correct
11 Correct 30 ms 704 KB Output is correct
12 Correct 34 ms 596 KB Output is correct
13 Correct 34 ms 716 KB Output is correct
14 Correct 32 ms 680 KB Output is correct
15 Correct 33 ms 596 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 32 ms 644 KB Output is correct
5 Correct 32 ms 632 KB Output is correct
6 Correct 31 ms 704 KB Output is correct
7 Correct 33 ms 720 KB Output is correct
8 Correct 40 ms 736 KB Output is correct
9 Correct 40 ms 616 KB Output is correct
10 Correct 42 ms 688 KB Output is correct
11 Correct 30 ms 704 KB Output is correct
12 Correct 34 ms 596 KB Output is correct
13 Correct 34 ms 716 KB Output is correct
14 Correct 32 ms 680 KB Output is correct
15 Correct 33 ms 596 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 39 ms 684 KB Output is correct
18 Correct 61 ms 976 KB Output is correct
19 Correct 56 ms 972 KB Output is correct
20 Correct 59 ms 972 KB Output is correct
21 Correct 56 ms 972 KB Output is correct
22 Correct 65 ms 1028 KB Output is correct
23 Correct 57 ms 980 KB Output is correct
24 Correct 59 ms 904 KB Output is correct
25 Correct 57 ms 944 KB Output is correct
26 Correct 57 ms 1004 KB Output is correct
27 Correct 62 ms 980 KB Output is correct
28 Correct 59 ms 936 KB Output is correct
29 Correct 56 ms 904 KB Output is correct
30 Correct 60 ms 1020 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 8 ms 340 KB Output is correct
5 Correct 41 ms 780 KB Output is correct
6 Correct 42 ms 680 KB Output is correct
7 Correct 39 ms 716 KB Output is correct
8 Correct 45 ms 728 KB Output is correct
9 Correct 38 ms 716 KB Output is correct
10 Correct 39 ms 692 KB Output is correct
11 Correct 43 ms 780 KB Output is correct
12 Correct 39 ms 772 KB Output is correct
13 Correct 40 ms 812 KB Output is correct
14 Correct 42 ms 760 KB Output is correct
15 Correct 53 ms 844 KB Output is correct