# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
518444 | tabr | Parrots (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>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
void send(int);
void output(int);
#include "encoder.h"
#include "encoderlib.h"
void encode(int n, int a[]) {
for (int i = 0; i < n; i++) {
send(a[i] + 256 * i);
}
}
#include "decoder.h"
#include "decoderlib.h"
void decode(int n, int l, int a[]) {
sort(a, a + l);
for (int i = 0; i < n; i++) {
output(a[i] % 256);
}
}
#ifdef tabr
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
return 0;
}
#endif
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
void send(int);
void output(int);
#include "encoder.h"
#include "encoderlib.h"
void encode(int n, int a[]) {
for (int i = 0; i < n; i++) {
send(a[i] + 256 * i);
}
}
#include "decoder.h"
#include "decoderlib.h"
void decode(int n, int l, int a[]) {
sort(a, a + l);
for (int i = 0; i < n; i++) {
output(a[i] % 256);
}
}
#ifdef tabr
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
return 0;
}
#endif