| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 676628 | nvujica | Parrots (IOI11_parrots) | C++14 | 2 ms | 1048 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"
void encode(int n, int m[]){
for(int i = 0; i < n; i++){
for(int j = 0; j < 8; j++){
if(m[i] & (1 << j)) send((i << 3) + j);
}
}
}#include "decoder.h"
#include "decoderlib.h"
void decode(int n, int l, int x[]){
int m[n];
for(int i = 0; i < l; i++){
m[x[i] & 248] |= (1 << (x[i] & 7));
}
for(int i = 0; i < n; i++){
output(m[i]);
}
}| # | 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... | ||||
