#939896 (C++17) No.2595 Parsing Challenge

提出ソース

結果

問題	No.2595 Parsing Challenge
ユーザー	ei1333333
提出日時	2023-12-23 01:45:52
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	TLE
実行時間	-
コード長	8,894 bytes
コンパイル時間	5,553 ms
コンパイル使用メモリ	280,640 KB
実行使用メモリ	262,292 KB
最終ジャッジ日時	2024-09-27 11:58:19
合計ジャッジ時間	32,903 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	2 ms 6,940 KB
testcase_13	AC	2 ms 6,940 KB
testcase_14	AC	2 ms 6,944 KB
testcase_15	AC	2 ms 6,944 KB
testcase_16	AC	2 ms 6,944 KB
testcase_17	AC	2 ms 6,940 KB
testcase_18	AC	2 ms 6,944 KB
testcase_19	AC	2 ms 6,940 KB
testcase_20	AC	3 ms 6,940 KB
testcase_21	AC	3 ms 6,940 KB
testcase_22	AC	4 ms 6,944 KB
testcase_23	AC	3 ms 6,940 KB
testcase_24	AC	3 ms 6,940 KB
testcase_25	AC	17 ms 6,944 KB
testcase_26	AC	19 ms 6,940 KB
testcase_27	AC	18 ms 6,940 KB
testcase_28	AC	18 ms 6,944 KB
testcase_29	AC	18 ms 6,940 KB
testcase_30	AC	155 ms 6,940 KB
testcase_31	AC	160 ms 6,940 KB
testcase_32	AC	164 ms 6,940 KB
testcase_33	AC	157 ms 6,944 KB
testcase_34	AC	159 ms 6,940 KB
testcase_35	AC	745 ms 29,892 KB
testcase_36	AC	739 ms 30,044 KB
testcase_37	AC	740 ms 30,008 KB
testcase_38	AC	733 ms 30,448 KB
testcase_39	AC	745 ms 29,448 KB
testcase_40	AC	40 ms 7,852 KB
testcase_41	AC	39 ms 7,852 KB
testcase_42	AC	40 ms 7,728 KB
testcase_43	AC	291 ms 262,292 KB
testcase_44	AC	116 ms 6,940 KB
testcase_45	AC	114 ms 6,940 KB
testcase_46	AC	112 ms 6,944 KB
testcase_47	AC	112 ms 6,940 KB
testcase_48	AC	115 ms 6,940 KB
testcase_49	AC	479 ms 8,592 KB
testcase_50	AC	472 ms 8,596 KB
testcase_51	AC	483 ms 8,852 KB
testcase_52	AC	2,301 ms 9,996 KB
testcase_53	AC	2,313 ms 9,996 KB
testcase_54	AC	2,303 ms 9,872 KB
testcase_55	AC	2,311 ms 10,004 KB
testcase_56	AC	2,336 ms 9,748 KB
testcase_57	TLE	-
testcase_58	--	-
testcase_59	--	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;

const int DIGIT = 6;
const int BASE = 1000000;
struct positive_bigint {
  std::vector<int> d;
  positive_bigint() {
  }
  positive_bigint(long long X) {
    while (X > 0) {
      d.push_back(X % BASE);
      X /= BASE;
    }
  }
  positive_bigint(std::string S) {
    if (S == "0") {
      S = "";
    }
    int L = S.size();
    d.resize((L + DIGIT - 1) / DIGIT, 0);
    for (int i = L - 1; i >= 0; i -= 6) {
      for (int j = std::max(i - 5, 0); j <= i; j++) {
        d[i / DIGIT] *= 10;
        d[i / DIGIT] += S[j] - '0';
      }
    }
    std::reverse(d.begin(), d.end());
  }
  bool empty() const {
    return d.empty();
  }
  int size() const {
    return d.size();
  }
  int &operator[](int i) {
    return d[i];
  }
  int operator[](int i) const {
    return d[i];
  }
};
std::string to_string(const positive_bigint &A) {
  int N = A.size();
  std::string ans;
  for (int i = N - 1; i >= 0; i--) {
    std::string tmp = std::to_string(A[i]);
    if (i < N - 1) {
      ans += std::string(DIGIT - tmp.size(), '0');
    }
    ans += tmp;
  }
  if (ans.empty()) {
    ans = "0";
  }
  return ans;
}
std::istream &operator>>(std::istream &is, positive_bigint &A) {
  std::string S;
  is >> S;
  A = positive_bigint(S);
  return is;
}
std::ostream &operator<<(std::ostream &os, positive_bigint &A) {
  os << to_string(A);
  return os;
}
int cmp(const positive_bigint &A, const positive_bigint &B) {
  int N = A.size();
  int M = B.size();
  if (N < M) {
    return -1;
  } else if (N > M) {
    return 1;
  } else {
    for (int i = N - 1; i >= 0; i--) {
      if (A[i] < B[i]) {
        return -1;
      }
      if (A[i] > B[i]) {
        return 1;
      }
    }
    return 0;
  }
}
bool operator==(const positive_bigint &A, const positive_bigint &B) {
  return cmp(A, B) == 0;
}
bool operator!=(const positive_bigint &A, const positive_bigint &B) {
  return cmp(A, B) != 0;
}
bool operator<(const positive_bigint &A, const positive_bigint &B) {
  return cmp(A, B) < 0;
}
bool operator>(const positive_bigint &A, const positive_bigint &B) {
  return cmp(A, B) > 0;
}
bool operator<=(const positive_bigint &A, const positive_bigint &B) {
  return cmp(A, B) <= 0;
}
bool operator>=(const positive_bigint &A, const positive_bigint &B) {
  return cmp(A, B) >= 0;
}
positive_bigint &operator+=(positive_bigint &A, const positive_bigint &B) {
  int N = A.size();
  int M = B.size();
  while (N < M) {
    A.d.push_back(0);
    N++;
  }
  for (int i = 0; i < M; i++) {
    A[i] += B[i];
  }
  for (int i = 0; i < N - 1; i++) {
    if (A[i] >= BASE) {
      A[i] -= BASE;
      A[i + 1]++;
    }
  }
  if (N > 0) {
    if (A[N - 1] >= BASE) {
      A.d.push_back(1);
      A[N - 1] -= BASE;
    }
  }
  return A;
}
positive_bigint operator+(const positive_bigint &A, const positive_bigint &B) {
  positive_bigint A2 = A;
  A2 += B;
  return A2;
}
positive_bigint &operator-=(positive_bigint &A, const positive_bigint &B) {
  int N = A.size();
  int M = B.size();
  for (int i = 0; i < M; i++) {
    A[i] -= B[i];
  }
  for (int i = 0; i < N - 1; i++) {
    if (A[i] < 0) {
      A[i] += BASE;
      A[i + 1]--;
    }
  }
  while (!A.empty()) {
    if (A.d.back() == 0) {
      A.d.pop_back();
    } else {
      break;
    }
  }
  return A;
}
positive_bigint operator-(const positive_bigint &A, const positive_bigint &B) {
  positive_bigint A2 = A;
  A2 -= B;
  return A2;
}
positive_bigint operator*(const positive_bigint &A, const positive_bigint &B) {
  if (A.empty() || B.empty()) {
    return 0;
  }
  int N = A.size();
  int M = B.size();
  std::vector<long long> a(N);
  for (int i = 0; i < N; i++) {
    a[i] = A[i];
  }
  std::vector<long long> b(M);
  for (int i = 0; i < M; i++) {
    b[i] = B[i];
  }
  std::vector<long long> C = atcoder::convolution_ll(a, b);
  for (int i = 0; i < N + M - 2; i++) {
    C[i + 1] += C[i] / BASE;
    C[i] %= BASE;
  }
  if (C[N + M - 2] >= BASE) {
    C.resize(N + M);
    C[N + M - 1] += C[N + M - 2] / BASE;
    C[N + M - 2] %= BASE;
  }
  positive_bigint ans;
  ans.d.resize(C.size());
  for (int i = 0; i < C.size(); i++) {
    ans[i] = C[i];
  }
  return ans;
}
positive_bigint operator*=(positive_bigint &A, const positive_bigint &B) {
  A = A * B;
  return A;
}
struct bigint {
  bool neg = false;
  positive_bigint a;
  bigint() {
  }
  bigint(long long X) : neg(X < 0), a(abs(X)) {
  }
  bigint(const positive_bigint &X, bool neg = false) : neg(neg), a(X) {
  }
  bigint(const std::string &s) {
    if (!s.empty()) {
      if (s[0] == '-') {
        neg = true;
        a = positive_bigint(s.substr(1, s.size() - 1));
      } else {
        a = positive_bigint(s);
      }
    }
  }
  bool empty() const {
    return a.empty();
  }
  int size() const {
    return a.size();
  }
  int &operator[](int i) {
    return a[i];
  }
};
std::string to_string(const bigint &A) {
  std::string ans;
  if (A.neg) {
    ans += '-';
  }
  ans += to_string(A.a);
  return ans;
}
std::istream &operator>>(std::istream &is, bigint &A) {
  std::string S;
  is >> S;
  if (S != "0") {
    A = bigint(S);
  }
  return is;
}
std::ostream &operator<<(std::ostream &os, bigint A) {
  os << to_string(A);
  return os;
}
positive_bigint abs(const bigint &A) {
  return A.a;
}
int cmp(const bigint &A, const bigint &B) {
  if (!A.neg) {
    if (!B.neg) {
      return cmp(A.a, B.a);
    } else {
      return 1;
    }
  } else {
    if (!B.neg) {
      return -1;
    } else {
      return cmp(B.a, A.a);
    }
  }
}
bool operator==(const bigint &A, const bigint &B) {
  return cmp(A, B) == 0;
}
bool operator!=(const bigint &A, const bigint &B) {
  return cmp(A, B) != 0;
}
bool operator<(const bigint &A, const bigint &B) {
  return cmp(A, B) < 0;
}
bool operator>(const bigint &A, const bigint &B) {
  return cmp(A, B) > 0;
}
bool operator<=(const bigint &A, const bigint &B) {
  return cmp(A, B) <= 0;
}
bool operator>=(const bigint &A, const bigint &B) {
  return cmp(A, B) >= 0;
}
bigint operator+(const bigint &A) {
  return A;
}
bigint operator-(const bigint &A) {
  bigint A2 = A;
  if (!A2.empty()) {
    A2.neg = !A2.neg;
  }
  return A2;
}
bigint &operator+=(bigint &A, const bigint &B) {
  if (A.neg == B.neg) {
    A.a += B.a;
  } else {
    int c = cmp(A.a, B.a);
    if (c > 0) {
      A.a -= B.a;
    } else if (c < 0) {
      A.a = B.a - A.a;
      A.neg = !A.neg;
    } else {
      A = 0;
    }
  }
  return A;
}
bigint operator+(const bigint &A, const bigint &B) {
  bigint A2 = A;
  A2 += B;
  return A2;
}
bigint &operator-=(bigint &A, const bigint &B) {
  if (A.neg != B.neg) {
    A.a += B.a;
  } else {
    int c = cmp(A.a, B.a);
    if (c > 0) {
      A.a -= B.a;
    } else if (c < 0) {
      A.a = B.a - A.a;
      A.neg = !A.neg;
    } else {
      A = 0;
    }
  }
  return A;
}
bigint operator-(const bigint &A, const bigint &B) {
  bigint A2 = A;
  A2 -= B;
  return A2;
}
bigint operator*=(bigint &A, const bigint &B) {
  if (A.empty() || B.empty()) {
    A = 0;
  } else {
    if (B.neg) {
      A.neg = !A.neg;
    }
    A.a *= B.a;
  }
  return A;
}
bigint operator*(const bigint &A, const bigint &B)  {
  bigint A2 = A;
  A2 *= B;
  return A2;
}

bigint expression();
bigint number();
bigint factor();
bigint term();

string S;
int P;

bigint number() {
  bool sign = true;
  while (S[P] == '-') {
    sign ^= 1;
    ++P;
  }
  string num;
  if (not sign) num += "-";
  while (isdigit(S[P])) {
    num += S[P++];
  }
  return move(bigint(num));
}

bigint factor() {
  if (S[P] == '(') {
    ++P;
    bigint res = expression();
    ++P;
    return move(res);
  } else {
    return move(number());
  }
}

bigint term() {
  vector< bigint > res;
  res.emplace_back(factor());
  while (S[P] == '*') {
    ++P;
    res.emplace_back(factor());
  }
  using pi = pair< int, int >;
  priority_queue< pi, vector< pi >, greater<> > que;
  for(int i = 0; i < res.size(); i++) {
    que.emplace(res[i].size(), i);
  }
  while(que.size() >= 2) {
    auto f = que.top();
    que.pop();
    auto g = que.top();
    que.pop();
    res[g.second] *= res[f.second];
    que.emplace(res[g.second].size(), g.second);
  }
  return move(res[que.top().second]);
}

bigint expression() {
  vector< bigint > res;
  res.emplace_back(term());
  while (S[P] == '+' or S[P] == '-') {
    if (S[P++] == '+') {
      res.emplace_back(term());
    } else {
      res.emplace_back(-term());
    }
  }

  using pi = pair< int, int >;
  priority_queue< pi, vector< pi >, greater<> > que;
  for(int i = 0; i < res.size(); i++) {
    que.emplace(res[i].size(), i);
  }
  while(que.size() >= 2) {
    auto f = que.top();
    que.pop();
    auto g = que.top();
    que.pop();
    res[g.second] += res[f.second];
    que.emplace(res[g.second].size(), g.second);
  }
  return move(res[que.top().second]);
}

int main() {
  int N;
  cin >> N;
  cin >> S;
  S += "$";
  cout << expression() << endl;
}

yukicoder

結果

テストケース

ソースコード