#include "encoder.h"
#include "encoderlib.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void encode(int N, int M[])
{
vector<int> mes(N);
vector<int> tb;
for(int i = 0; i<256; i++){
if(bitset<8>(i).count() ==4){
tb.push_back(i);
}
}
for(int i =0; i<N; i++){
mes[i] = M[i]^(tb[i%tb.size()]);
}
if(N>32){
int id = 0;
for(int i=0; i<N; i++){
for(int j = 0; j<8; j+=2){
int oc = (mes[i] & (3<<j))>>j;
for(int k = 0; k<oc; k++){
send(id);
}
id++;
}
}
}
else{
int id = 0;
for(int i=0; i<N; i++){
for(int j = 0; j<8; j++){
if((mes[i] & (1<<j))!=0){
send(id);
}
id++;
}
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include<bits/stdc++.h>
using namespace std;
void decode(int N, int L, int X[])
{
vector<int> res(N);
if(N<=32){
vector<int> v(L);
for(int i = 0; i<L; i++){
v[i] = X[i];
}
sort(v.begin(), v.end());
bool swaping = false;
for(int i = 0; i<L; i++){
if(i>0 && v[i]==v[i-1]){
swaping = true;
}
res[v[i]/8]^=(1<<(v[i]%8));
}
for(auto e: res){
//cout<<bitset<8>(e)<<endl;
}
if(swaping){
//cout<<"swapping"<<endl;
for(int i = 0; i<N; i++){
res[i] ^= (1<<8)-1;
}
}
}
else{
////cout<<"L "<<L<<endl;
vector<int> v(L);
for(int i = 0; i<L; i++){
v[i] = X[i];
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for(int pos = 0; pos<N*4; pos++){
int oc= 0;
while(v.size()>0 && v.back() == pos){
oc++;
v.pop_back();
}
//cout<<bitset<8>(oc<<((2*pos)%8));
res[pos/4] ^= (oc<<((2*pos)%8));
}
}
vector<int> tb;
for(int i = 0; i<256; i++){
if(bitset<8>(i).count() ==4){
tb.push_back(i);
}
}
for(int i = 0; i<N; i++){
res[i] = res[i]^tb[i%tb.size()];
}
for(auto e: res){
output(e);
}
}
Compilation message
decoder.cpp: In function 'void decode(int, int, int*)':
decoder.cpp:25:18: warning: unused variable 'e' [-Wunused-variable]
25 | for(auto e: res){
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
796 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1304 KB |
Output is correct |
2 |
Correct |
1 ms |
1316 KB |
Output is correct |
3 |
Correct |
2 ms |
1316 KB |
Output is correct |
4 |
Correct |
1 ms |
1320 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1304 KB |
Output is correct |
2 |
Correct |
1 ms |
1316 KB |
Output is correct |
3 |
Correct |
2 ms |
1312 KB |
Output is correct |
4 |
Correct |
1 ms |
1316 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1716 KB |
Output is correct |
2 |
Correct |
2 ms |
1312 KB |
Output is correct |
3 |
Correct |
2 ms |
1324 KB |
Output is correct |
4 |
Correct |
3 ms |
1328 KB |
Output is correct |
5 |
Correct |
2 ms |
1332 KB |
Output is correct |
6 |
Correct |
3 ms |
1336 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
1816 KB |
Output is correct - P = 5.000000 |
2 |
Correct |
3 ms |
1332 KB |
Output is correct - P = 4.468750 |
3 |
Partially correct |
3 ms |
1332 KB |
Output is partially correct - P = 7.424242 |
4 |
Partially correct |
5 ms |
1356 KB |
Output is partially correct - P = 6.540000 |
5 |
Partially correct |
7 ms |
1384 KB |
Output is partially correct - P = 6.716667 |
6 |
Partially correct |
7 ms |
1432 KB |
Output is partially correct - P = 6.380952 |
7 |
Partially correct |
8 ms |
1376 KB |
Output is partially correct - P = 6.437500 |