# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
17078 | erdemkiraz | Parrots (IOI11_parrots) | C++98 | 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>
using namespace std;
#define type(x) __typeof((x).begin())
#define foreach(it, x) for(type(x) it = (x).begin(); it != (x).end(); it++)
typedef long long ll;
typedef pair < int, int > ii;
const int inf = 1e9 + 333;
const ll linf = 1e18 + inf;
////////////////////////////////////////////////////////////////////////////////////////////////
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[])
{
int i, b;
for(i=0; i<L; i++) {
b = X[i];
output(b);
}
}
#include "encoder.h"
#include "encoderlib.h"
void encode(int N, int M[])
{
sort(M, M + N);
int i;
for(i= 0; i + 1 < N; i += 2) {
swap(M[i], M[i + 1]);
}
for(i=0; i<N; i++)
send(M[i]);
}
#include <bits/stdc++.h>
using namespace std;
#define type(x) __typeof((x).begin())
#define foreach(it, x) for(type(x) it = (x).begin(); it != (x).end(); it++)
typedef long long ll;
typedef pair < int, int > ii;
const int inf = 1e9 + 333;
const ll linf = 1e18 + inf;
////////////////////////////////////////////////////////////////////////////////////////////////
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[])
{
int i, b;
for(i=0; i<L; i++) {
b = X[i];
output(b);
}
}
#include "encoder.h"
#include "encoderlib.h"
void encode(int N, int M[])
{
sort(M, M + N);
int i;
for(i= 0; i + 1 < N; i += 2) {
swap(M[i], M[i + 1]);
}
for(i=0; i<N; i++)
send(M[i]);
}