| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 65884 | jaehun630 | Parrots (IOI11_parrots) | C++14 | 6 ms | 1832 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[])
{
  int i;
  //subtask3
  for (i = 0; i < N; i++)
	  for(int j=0; j<=1; j++)
		j == 0 ? send((i << 5) + (M[i] >> 4)) : send((i << 5) + (j << 4) + M[i]);
}
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[])
{
  int i, b;
  int ans[100] = { 0 };
  for(i=0; i<L; i++)
	  ans[X[i] / (1 << 5)] += (X[i] >> 4) == 0 ? (X[i] << 4) : X[i];
  
  for (int i = 0; i < N; i++)
	  output(ans[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... | ||||
