제출 #286699

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
286699		dolphingarlic	앵무새 (IOI11_parrots)	C++14	컴파일 에러	0 ms	0 KiB

이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.

#include "encoder.h"
#include "encoderlib.h"

struct BigInteger {
  const int LENGTH = 20;
  const long long NUM_SIZE = 1000000000000000LL;

  long long n[20];
  int hid;

  BigInteger(int num) {
    for (int i = LENGTH - 1; i > 0; i--)
      n[i] = 0;
    n[0] = num;
    hid = 1;
  }

  BigInteger() { BigInteger(0); }

  BigInteger &operator=(int &other) {
    n[0] = other;
    hid = 1;
    return *this;
  }

  bool operator<=(const BigInteger &other) {
    if (hid > other.hid)
      return false;
    if (hid < other.hid)
      return true;
    for (int i = hid - 1; i >= 0; i--) {
      if (n[i] > other.n[i])
        return false;
      if (n[i] < other.n[i])
        return true;
    }
    return true;
  }

  bool operator<(const BigInteger &other) {
    if (hid > other.hid)
      return false;
    if (hid < other.hid)
      return true;
    for (int i = hid - 1; i >= 0; i--) {
      if (n[i] > other.n[i])
        return false;
      if (n[i] < other.n[i])
        return true;
    }
    return false;
  }

  BigInteger &operator=(const BigInteger &other) {
    for (int i = 0; i < other.hid; i++) {
      n[i] = other.n[i];
    }
    hid = other.hid;
    return *this;
  }

  BigInteger &operator+(const BigInteger &other) {
    BigInteger *ret = new BigInteger(0);

    long long overflow = 0;
    int mhid = hid > other.hid ? hid : other.hid;
    for (int i = 0; i < mhid; i++) {
      ret->n[i] = overflow;
      if (i < hid)
        ret->n[i] = ret->n[i] + n[i];
      if (i < other.hid)
        ret->n[i] = ret->n[i] + other.n[i];
      overflow = ret->n[i] / NUM_SIZE;
      ret->n[i] %= NUM_SIZE;
    }

    if (overflow > 0) {
      ret->n[mhid++] = overflow;
    }
    ret->hid = mhid;

    return *ret;
  }

  BigInteger &operator-(const BigInteger &other) {
    BigInteger *ret = new BigInteger(0);

    int mhid = hid;

    for (int i = 0; i < mhid; i++) {
      ret->n[i] += n[i] - other.n[i];
      if (ret->n[i] < 0) {
        ret->n[i] += NUM_SIZE;
        ret->n[i + 1]--;
      }
    }

    while (ret->n[mhid - 1] == 0 && mhid > 1) {
      mhid--;
    }

    ret->hid = mhid;

    return *ret;
  }

  BigInteger pow(int p) {
    BigInteger k(n[0]);
    for (int i = 0; i < p; i++) {
      k = k + k;
    }
    return k;
  }

  BigInteger shift8() {

    int mod = 1 << 8;
    int left = 0;

    for (int i = hid - 1; i >= 0; i--) {
      n[i] += left * NUM_SIZE;
      left = n[i] % mod;
      n[i] /= mod;
    }

    while (n[hid - 1] == 0 && hid > 1) {
      hid--;
    }
  }

  void print(char *end) {
    for (int i = hid - 1; i >= 0; i--) {
      if (i == hid - 1)
        printf("%lld", n[i]);
      else
        printf(" %015lld", n[i]);
    }
    printf(" : %d", hid);
    printf(end);
  }
};

BigInteger dp[512][256];

void encode(int N, int M[]) {

  const int N_MAX = 256;

  for (int i = 0; i < N_MAX * 2; i++) {
    for (int j = 0; j < N_MAX; j++) {
      if (i == 0) {
        dp[i][j] = j;
      } else if (i == 1 && j == 0) {
        dp[i][0] = dp[i - 1][N_MAX - 1] + 1;
      } else if (j == 0) {
        dp[i][0] = (dp[i - 1][0] - dp[i - 2][0]) + dp[i - 1][N_MAX - 1];
      } else {
        dp[i][j] = (dp[i - 1][j] - dp[i - 1][0]) + dp[i][j - 1];
      }
    }
  }

  BigInteger num(0);
  for (int i = 0, p = 0; i < N; i++, p++) {
    BigInteger num2(M[i]);
    num = num + num2.pow(i * 8);
  }

  int r, c;
  r = 0, c = 0;
  while (dp[r][c] <= num) {
    if (++c >= N_MAX) {
      c = 0;
      ++r;
    }
  }
  if (--c < 0) {
    c = N_MAX - 1;
    --r;
  }

  num = num - dp[r][c];
  send(c);
  for (--r; r >= 0; --r) {
    num = num + dp[r][0];
    while (num < dp[r][c])
      c--;

    send(c);
    num = num - dp[r][c];
  }
}

#include "decoder.h"
#include "decoderlib.h"

#include <algorithm>
using namespace std;

struct BigInteger {
  const int LENGTH = 20;
  const long long NUM_SIZE = 1000000000000000LL;

  long long n[20];
  int hid;

  BigInteger(int num) {
    for (int i = LENGTH - 1; i > 0; i--)
      n[i] = 0;
    n[0] = num;
    hid = 1;
  }

  BigInteger() { BigInteger(0); }

  BigInteger &operator=(int &other) {
    n[0] = other;
    hid = 1;
    return *this;
  }

  bool operator<=(const BigInteger &other) {
    if (hid > other.hid)
      return false;
    if (hid < other.hid)
      return true;
    for (int i = hid - 1; i >= 0; i--) {
      if (n[i] > other.n[i])
        return false;
      if (n[i] < other.n[i])
        return true;
    }
    return true;
  }

  bool operator<(const BigInteger &other) {
    if (hid > other.hid)
      return false;
    if (hid < other.hid)
      return true;
    for (int i = hid - 1; i >= 0; i--) {
      if (n[i] > other.n[i])
        return false;
      if (n[i] < other.n[i])
        return true;
    }
    return false;
  }

  BigInteger &operator=(const BigInteger &other) {
    for (int i = 0; i < other.hid; i++) {
      n[i] = other.n[i];
    }
    hid = other.hid;
    return *this;
  }

  BigInteger &operator+(const BigInteger &other) {
    BigInteger *ret = new BigInteger(0);

    long long overflow = 0;
    int mhid = hid > other.hid ? hid : other.hid;
    for (int i = 0; i < mhid; i++) {
      ret->n[i] = overflow;
      if (i < hid)
        ret->n[i] = ret->n[i] + n[i];
      if (i < other.hid)
        ret->n[i] = ret->n[i] + other.n[i];
      overflow = ret->n[i] / NUM_SIZE;
      ret->n[i] %= NUM_SIZE;
    }

    if (overflow > 0) {
      ret->n[mhid++] = overflow;
    }
    ret->hid = mhid;

    return *ret;
  }

  BigInteger &operator-(const BigInteger &other) {
    BigInteger *ret = new BigInteger(0);

    int mhid = hid;

    for (int i = 0; i < mhid; i++) {
      ret->n[i] += n[i] - other.n[i];
      if (ret->n[i] < 0) {
        ret->n[i] += NUM_SIZE;
        ret->n[i + 1]--;
      }
    }

    while (ret->n[mhid - 1] == 0 && mhid > 1) {
      mhid--;
    }

    ret->hid = mhid;

    return *ret;
  }

  BigInteger pow(int p) {
    BigInteger k(n[0]);
    for (int i = 0; i < p; i++) {
      k = k + k;
    }
    return k;
  }

  BigInteger shift8() {

    int mod = 1 << 8;
    int left = 0;

    for (int i = hid - 1; i >= 0; i--) {
      n[i] += left * NUM_SIZE;
      left = n[i] % mod;
      n[i] /= mod;
    }

    while (n[hid - 1] == 0 && hid > 1) {
      hid--;
    }
  }

  void print(char *end) {
    for (int i = hid - 1; i >= 0; i--) {
      if (i == hid - 1)
        printf("%lld", n[i]);
      else
        printf(" %015lld", n[i]);
    }
    printf(" : %d", hid);
    printf(end);
  }
};

BigInteger dp[512][256];

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

  const int N_MAX = 256;

  for (int i = 0; i < N_MAX * 2; i++) {
    for (int j = 0; j < N_MAX; j++) {
      if (i == 0) {
        dp[i][j] = j;
      } else if (i == 1 && j == 0) {
        dp[i][0] = dp[i - 1][N_MAX - 1] + 1;
      } else if (j == 0) {
        dp[i][0] = (dp[i - 1][0] - dp[i - 2][0]) + dp[i - 1][N_MAX - 1];
      } else {
        dp[i][j] = (dp[i - 1][j] - dp[i - 1][0]) + dp[i][j - 1];
      }
    }
  }

  sort(X, X + L);
  reverse(X, X + L);

  BigInteger num = 0;
  int r = L - 1;
  for (int i = 0; i < L; i++, r--) {
    if (i == 0) {
      num = num + dp[r][X[i]];
    } else {
      num = num + dp[r][X[i]] - dp[r][0];
    }
  }

  for (int i = 0; i < N; i++) {
    output(num.n[0] & 0xff);
    num.shift8();
  }
}

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

encoder.cpp: In member function 'BigInteger BigInteger::shift8()':
encoder.cpp:129:3: warning: no return statement in function returning non-void [-Wreturn-type]
  129 |   }
      |   ^
encoder.cpp: In member function 'void BigInteger::print(char*)':
encoder.cpp:134:9: error: 'printf' was not declared in this scope
  134 |         printf("%lld", n[i]);
      |         ^~~~~~
encoder.cpp:3:1: note: 'printf' is defined in header '<cstdio>'; did you forget to '#include <cstdio>'?
    2 | #include "encoderlib.h"
  +++ |+#include <cstdio>
    3 | 
encoder.cpp:136:9: error: 'printf' was not declared in this scope
  136 |         printf(" %015lld", n[i]);
      |         ^~~~~~
encoder.cpp:136:9: note: 'printf' is defined in header '<cstdio>'; did you forget to '#include <cstdio>'?
encoder.cpp:138:5: error: 'printf' was not declared in this scope
  138 |     printf(" : %d", hid);
      |     ^~~~~~
encoder.cpp:138:5: note: 'printf' is defined in header '<cstdio>'; did you forget to '#include <cstdio>'?

decoder.cpp: In member function 'BigInteger BigInteger::shift8()':
decoder.cpp:132:3: warning: no return statement in function returning non-void [-Wreturn-type]
  132 |   }
      |   ^
decoder.cpp: In member function 'void BigInteger::print(char*)':
decoder.cpp:137:9: error: 'printf' was not declared in this scope
  137 |         printf("%lld", n[i]);
      |         ^~~~~~
decoder.cpp:5:1: note: 'printf' is defined in header '<cstdio>'; did you forget to '#include <cstdio>'?
    4 | #include <algorithm>
  +++ |+#include <cstdio>
    5 | using namespace std;
decoder.cpp:139:9: error: 'printf' was not declared in this scope
  139 |         printf(" %015lld", n[i]);
      |         ^~~~~~
decoder.cpp:139:9: note: 'printf' is defined in header '<cstdio>'; did you forget to '#include <cstdio>'?
decoder.cpp:141:5: error: 'printf' was not declared in this scope
  141 |     printf(" : %d", hid);
      |     ^~~~~~
decoder.cpp:141:5: note: 'printf' is defined in header '<cstdio>'; did you forget to '#include <cstdio>'?