# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
481308 | unknownnnn | Parrots (IOI11_parrots) | C++14 | 2 ms | 1016 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 <iostream>
void encode(int n,int m[])
{
for(int i=0 ; i<n ; i++)
{
m[i]=(m[i]+1000*i); //ne i+1
}
for(int i=0 ; i<n ; i++)
{
send(m[i]);
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <iostream>
using namespace std;
void decode(int n, int l, int m[])
{
int broj;
int niza[n];
for(int i=0 ; i<n ; i++)
{
int poz=m[i]/1000;
niza[poz]=m[i]-poz*1000;
}
for(int i=0 ; i<n ; i++)
{
output(niza[i]);
}
}
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... |