# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
351404 | kylych03 | Parrots (IOI11_parrots) | C++14 | 4 ms | 1388 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;
//#include "grader.cpp"
void encode(int N, int M[])
{
int i;
for(i=0; i<N; i++)
if(M[i])
send(i);
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
void decode(int N, int L, int X[])
{
int i, b;
sort(X, X+L);
int p=0;
for(i=0; i<N; i++) {
if(p<L && i==X[p])
output(1), p++;
else
output(0);
}
}
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... |