# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
559315 | Mahmudul_Kabir | Parrots (IOI11_parrots) | C++14 | 2 ms | 1032 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;
void encode(int N, int M[])
{
int i;
for(i=0; i<N; i++){
int x = (M[i] * 100) + (i + 1);
send(x);
}
}
#include "decoder.h"
#include "decoderlib.h"
#include "bits/stdc++.h"
using namespace std;
#define all(x) x.begin(), x.end()
#define pii pair<int,int>
#define pb push_back
void decode(int N, int L, int X[])
{
int i, b;
vector<pii> fin;
for(i=0; i<L; i++) {
b = X[i];
int ind = b % 100;
b /= 100;
fin.pb({ind,b});
}
sort(all(fin));
for(auto [i,v] : fin) output(v);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |