| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1235252 | pcp | Parrots (IOI11_parrots) | C++20 | 1 ms | 840 KiB |
#include "encoder.h"
#include "encoderlib.h"
#include <math.h>
void encode(int N, int M[])
{
int i;
for(i=0; i<N; i++){
int b = M[i];
for (int j = 0;j <= 7;++j){
int x = pow(2,j);
if (x<b)send( j + 9*i );
else break;
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <vector>
#include <math.h>
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/9] += pow(2,(b%9));
}
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... | ||||
