# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
896456 | anton | Parrots (IOI11_parrots) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "encoder.h"
#include "encoderlib.h"
#include<bits/stdc++.h>
using namespace std;
void encode(int N, int M[])
{
if(N<=32){
int id = 0;
for(int i=0; i<N; i++){
for(int j = 0; j<8; j++){
if((M[i] & (1<<j))!=0){
send(id);
}
id++;
}
}
}
else{
int nb1 = 0;
for(int i=0; i<N; i++){
for(int j = 0; j<8; j++){
if((M[i] & (1<<j))!=0){
nb1++;
}
}
}
//cout<<nb1<<endl;
if(nb1<N*4){
//cout<<"no swap"<<endl;
int id = 0;
for(int i=0; i<N; i++){
for(int j = 0; j<8; j++){
if((M[i] & (1<<j))!=0){
send(id);
}
id++;
}
}
}
else{
vector<int>mes(N);
for(int i = 0; i<N; i++){
mes[i] = M[i]^((1<<8)-1);
}
int id = 0;
for(int i=0; i<N; i++){
for(int j = 0; j<8; j++){
if((mes[i] & (1<<j))!=0){
//cout<<id<<endl;
send(id);
}
id++;
}
}
send((N-1)*8 + 7);
send((N-1)*8 + 7);
}
}
}