#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
void encode(int n, int _a[]) {
vector<int> a(_a, _a + n);
for (int b = 0; b < 8; b++) {
int cur = 0;
for (int i = 0; i < n; i++) {
if ((a[i] >> b & 1) != cur) {
cur ^= 1;
if (b < 4) {
send(b + 4 * i);
} else {
send(b - 4 + 4 * i);
send(b - 4 + 4 * i);
}
}
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
void decode(int n, int k, int _a[]) {
vector<int> a(_a, _a + k);
vector<int> freq(256, 0);
for (int x : a) {
freq[x]++;
}
vector<vector<int>> change(8, vector<int>(n, 0));
for (int x = 0; x < 256; x++) {
if (freq[x] & 1) {
change[x % 4][x / 4] = 1;
}
if (freq[x] >> 1 & 1) {
change[x % 4 + 4][x / 4] = 1;
}
}
vector<int> res(n, 0);
for (int b = 0; b < 8; b++) {
int cur = 0;
for (int i = 0; i < n; i++) {
cur ^= change[b][i];
res[i] += cur << b;
}
}
for (int x : res) {
output(x);
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
788 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
1312 KB |
Output is correct |
2 |
Correct |
2 ms |
1300 KB |
Output is correct |
3 |
Correct |
2 ms |
1320 KB |
Output is correct |
4 |
Correct |
2 ms |
1316 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1312 KB |
Output is correct |
2 |
Correct |
2 ms |
1312 KB |
Output is correct |
3 |
Correct |
3 ms |
1316 KB |
Output is correct |
4 |
Correct |
3 ms |
1316 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1308 KB |
Output is correct |
2 |
Correct |
2 ms |
1320 KB |
Output is correct |
3 |
Correct |
3 ms |
1328 KB |
Output is correct |
4 |
Correct |
3 ms |
1340 KB |
Output is correct |
5 |
Correct |
4 ms |
1344 KB |
Output is correct |
6 |
Correct |
4 ms |
1340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
3 ms |
1316 KB |
Output is partially correct - P = 7.125000 |
2 |
Partially correct |
4 ms |
1180 KB |
Output is partially correct - P = 6.625000 |
3 |
Partially correct |
4 ms |
1340 KB |
Output is partially correct - P = 7.121212 |
4 |
Partially correct |
6 ms |
1372 KB |
Output is partially correct - P = 6.860000 |
5 |
Partially correct |
7 ms |
1376 KB |
Output is partially correct - P = 6.550000 |
6 |
Partially correct |
9 ms |
1384 KB |
Output is partially correct - P = 6.730159 |
7 |
Partially correct |
7 ms |
1376 KB |
Output is partially correct - P = 6.578125 |