제출 #758546

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
758546		CpDark	앵무새 (IOI11_parrots)	C++17	0 / 100	5 ms	1072 KiB

encoder

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

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;


const int SIZE = 8;
const int ORDERBITS = 5;

int pows2[] = { 1,2,4,8,16,32,64,128 };

void send(int a);
void output(int b);


inline int readid(int num) {
    for (int i = SIZE - 1; i >= ORDERBITS; i--) {
        if (num - pows2[i] >= 0) {
            num -= pows2[i];
        }
    }
    return num;
}

inline int readBit(int num) {
    int ans = 0;
    for (int i = SIZE - 1; i >= ORDERBITS; i--) {
        if (num - pows2[i] >= 0) {
            num -= pows2[i];
            ans += pows2[i - ORDERBITS];
        }
    }
    return ans;
}


inline int getShift(int num) {
    int ans = 0;
    for (int i = SIZE - ORDERBITS - 1;i >= 0;i--) {
        if (num - pows2[i] >= 0) {
            ans += pows2[i + ORDERBITS];
            num -= pows2[i];
        }
    }
    return ans;
}

inline void sendForNum(int num, int index) {
    for (int i = SIZE - 1;i >= 0;i--) {
        if (num - pows2[i] >= 0) {
            num -= pows2[i];
            int curr = index + getShift(i);
            send(curr);
        }
    }
}



void encode(int N, int M[]) {
    vi arr(N);
    for (int i = 0;i < N;i++) {
        arr[i] = M[i];
    }
    sort(arr.begin(), arr.end());
    for (int i = 0;i < N;i++) {
        sendForNum(arr[i], i);
    }
}

decoder

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

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;


const int SIZE = 8;
const int ORDERBITS = 5;

int pows2[] = { 1,2,4,8,16,32,64,128 };

void send(int a);
void output(int b);


inline int readid(int num) {
    for (int i = SIZE - 1; i >= ORDERBITS; i--) {
        if (num - pows2[i] >= 0) {
            num -= pows2[i];
        }
    }
    return num;
}

inline int readBit(int num) {
    int ans = 0;
    for (int i = SIZE - 1; i >= ORDERBITS; i--) {
        if (num - pows2[i] >= 0) {
            num -= pows2[i];
            ans += pows2[i - ORDERBITS];
        }
    }
    return ans;
}


inline int getShift(int num) {
    int ans = 0;
    for (int i = SIZE - ORDERBITS - 1;i >= 0;i--) {
        if (num - pows2[i] >= 0) {
            ans += pows2[i + ORDERBITS];
            num -= pows2[i];
        }
    }
    return ans;
}

inline void sendForNum(int num, int index) {
    for (int i = SIZE - 1;i >= 0;i--) {
        if (num - pows2[i] >= 0) {
            num -= pows2[i];
            int curr = index + getShift(i);
            send(curr);
        }
    }
}


void decode(int N, int L, int X[]) {
    vi arr(N);
    for (int i = 0;i < L;i++) {
        int index = readid(X[i]);
        arr[index] += pows2[readBit(X[i])];
    }

    for (int i = 0;i < arr.size();i++) {
        output(arr[i]);
    }
}

컴파일 시 표준 에러 (stderr) 메시지

decoder.cpp: In function 'void decode(int, int, int*)':
decoder.cpp:69:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |     for (int i = 0;i < arr.size();i++) {
      |                    ~~^~~~~~~~~~~~

• Subtask 1: 0 / 17
• Subtask 2: 0 / 17
• Subtask 3: 0 / 18
• Subtask 4: 0 / 29
• Subtask 5: 0 / 19