| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1163297 | HappyCapybara | 앵무새 (IOI11_parrots) | C++20 | 2 ms | 840 KiB |
#include "encoder.h"
#include "encoderlib.h"
void encode(int N, int M[]){
for(int i=0; i<N; i++){
for (int j=0; j<8; j++){
if (M[i] & (1<<j)) send(i*8+j);
}
}
}
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[]){
int m[N];
for (int i=0; i<N; i++) m[i] = 0;
for(int i=0; i<L; i++) m[X[i]/8] |= (1<<(X[i] % 8));
for (int i=0; i<N; i++) output(m[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... | ||||
