# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483205 | blue | 앵무새 (IOI11_parrots) | C++17 | 0 ms | 0 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[])
{
// cerr << "encode " << N << '\n';
// for(int i = 0; i < N; i++) cerr << M[i] << ' ';
// cerr << '\n';
int s = 0;
for(int i = 0; i < N; i++)
{
s += M[i];
send(s);
// cerr << "send: " << s << '\n';
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <iostream>
using namespace std;
void decode(int N, int L, int X[])
{
// cerr << "output " << X[0] << ' ';
sort(X, X+L);
output(X[0]);
for(int i = 0; i+1 < N; i++)
{
// cerr << "output " << X[i+1] - X[i] << '\n';
output(X[i+1] - X[i]);
}
}