| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 223978 | bigg | Parrots (IOI11_parrots) | C++14 | 13 ms | 1536 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<bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"
void encode(int N, int M[])
{
int i;
for(i=0; i<N; i++){
for(int j = 0; j < 8; j++){
if(M[i] &(1<<j)) send(j + 8*i);
}
}
}
#include<bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[])
{
int i, b, resp[100];
for(int i = 0; i < N; i++) resp[i] = 0;
for(int i = 0; i < L; i++){
resp[X[i]/8] += (1<<(X[i]%8));
}
for(i=0; i<N; i++) {
b = resp[i];
output(b);
}
}
| # | 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... | ||||
