제출 #906174

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
906174		Macker	앵무새 (IOI11_parrots)	C++14	34 / 100	2 ms	1320 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")

void encode(int N, int M[])
{
    int len = (1 << 4);
    for (int i = 0; i < N; i++) {
        int a = (2 * i) * len;
        int x = M[i] / len;
        send(x + a);
        a = (2 * i + 1) * len;
        x = M[i] % len;
        send(x + a);
    }
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")

void decode(int N, int L, int X[])
{
    int len = (1 << 4);
    sort(X, X + L);
    for (int i = 0; i < N; i++) {
        int x = (X[i * 2] % len) * len;
        int y = (X[i * 2 + 1] % len);
        output(x + y);
    }
}

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