# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
602231 | ThegeekKnight16 | Parrots (IOI11_parrots) | C++14 | 3 ms | 1064 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"
using namespace std;
void encode(int N, int M[])
{
int R = 0;
for (int i = 0; i < N; i++)
{
for (int k = 0; k < 8; k++)
{
if (M[i] & (1 << k)) send(8*i + k);
}
}
}
#include <bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
using namespace std;
void decode(int N, int L, int X[])
{
int M[300], Marc[300];
for (int i = 0; i < 266; i++) {M[i] = 0; Marc[i] = 0;}
sort(X, X+L);
for (int i = 0; i < L; i++)
{
M[X[i] / 8] += (1 << (X[i] % 8));
}
for (int i = 0; i < N; i++) output(M[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... |