| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1112210 | enzy | Parrots (IOI11_parrots) | C++14 | 4 ms | 1552 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[]){
vector<int>mandar;
for(int i=0;i<N;i++){
for(int k=0;k<10;k++){
if((1<<k)&M[i]){
int aux=(i<<3)+k;
mandar.push_back(aux);
}
}
}
for(auto a : mandar) send(a);
}
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[]){
int resp[N+1];
for(int i=0;i<N+1;i++) resp[i]=0;
for(int i=0;i<L;i++){
int pos=(X[i]>>3);
int val=(1<<(X[i]%(1<<3)));
resp[pos]+=val;
}
for(int i=0;i<N;i++) output(resp[i]);
}
| # | 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... | ||||
