제출 #67265

#제출 시각아이디문제언어결과실행 시간메모리
67265RezwanArefin01앵무새 (IOI11_parrots)C++17
88 / 100
13 ms2616 KiB
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std; 

void encode(int N, int M[]) {
    if(N <= 32) {
        for(int i = 0; i < 8 * N; i++) {
            int c = (M[i / 8] >> (7 - i % 8)) & 1; 
            if(c) send(i);
        }
    } else {
        for(int i = 0; i < 4 * N; i++) {
            int c = M[i / 4] >> ((3 - (i % 4)) * 2) & 3; 
            for(int j = 0; j < c; j++) 
                send(i);
        }
    }
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std; 

void decode(int N, int L, int X[]) {
    int a[N * 8];
    memset(a, 0, sizeof a);
    if(N <= 32) {
        for(int i = 0; i < L; i++) 
            a[X[i]] = 1; 
        for(int i = 0; i < N; i++) {
            int num = 0; 
            for(int j = i * 8; j < (i + 1) * 8; j++) 
                num = num * 2 + a[j];
            output(num);
        }
    } else {
        for(int i = 0; i < L; i++) 
            a[X[i]]++; 
        for(int i = 0; i < N; i++) {
            int num = 0;
            for(int j = i * 4; j < (i + 1) * 4; j++) 
                num = num * 4 + a[j];
            output(num);
        }    
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...