제출 #447705

#제출 시각아이디문제언어결과실행 시간메모리
447705dxz05앵무새 (IOI11_parrots)C++14
0 / 100
2 ms880 KiB
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>

using namespace std;

void encode(int N, int M[]){
    //assert(N == 8 && M[0] == 1 && M[1] == 0 && M[2] == 1 && M[3] == 0 && M[4] == 0 && M[5] == 1 && M[6] == 1 && M[7] == 0);
    for (int i = 0; i < N; i++){

        if (M[i] == 1) send(i);

        continue;
        for (int j = 0; j < 8; j++){ /// ABBBBCCC
            if (!(M[i] & (1 << j))) continue;
            int code = i << 3;
            code |= j;

            send(code);
        }
    }

}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>

using namespace std;

int arr[128];

void decode(int N, int L, int X[]){
    for (int i = 0; i < L; i++){
        arr[X[i]] = 1;
        continue;
        int x = X[i];
        int ind = (x >> 3);
        x &= 7;

        arr[ind] |= 1 << x;
    }

    for (int i = 0; i < N; i++){
        output(arr[i]);
    }
}
#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...