# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
784933 | AbdelmagedNour | 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 <bits/stdc++.h>
#include "encoder.h"
using namespace std;
void encode(int N, int M[]){
vector<int>ones,zeros;
for(int i=0;i<N;i++){
for(int j=0;j<8;j++){
if(M[i]&(1<<j))ones.push_back(i*8+j);
else zeros.push_back(i*8+j);
}
}
vector<int>res;
if(ones.size()<=N*8-ones.size()+2){
res=ones;
}else{
zeros.push_back(0);
zeros.push_back(0);
res=zeros;
}
for(int i=0;i<res.size();i++)send(res[i]);
}
#include <bits/stdc++.h>
#include "decoder.h"
using namespace std;
void decode(int N, int L, int X[]){
int cnt=count(X,X+L,0);
int res[N]={};
if(cnt>=2)fill(res,res+N,255);
for(int i=0;i<L;i++)res[X[i]/8]^=(1<<(X[i]%8));
for(int i=0;i<N;i++)output(res[i]);
}