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

提出ソース

結果

問題	No.2595 Parsing Challenge
ユーザー	👑 Nachia
提出日時	2023-12-23 01:57:37
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	871 ms / 6,000 ms
コード長	18,124 bytes
コンパイル時間	3,258 ms
コンパイル使用メモリ	163,972 KB
実行使用メモリ	56,400 KB
最終ジャッジ日時	2023-12-23 01:57:56
合計ジャッジ時間	18,832 ms
ジャッジサーバーID （参考情報）	judge15 / judge14

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,548 KB
testcase_01	AC	3 ms 6,548 KB
testcase_02	AC	2 ms 6,548 KB
testcase_03	AC	2 ms 6,548 KB
testcase_04	AC	2 ms 6,548 KB
testcase_05	AC	2 ms 6,548 KB
testcase_06	AC	2 ms 6,548 KB
testcase_07	AC	2 ms 6,548 KB
testcase_08	AC	2 ms 6,548 KB
testcase_09	AC	2 ms 6,548 KB
testcase_10	AC	2 ms 6,548 KB
testcase_11	AC	3 ms 6,548 KB
testcase_12	AC	2 ms 6,548 KB
testcase_13	AC	2 ms 6,548 KB
testcase_14	AC	2 ms 6,548 KB
testcase_15	AC	2 ms 6,548 KB
testcase_16	AC	2 ms 6,548 KB
testcase_17	AC	2 ms 6,548 KB
testcase_18	AC	2 ms 6,548 KB
testcase_19	AC	2 ms 6,548 KB
testcase_20	AC	6 ms 6,548 KB
testcase_21	AC	6 ms 6,548 KB
testcase_22	AC	6 ms 6,548 KB
testcase_23	AC	5 ms 6,548 KB
testcase_24	AC	6 ms 6,548 KB
testcase_25	AC	34 ms 7,584 KB
testcase_26	AC	43 ms 11,276 KB
testcase_27	AC	39 ms 7,584 KB
testcase_28	AC	39 ms 7,584 KB
testcase_29	AC	39 ms 7,584 KB
testcase_30	AC	372 ms 55,916 KB
testcase_31	AC	359 ms 55,916 KB
testcase_32	AC	368 ms 55,916 KB
testcase_33	AC	367 ms 55,916 KB
testcase_34	AC	348 ms 55,916 KB
testcase_35	AC	871 ms 32,428 KB
testcase_36	AC	841 ms 32,428 KB
testcase_37	AC	869 ms 32,428 KB
testcase_38	AC	863 ms 32,428 KB
testcase_39	AC	840 ms 32,428 KB
testcase_40	AC	19 ms 8,840 KB
testcase_41	AC	19 ms 8,840 KB
testcase_42	AC	18 ms 8,840 KB
testcase_43	AC	9 ms 6,548 KB
testcase_44	AC	222 ms 31,336 KB
testcase_45	AC	222 ms 31,336 KB
testcase_46	AC	224 ms 31,336 KB
testcase_47	AC	226 ms 31,336 KB
testcase_48	AC	224 ms 31,336 KB
testcase_49	AC	512 ms 31,336 KB
testcase_50	AC	515 ms 31,336 KB
testcase_51	AC	514 ms 31,336 KB
testcase_52	AC	473 ms 55,916 KB
testcase_53	AC	479 ms 55,916 KB
testcase_54	AC	486 ms 55,916 KB
testcase_55	AC	505 ms 55,916 KB
testcase_56	AC	473 ms 55,916 KB
testcase_57	AC	478 ms 56,400 KB
testcase_58	AC	484 ms 56,400 KB
testcase_59	AC	512 ms 56,400 KB

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

ソースコード

raw source code

#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif

#include <vector>
#include <string>
#include <atcoder/convolution>
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];
  }

   // new function
    void negate(){
        if (!empty()) neg = !neg;
    }
};
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;
}


#include <iostream>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
#include <atcoder/modint>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<(i64)(n); i++)
#define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = priority_queue<A,vector<A>,greater<A>>;
//using Modint = atcoder::static_modint<998244353>;

#include <iterator>
#include <functional>

template<class Elem> struct vec;

template<class Iter>
struct seq_view{
    using Ref = typename std::iterator_traits<Iter>::reference;
    using Elem = typename std::iterator_traits<Iter>::value_type;
    Iter a, b;
    Iter begin() const { return a; }
    Iter end() const { return b; }
    int size() const { return (int)(b-a); }
    seq_view(Iter first, Iter last) : a(first), b(last) {}
    seq_view sort() const { std::sort(a, b); return *this; }
    Ref& operator[](int x){ return *(a+x); }
    template<class F = std::less<Elem>, class ret = vec<int>> ret sorti(F f = F()) const {
        ret x(size()); for(int i=0; i<size(); i++) x[i] = i;
        x().sort([&](int l, int r){ return f(a[l],a[r]); });
        return x;
    }
    template<class ret = vec<Elem>> ret col() const { return ret(begin(), end()); }
    template<class F = std::equal_to<Elem>, class ret = vec<std::pair<Elem, int>>>
    ret rle(F eq = F()) const {
        auto x = ret();
        for(auto& a : (*this)){
            if(x.size() == 0 || !eq(x[x.size()-1].first, a)) x.emp(a, 1); else x[x.size()-1].second++;
        } return x;
    }
    template<class F> seq_view sort(F f) const { std::sort(a, b, f); return *this; }
    Iter uni() const { return std::unique(a, b); }
    Iter lb(const Elem& x) const { return std::lower_bound(a, b, x); }
    Iter ub(const Elem& x) const { return std::upper_bound(a, b, x); }
    int lbi(const Elem& x) const { return lb(x) - a; }
    int ubi(const Elem& x) const { return ub(x) - a; }
    seq_view bound(const Elem& l, const Elem& r) const { return { lb(l), lb(r) }; }
    template<class F> Iter lb(const Elem& x, F f) const { return std::lower_bound(a, b, x, f); }
    template<class F> Iter ub(const Elem& x, F f) const { return std::upper_bound(a, b, x, f); }
    template<class F> Iter when_true_to_false(F f) const {
        if(a == b) return a;
        return std::lower_bound(a, b, *a,
            [&](const Elem& x, const Elem&){ return f(x); });
    }
    seq_view same(Elem x) const { return { lb(x), ub(x) }; }
    template<class F> auto map(F f) const {
        vec<typename Iter::value_type> r;
        for(auto& x : *this) r.emp(f(x));
        return r;
    }
    Iter max() const { return std::max_element(a, b); }
    Iter min() const { return std::min_element(a, b); }
    template<class F = std::less<Elem>>
    Iter min(F f) const { return std::min_element(a, b, f); }
    seq_view rev() const { std::reverse(a, b); return *this; }
};

template<class Elem>
struct vec {
    using Base = typename std::vector<Elem>;
    using Iter = typename Base::iterator;
    using CIter = typename Base::const_iterator;
    using View = seq_view<Iter>;
    using CView = seq_view<CIter>;

    vec(){}
    explicit vec(int n, const Elem& value = Elem()) : a(0<n?n:0, value) {}
    template <class I2> vec(I2 first, I2 last) : a(first, last) {}
    vec(std::initializer_list<Elem> il) : a(std::move(il)) {}
    vec(Base b) : a(std::move(b)) {}
    operator Base() const { return a; }

    Iter begin(){ return a.begin(); }
    CIter begin() const { return a.begin(); }
    Iter end(){ return a.end(); }
    CIter end() const { return a.end(); }
    int size() const { return a.size(); }
    bool empty() const { return a.empty(); }
    Elem& back(){ return a.back(); }
    const Elem& back() const { return a.back(); }
    vec sortunied(){ vec x = *this; x().sort(); x.a.erase(x().uni(), x.end()); return x; }
    Iter operator()(int x){ return a.begin() + x; }
    CIter operator()(int x) const { return a.begin() + x; }
    View operator()(int l, int r){ return { (*this)(l), (*this)(r) }; }
    CView operator()(int l, int r) const { return { (*this)(l), (*this)(r) }; }
    View operator()(){ return (*this)(0,size()); }
    CView operator()() const { return (*this)(0,size()); }
    Elem& operator[](int x){ return a[x]; }
    const Elem& operator[](int x) const { return a[x]; }
    Base& operator*(){ return a; }
    const Base& operator*() const { return a; }
    vec& push(Elem args){
        a.push_back(std::move(args));
        return *this;
    }
    template<class... Args>
    vec& emp(Args &&... args){
        a.emplace_back(std::forward<Args>(args) ...);
        return *this;
    }
    template<class Range>
    vec& app(Range& x){ for(auto& v : a) emp(v); }
    Elem pop(){
        Elem x = std::move(a.back());
        a.pop_back(); return x;
    }
    bool operator==(const vec& r) const { return a == r.a; }
    bool operator!=(const vec& r) const { return a != r.a; }
    bool operator<(const vec& r) const { return a < r.a; }
    bool operator<=(const vec& r) const { return a <= r.a; }
    bool operator>(const vec& r) const { return a > r.a; }
    bool operator>=(const vec& r) const { return a >= r.a; }
    vec<vec<Elem>> pile(int n) const { return vec<vec<Elem>>(n, *this); }
    template<class F> vec& filter(F f){
        int p = 0;
        for(int q=0; q<size(); q++) if(f(a[q])) std::swap(a[p++],a[q]);
        a.resize(p); return *this;
    }
private: Base a;
};

template<class IStr, class U, class T>
IStr& operator>>(IStr& is, vec<std::pair<U,T>>& v){ for(auto& x:v){ is >> x.first >> x.second; } return is; }
template<class IStr, class T>
IStr& operator>>(IStr& is, vec<T>& v){ for(auto& x:v){ is >> x; } return is; }
template<class OStr, class T>
OStr& operator<<(OStr& os, const vec<T>& v){
    for(int i=0; i<v.size(); i++){
        if(i){ os << ' '; } os << v[i];
    } return os;
}
using Modint = atcoder::modint;

struct Node {
    string op;
    int c0;
    int c1;
    int w;
};

void testcase(){
    int N; cin >> N;
    string S; cin >> S;
    vec<int> X;
    vec<Node> F;
    vec<char> O;
    O.push('(');
    S.push_back(')');
    size_t ptr = 0;
    auto remove_prev = [&](){
        switch(O.back()){
        case '(' :
            break;
        case '_' :
            F.push({ "_", X.back(), -1, F[X.back()].w });
            X.back() = F.size() - 1;
            break;
        case '-' :
            F.push({ "_", X.back(), -1, F[X.back()].w });
            X.back() = F.size() - 1;
        case '+' : {
            int a = X.back(); X.pop();
            int b = X.back(); X.pop();
            F.push({ "+", b, a, max(F[a].w, F[b].w) + 1 });
            X.push(F.size() - 1);
        } break;
        case '*' : {
            int a = X.back(); X.pop();
            int b = X.back(); X.pop();
            F.push({ "*", b, a, F[a].w + F[b].w });
            X.push(F.size() - 1);
        } break;
        }
        O.pop();
    };
    int exp_exist = 0;
    while(ptr < N){
        if(S[ptr] == '('){
            O.push('(');
            exp_exist = 0;
            ptr++;
        }
        else if(S[ptr] == '+'){
            while(string("*+-_").find(O.back()) != string::npos) remove_prev();
            O.push('+');
            exp_exist = 0;
            ptr++;
        }
        else if(exp_exist && S[ptr] == '-'){
            while(string("*+-_").find(O.back()) != string::npos) remove_prev();
            O.push('-');
            exp_exist = 0;
            ptr++;
        }
        else if(S[ptr] == '*'){
            while(string("_").find(O.back()) != string::npos) remove_prev();
            O.push('*');
            exp_exist = 0;
            ptr++;
        }
        else if(S[ptr] == ')'){
            while(O.back() != '(') remove_prev();
            O.pop();
            exp_exist = 1;
            ptr++;
        }
        else if(S[ptr] == '-'){
            O.push('_');
            ptr++;
        }
        else {
            int lp = ptr;
            while('0' <= S[ptr] && S[ptr] <= '9') ptr++;
            X.push(F.size());
            F.push({ S.substr(lp, ptr-lp), -1, -1, (int)ptr-lp+1 });
            exp_exist = 1;
        }
    }
    while(O.back() != '(') remove_prev();
    rep(p,F.size()) if(0 <= F[p].c1 && F[F[p].c0].w < F[F[p].c1].w) swap(F[p].c0, F[p].c1);
    /*
    auto calc = [&](auto& calc, int p) -> bigint {
        if(F[p].c0 == -1){
            return bigint(move(F[p].op));
        }
        if(F[p].op[0] == '_'){
            auto f = calc(calc, F[p].c0);
            f.negate();
            return f;
        }
        if(F[p].op[0] == '+'){
            auto f = calc(calc, F[p].c0);
            auto g = calc(calc, F[p].c1);
            f += g;
            return f;
        }
        if(F[p].op[0] == '*'){
            auto f = calc(calc, F[p].c0);
            auto g = calc(calc, F[p].c1);
            f *= g;
            return f;
        }
    };
    */
    auto calc = [&](auto& calc, int p, int q) -> pair< bigint, bigint > {
        if(p == q){
            if(F[p].c0 == -1) return make_pair(bigint(move(F[p].op)), bigint());
            if(F[p].c1 == -1){
                auto a = move(calc(calc, F[p].c0, F[p].c0).first);
                a.negate();
                return make_pair(move(a), bigint());
            }
            int minz = F[p].w / 2;
            while(F[q].c0 >= 0 && F[q].w >= minz) q = F[q].c0;
            auto x = move(calc(calc, q, q).first);
            auto f = calc(calc, p, q);
            return make_pair(x * f.first + f.second, bigint());
        }
        if(F[p].c1 < 0){
            if(F[p].c0 == q) return make_pair(bigint(-1), bigint());
            auto f = calc(calc, F[p].c0, q);
            f.first.negate();
            f.second.negate();
            return f;
        }
        if(F[p].c0 == q){
            auto a = move(calc(calc, F[p].c1, F[p].c1).first);
            if(F[p].op[0] == '*'){
                return make_pair(move(a), bigint());
            }
            if(F[p].op[0] == '+'){
                return make_pair(bigint(1), move(a));
            }
        }
        int dep = 0; { int pp = p; while(pp != q){ dep++; pp = F[pp].c0; } }
        int m = p; rep(i,dep/2) m = F[m].c0;
        auto [a,b] = calc(calc, m, q);
        auto [c,d] = calc(calc, p, m);
        return make_pair(a*c, b*c+d);
    };
    cout << calc(calc, X.back(), X.back()).first << endl;
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    #ifdef NACHIA
    int T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)
    #endif
    testcase();
    return 0;
}

yukicoder

結果

テストケース

ソースコード