제출 #756036

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
756036		That_Salamander	앵무새 (IOI11_parrots)	C++14	52 / 100	3 ms	1052 KiB

encoder

#include <bits/stdc++.h>

#define FOR(var,bound) for(int var = 0; var < bound; var++)
#define FORB(var,lb,ub) for (int var = lb; var < ub; var++)
#define FORR(var,bound) for(int var = bound-1; var >= 0; var--)

using namespace std;

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

void send(int x);
void output(int x);

void encode(int n, int m[]) {
    FOR (i, n) {
        send(i * 4 * 4 + (m[i] & 0x3));
        send((i*4+1) * 4 + ((m[i] >> 2) & 0x3));
        send((i*4+2) * 4 + ((m[i] >> 4) & 0x3));
        send((i*4+3) * 4 + ((m[i] >> 6) & 0x3));
    }
}

decoder

#include <bits/stdc++.h>

#define FOR(var,bound) for(int var = 0; var < bound; var++)
#define FORB(var,lb,ub) for (int var = lb; var < ub; var++)
#define FORR(var,bound) for(int var = bound-1; var >= 0; var--)

using namespace std;

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

void send(int x);
void output(int x);

void decode(int N, int L, int X[]) {
    sort(X, X + L);

    FOR (i, N) {
        output((X[i*4]&0x3) + ((X[i*4+1]&0x3)<<2) + ((X[i*4+2]&0x3)<<4) + ((X[i*4+3]&0x3)<<6));
    }
}

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