# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483212 | blue | Parrots (IOI11_parrots) | C++17 | 3 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"
#include <iostream>
using namespace std;
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)) == 0) continue;
int s = 0;
send(8*i + j);
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
void decode(int N, int L, int X[])
{
vector<int> ans(N, 0);
for(int i = 0; i < L; i++)
{
int x = X[i];
ans[x/8] += (1 << (x % 8));
}
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... |