# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
233460 | crossing0ver | 앵무새 (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<bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"
using namespace std;
void encode(int N, int M[])
{
int i,val;
vector<int> S(256);
for(i=0; i<N; i++) {
send(M[i]);
send(M[i]);
int t = S[M[i]];
val = i*6;
for (int j = 0; j < N; j++)
if (M[j] < M[i]) t++;
S[M[i]]++;
for (int j = 0; j < 6; j++)
if ( ( 1 << j) & t)
send(val + j);
}
}
#include<bits/stdc++.h>
//#include "decoder.h"
//#include "decoderlib.h"
using namespace std;
void decode(int N, int L, int X[])
{
int i, b , pos;
vector<int> v(10);
vector<int> set;
vector<int> S(256);
vector<int> ans(N);
for(i=0; i<L; i++) {
b = X[i];
S[b]++;
}
for (int i = 0; i < 256; i++) {
if (S[i] > 1) {
for (int j = 0; j < S[i]/2; j++)
set.push_back(i);
S[i] %= 2;
}
if (S[i] == 1) {
int num = 0,pos = i/6;
for (int j = 0; j < 6; j++)
ans[pos] += (1 << (i%6) );
}
}
sort(set.begin(),set.end());
for (int i = 0; i < N; i++)
output(set[ans[i]]);
}