# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
351479 | kylych03 | Parrots (IOI11_parrots) | C++14 | 5 ms | 1560 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;
set <int> st;
set <int> ::iterator it;
int sum=0;
for(i=0; i<N; i++){
int packet=(i<<3);
for(int j= 0 ; j < 8 ;j++){
if(( M[i]>>j )&1){
st.insert(packet+j);
}
}
}
for(it = st.begin() ; it!=st.end(); it++)
send(*it);
}
#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;
vector <int> res;
res.resize(N);
for(i=0; i<N; i++)
res[i]=0;
for(i=0; i<L; i++){
res[X[i]>>3]|=( 1<<(X[i]&7));
}
for(i=0; i<N; i++) {
output(res[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... |