# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23619 | Hiasat | Parrots (IOI11_parrots) | C++14 | 17 ms | 2656 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 <bits/stdc++.h>
using namespace std;
void encode(int N, int M[])
{
for (int i = 0; i < N; i++) {
for (int bit = 0; bit <= 7 ; bit++) {
int cur = 0;
int rem = i * 8 + (7-bit);
for (int j = 6 ; j >= 0 ; j--) {
if (rem >= (1 << j)) {
cur = cur | ( 1 << j);
rem -= (1 << j);
}
}
cur = cur | ((M[i] & (1 << bit)) ? (1 << 7) : 0);
send(cur);
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
int ans[310];
void decode(int N, int L, int X[])
{
int i, b;
for(i=0; i<L; i++) {
bool bit = (X[i] && (1 << 7));
int nw = X[i] - (1 << 7)*bit;
ans[nw] = bit;
}
for (int i = 0; i < N; ++i){
int cur = 0;
for(int j = 0 ; j <= 7 ; j++){
cur += ans[i*8+j] * (1 << (7-j));
}
output(cur);
}
}
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... |