| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1235321 | pcp | Parrots (IOI11_parrots) | C++20 | 2095 ms | 320 KiB |
#include "encoder.h"
#include "encoderlib.h"
#include <math.h>
#include <iostream>
#include <vector>
using namespace std;
void encode(int N, int M[])
{
int i;
for(i=0; i<N; i++){
int b = M[i];
for (int j = 3;j >= 0;j=j--){
int x = pow(2,j*2);
for (int k = 0; k < 4; ++k){
if (x <= b){
b-=x;
send(j + i*4);
}else break;
}
}
}
}#include "decoder.h"
#include "decoderlib.h"
#include <math.h>
#include <iostream>
#include <vector>
using namespace std;
void decode(int N, int L, int X[])
{
int i, b;
vector<int> msg(N,0);
for(i=0; i<L; i++) {
b = X[i] ;
msg[b/4] += pow(2,(b%4)*2);
}
for (int c : msg)output(c);
}| # | 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... | ||||
