| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 67358 | zetapi | Parrots (IOI11_parrots) | C++14 | 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 "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define itr ::iterator
typedef pair<int,int> pii;
const int MAX=1e5;
void encode(int N,int M[])
{
int arr[1000];
vector<int> vec;
for(int A=0;A<N;A++)
{
send(-M[A]);
vec.pb(mp(M[A],A));
}
sort(vec.begin(),vec.end());
for(int A=0;A<vec.size();A++)
arr[vec[A].second]=A;
for(int A=0;A<N;A++)
{
int res=A;
for(int B=0;B<8;B++)
{
if(arr[A]&(1<<B))
res+=1<<(B+4);
}
send(res);
}
return ;
}
#include "decoder.h"
#include "decoderlib.h"
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define itr ::iterator
typedef pair<int,int> pii;
const int MAX=1e5;
void decode(int N, int L, int X[])
{
int res[1000];
vector<int> vec;
for(int A=0;A<L;A++)
if(X[A]<0)
vec.pb(-X[A]);
sort(vec.begin(),vec.end());
for(int A=0;A<L;A++)
{
if(X[A]<0)
continue;
int ind=0,num=0;
for(int B=0;B<4;B++)
if(X[A+N]&(1<<B))
ind+=(1<<B);
for(int B=0;B<8;B++)
if(X[A+N]&(1<<(B+4)))
num+=(1<<B);
res[ind]=num;
}
for(int A=0;A<N;A++)
output(vec[res[A]]);
return ;
}