# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
69273 | bnahmad15 | Parrots (IOI11_parrots) | C++17 | 16 ms | 1616 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++){
int tmp = i,tmp2 = i;
for(int j = 5;j<15;j++){
if(M[i] & (1<<(j-5)))
tmp |= (1<<j);
}
for(int j = 5;j<11;j++){
if(M[i] & (1<<(j+5)))
tmp2 |= (1<<j);
}
tmp2 |= (1<<15);
send(tmp);
send(tmp2);
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
int ar[20];
void decode(int N, int L, int X[]){
for(int i = 0;i<L;i++){
int p = 0;
for(int j = 0;j<5;j++){
if((1<<j) & X[i])
p |= (1<<j);
}
int numb = 0;
if(X[i] & (1<<15)){
for(int j = 5;j<11;j++){
if((1<<j) & X[i])
numb |= (1<<j+5);
}
}
else {
for(int j = 5;j<15;j++){
if((1<<j) & X[i])
numb |= (1<<(j-5));
}
}
ar[p] |= numb;
}
for(int i = 0;i<N;i++)
output(ar[i]);
}
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... |