제출 #712521

#제출 시각아이디문제언어결과실행 시간메모리
712521lmqzzzParrots (IOI11_parrots)C++14
81 / 100
3 ms1068 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] >> j & 1) send(i * 8 + j);
                }
        }
}

#include "decoder.h"

#include <bits/stdc++.h>
using namespace std;

#include "decoderlib.h"

void decode(int N, int L, int X[]) {
        vector<int> ans(N * 8, 0);
        for (int i = 0; i < L; i++) {
                ans[X[i]] = 1;
        }
        for (int i = 0; i < N; i++) {
                int num = 0;
                for (int j = i * 8 + 7; j >= i * 8; j--) {
                        num = num * 2 + ans[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...