# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
25505 | Bruteforceman | 앵무새 (IOI11_parrots) | C++11 | 9 ms | 2216 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 "encoder.h"
#include "encoderlib.h"
#include "vector"
using namespace std;
void encode(int N, int M[])
{
int i;
vector <int> pos;
for(int i = 0; i < N; i++) {
for(int j = 0; j < 8; j++) {
pos.push_back((M[i] >> j) & 1);
}
}
for(size_t i = 0; i < pos.size(); i++) {
if(pos[i] == 1) {
send(i);
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include "vector"
using namespace std;
void decode(int N, int L, int X[])
{
int i, b;
vector <int> v (8 * N);
for(i=0; i<L; i++) {
b = X[i];
v[b] = 1;
}
for(int i = 0; i < N; i++) {
int num = 0;
for(int j = 0; j < 8; j++) {
num |= (1 << j) * v[8*i + j];
}
output(num);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |