oj.uz

Submission #718039

# Submission time Handle Problem Language Result Execution time Memory
718039 2023-04-03T08:26:17 Z NemanjaSo2005 Xor Sort (eJOI20_xorsort) C++14
65 / 100
 92 ms 1236 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll N,S,niz[1005],pniz[205],niz2[205];
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 uradi(int a,int b){
   sniz[a]=sniz[a]^sniz[b];
   dodaj(a,b);
}
void ispis(){
   cout<<Q.size()<<endl;
   while(Q.size()){
      pp=Q.front();
      Q.pop();
      cout<<pp.x<<" "<<pp.y<<endl;
   }
   exit(0);
}
void stavi1(int gde,elem sta){
   bool isti=true;
   for(int i=1;i<=N;i++)
      if(sniz[gde].bit[i]!=sta.bit[i])
         isti=false;
   if(isti)
      return;
   if(sta.bit[gde-1]==sniz[gde].bit[gde-1])
      uradi(gde,gde-1);
   elem pret;

   for(int i=1;i<gde;i++)
      pret.bit[i]=sta.bit[i]^sniz[gde].bit[i];
   for(int i=gde;i<=N;i++)
      pret.bit[i]=0;
   stavi1(gde-1,pret);
   uradi(gde,gde-1);
   return;
}
int main(){
   cin>>N>>S;
   for(int i=1;i<=N;i++)
      cin>>niz[i];
   if(S==1){/*
      for(int i=1;i<=N;i++)
         niz2[i]=niz[i];
      for(int i=1;i<=N;i++)
         for(int j=1;j<N;j++)
            if(niz2[j]>niz2[j+1]){
               swap(niz2[j+1],niz2[j]);
               dodaj(j,j+1);
               dodaj(j+1,j);
               dodaj(j,j+1);
            }
      if(Q.size()<=40000)
         ispis();
      while(Q.size())
         Q.pop();*/

      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=j;k>i;k--){
               swap(niz2[k],niz2[k-1]);
               uradi(k,k-1);
               uradi(k-1,k);
            }
            break;
         }


      /*for(int i=N;i>=1;i--){
         for(int j=1;j<=N;j++)
            cout<<sniz[j].bit[i]<<" ";
         cout<<endl;
      }*/

      for(int i=N;i>=2;i--)
         stavi1(i,zniz[i]);
    /*  cout<<endl;

      for(int i=N;i>=1;i--){
         for(int j=1;j<=N;j++)
            cout<<sniz[j].bit[i]<<" ";
         cout<<endl;
      }*/
      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;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 41 ms 812 KB Output is correct
5 Correct 44 ms 844 KB Output is correct
6 Correct 40 ms 776 KB Output is correct
7 Correct 44 ms 752 KB Output is correct
8 Correct 44 ms 816 KB Output is correct
9 Correct 43 ms 756 KB Output is correct
10 Correct 44 ms 848 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 35 ms 724 KB Output is correct
13 Correct 42 ms 668 KB Output is correct
14 Correct 32 ms 724 KB Output is correct
15 Correct 33 ms 776 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 41 ms 812 KB Output is correct
5 Correct 44 ms 844 KB Output is correct
6 Correct 40 ms 776 KB Output is correct
7 Correct 44 ms 752 KB Output is correct
8 Correct 44 ms 816 KB Output is correct
9 Correct 43 ms 756 KB Output is correct
10 Correct 44 ms 848 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 35 ms 724 KB Output is correct
13 Correct 42 ms 668 KB Output is correct
14 Correct 32 ms 724 KB Output is correct
15 Correct 33 ms 776 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 52 ms 816 KB Output is correct
18 Incorrect 92 ms 1236 KB Integer 51258 violates the range [0, 40000]
19 Halted 0 ms 0 KB -

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 312 KB Output is correct
4 Correct 10 ms 308 KB Output is correct
5 Correct 42 ms 788 KB Output is correct
6 Correct 38 ms 716 KB Output is correct
7 Correct 49 ms 672 KB Output is correct
8 Correct 41 ms 756 KB Output is correct
9 Correct 38 ms 768 KB Output is correct
10 Correct 39 ms 748 KB Output is correct
11 Correct 42 ms 768 KB Output is correct
12 Correct 42 ms 784 KB Output is correct
13 Correct 44 ms 752 KB Output is correct
14 Correct 51 ms 820 KB Output is correct
15 Correct 52 ms 828 KB Output is correct