제출 #1219888

#제출 시각아이디문제언어결과실행 시간메모리
1219888SpyrosAliv앵무새 (IOI11_parrots)C++20
81 / 100
2 ms852 KiB
#include "encoder.h"
#include "encoderlib.h"
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;

void encode(int n, int m[]) {
    int curr = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 8; j++) {
            if ((m[i] >> j) & 1) {
                send(curr);
            }
            curr++;
        }
    }
}
#include "encoder.h"
#include "encoderlib.h"
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;

void decode(int n, int l, int x[]) {
    vector<int> ans(n, 0);
    for (int i = 0; i < l; i++) {
        int elPos = x[i] / 8;
        int bitPos = x[i] % 8;
        ans[elPos] |= (1 << bitPos);
    }
    for (int i = 0; i < n; i++) output(ans[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...