# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
351749 | kylych03 | Parrots (IOI11_parrots) | C++14 | 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 "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
int res[256], f[256];
void decode(int N, int L, int X[])
{
int i, xr;
for(i=0; i<256; i++){
res[i]=0;
f[i]=0;
}
for(int t = 0 ; t < 256; t++){
int cnt = 0 ;
for(i=0; i < L; i++){
if(X[i] == t)
cnt++;
}
if (cnt >=8){
xr = t , cnt =0;
for(i=0; cnt < 4; i++){
if(X[i] == t){
f[i]=1;
cnt++;
}
}
break;
}
}
for(i=0; i < L; i++){
if ( f[i])
continue;
if(N > 32)
res[X[i]>>2]+=( 1<<((X[i]&3)*2));
else
res[X[i]>>3]|=( 1<<(X[i]&7));
}
for(i=0; i<N; i++) {
output(res[i]^xr);
}
}
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
void encode(int N, int M[])
{
int i, xr, rs = 1e9;
for(int t = 0 ; t < 256; t++){
int cnt = 0;
for(i = 0 ; i < N; i++){
int f = (M[i] ^ t);
for(int j= 0 ; j < 8 ;j++){
if(( f>>j )& 1){
if(j%2==1)
cnt++;
cnt++;
}
}
}
if(cnt < rs){
rs = cnt;
xr = t;
}
}
for(i = 0 ; i < N; i++)
M[i]^=(xr);
send(xr);
send(xr);
send(xr);
send(xr);
send(xr);
send(xr);
send(xr);
send(xr);
if(N > 32){
for(i=0; i<N; i++){
int packet=(i<<2);
for(int j= 0 ; j < 8 ;j++){
if(( M[i]>>j )&1){
if(j%2==1)
send(packet+j/2);
send(packet+j/2);
}
}
}
}
else
for(i=0; i<N; i++){
int packet=(i<<3);
for(int j= 0 ; j < 8 ;j++){
if(( M[i]>>j )&1){
send(packet+j);
}
}
}
}