#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define pll pair <ll,ll>
#define fi first
#define se second
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1LL)
#define MASK(i) (1LL << (i))
#define MP make_pair
#include "decoder.h"
#include "decoderlib.h"
#include "encoder.h"
#include "encoderlib.h"
namespace {
ll p[101][256];
void init(){
mt19937_64 rng(69420);
for (ll i = 0;i < 100;i ++){
for (ll j = 0;j < 256;j ++){
p[i][j] = j;
}
shuffle(p[i],p[i]+256,rng);
}
}
}
void encode(int N, int M[]){
init();
ll n = N;
vector <bool> all;
for (ll i = 0;i < n;i ++){M[i] = p[i][M[i]];}
for (ll i = 0;i < n;i ++)for (ll j = 0;j < 8;j ++)all.push_back(BIT(M[i],j));
ll cnt[2];
for (auto x:all)cnt[x]++;
if (cnt[0]>cnt[1]){
all.insert(all.begin(),1);
for (ll i = 1;i < sz(all);i++)all[i] = 1-all[i];
}
else{
all.insert(all.begin(),0);
}
all.push_back(1);
// for (auto x:all)cout<<x;
// cout<<endl;
cnt[0] = cnt[1] = 0;
for (auto x:all){
cnt[x]++;
if (x==1){
send(cnt[0]);
}
}
}
void decode(int N, int L, int X[]){
init();
ll n = N;
ll cnt[300] = {};
for (ll i = 0;i < L;i ++){
cnt[X[i]]++;
}
vector <ll> bit;
for (ll i = 0;i < 256;i ++){
while (cnt[i]--){
bit.push_back(i);
}
}
vector <bool> all;
ll last = 0;
for (auto x:bit){
for (ll i= 0 ;i < x - last;i ++){
all.push_back(0);
}
all.push_back(1);
last = x;
}
// for (auto x:all)cout<<x;
// cout<<endl;
if (all[0] == 1){
for (ll j = 0;j < sz(all);j ++)all[j] = 1-all[j];
}
for (ll i = 0,ptr = 1;i < n;i ++,ptr += 8){
ll res = 0;
for (ll j = 0;j < 8;j ++){
res += MASK(j) * all[ptr+j];
}
// cout<<i<<' '<<res<<endl;
for (ll j = 0;j < 256;j ++){
if (p[i][j]==res){
// cout<<i<<' '<<j<<endl;
output(j);
}
}
}
}
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define pll pair <ll,ll>
#define fi first
#define se second
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1LL)
#define MASK(i) (1LL << (i))
#define MP make_pair
#include "decoder.h"
#include "decoderlib.h"
#include "encoder.h"
#include "encoderlib.h"
namespace {
ll p[101][256];
void init(){
mt19937_64 rng(69420);
for (ll i = 0;i < 100;i ++){
for (ll j = 0;j < 256;j ++){
p[i][j] = j;
}
shuffle(p[i],p[i]+256,rng);
}
}
}
void encode(int N, int M[]){
init();
ll n = N;
vector <bool> all;
for (ll i = 0;i < n;i ++){M[i] = p[i][M[i]];}
for (ll i = 0;i < n;i ++)for (ll j = 0;j < 8;j ++)all.push_back(BIT(M[i],j));
ll cnt[2];
for (auto x:all)cnt[x]++;
if (cnt[0]>cnt[1]){
all.insert(all.begin(),1);
for (ll i = 1;i < sz(all);i++)all[i] = 1-all[i];
}
else{
all.insert(all.begin(),0);
}
all.push_back(1);
// for (auto x:all)cout<<x;
// cout<<endl;
cnt[0] = cnt[1] = 0;
for (auto x:all){
cnt[x]++;
if (x==1){
send(cnt[0]);
}
}
}
void decode(int N, int L, int X[]){
init();
ll n = N;
ll cnt[300] = {};
for (ll i = 0;i < L;i ++){
cnt[X[i]]++;
}
vector <ll> bit;
for (ll i = 0;i < 256;i ++){
while (cnt[i]--){
bit.push_back(i);
}
}
vector <bool> all;
ll last = 0;
for (auto x:bit){
for (ll i= 0 ;i < x - last;i ++){
all.push_back(0);
}
all.push_back(1);
last = x;
}
// for (auto x:all)cout<<x;
// cout<<endl;
if (all[0] == 1){
for (ll j = 0;j < sz(all);j ++)all[j] = 1-all[j];
}
for (ll i = 0,ptr = 1;i < n;i ++,ptr += 8){
ll res = 0;
for (ll j = 0;j < 8;j ++){
res += MASK(j) * all[ptr+j];
}
// cout<<i<<' '<<res<<endl;
for (ll j = 0;j < 256;j ++){
if (p[i][j]==res){
// cout<<i<<' '<<j<<endl;
output(j);
}
}
}
}
Compilation message
/usr/bin/ld: /tmp/ccbHG8Zk.o: in function `decode(int, int, int*)':
encoder.cpp:(.text+0xba9): undefined reference to `output(int)'
collect2: error: ld returned 1 exit status
/usr/bin/ld: /tmp/ccA05392.o: in function `encode(int, int*)':
decoder.cpp:(.text+0x7bd): undefined reference to `send(int)'
collect2: error: ld returned 1 exit status
