제출 #118312

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

encoder

#include "encoder.h"
#include <bits/stdc++.h>
#include "encoderlib.h"

using namespace std;

#define rep(i, j, k) for (int i = j; i < (int)k; i++)

typedef long long ll;

constexpr int N = 150 * 1000 + 10;

const int LEN = (1 << 8);

typedef array<int, LEN> sagy;

sagy operator+(sagy l, sagy r) {
  sagy res;
  bool cary = false;
  rep(i, 0, LEN) {
    ll tmp = 1ll * l[i] + r[i] + (cary ? 1 : 0);
    res[i] = tmp & ((1l << 32) - 1);
    cary = tmp >> 32;
  }
  assert(!cary);
  return res;
}

bool operator<(sagy l, sagy r) {
  for (int i = LEN - 1; ~i; i--) {
    int tmp = l[i] ^ r[i];
    if (tmp) {
      for (int j = 31;; j--) {
        if ((tmp >> j) & 1) return (r[i] >> j) & 1;
      }
    }
  }
  return false;
}

const int L = 257;
const int R = L + 64 * 5;
sagy c[L][R];

inline void init() {
  rep(i, 0, R) {
    c[0][i][0] = true;
    if (i < L) c[i][i][0] = true;
    rep(j, 1, min(i, L)) c[j][i] = c[j - 1][i - 1] + c[j][i - 1];
  }
}

int cnt[L];

void encode(int N, int M[]) {
  init();
  return;
  sagy code;
  rep(i, 0, N) rep(j, 0, 8) code[(i << 3) + j] = (M[i] >> j) & 1;
  sagy ta_hala;
  int have = 5 * N;
  for (int i = 255; ~i; i--) {
    while (true) {
      sagy ta_alan = ta_hala;
      have--;
      cnt[i]++;
      ta_alan = ta_alan + c[i][have + i];
      if (code < ta_alan) {
        have++;
        cnt[i]--;
        break;
      }
      ta_hala = ta_alan;
    }
  }
  rep(i, 0, 256) rep(j, 0, cnt[i]) send(i);
}

decoder

#include "decoder.h"
#include <bits/stdc++.h>
#include "decoderlib.h"

using namespace std;

#define rep(i, j, k) for (int i = j; i < (int)k; i++)

typedef long long ll;

constexpr int N = 150 * 1000 + 10;

const int LEN = (1 << 8);

typedef array<int, LEN> sagy;

sagy operator+(sagy l, sagy r) {
  sagy res;
  bool cary = false;
  rep(i, 0, LEN) {
    ll tmp = 1ll * l[i] + r[i] + (cary ? 1 : 0);
    res[i] = tmp & ((1l << 32) - 1);
    cary = tmp >> 32;
  }
  assert(!cary);
  return res;
}

bool operator<(sagy l, sagy r) {
  for (int i = LEN - 1; ~i; i--) {
    int tmp = l[i] ^ r[i];
    if (tmp) {
      for (int j = 31;; j--) {
        if ((tmp >> j) & 1) return (r[i] >> j) & 1;
      }
    }
  }
  return false;
}

const int L = 257;
const int R = L + 64 * 5;
sagy c[L][R];

inline void init() {
  rep(i, 0, R) {
    c[0][i][0] = true;
    if (i < L) c[i][i][0] = true;
    rep(j, 1, min(i, L)) c[j][i] = c[j - 1][i - 1] + c[j][i - 1];
  }
}

int cnt[L];

void decode(int N, int L, int X[]) {
  return;
  init();
  rep(i, 0, L) cnt[X[i]]++;
  sagy code;
  int have = 5 * N;
  for (int i = 255; ~i; i--) {
    while (cnt[i] > 1) {
      code = code + c[i][have + i];
      have--;
      cnt[i]--;
    }
    have--;
  }
  code = code + c[0][0];
  rep(i, 0, N) {
    int res = 0;
    rep(j, 0, 8) if (code[(i << 3) + j]) res += (1 << j);
    output(res);
  }
}

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