結果
問題 | No.2595 Parsing Challenge |
ユーザー |
|
提出日時 | 2023-12-23 03:14:18 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 14,427 bytes |
コンパイル時間 | 5,104 ms |
コンパイル使用メモリ | 262,048 KB |
最終ジャッジ日時 | 2025-02-18 13:37:22 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 30 TLE * 1 -- * 24 |
ソースコード
#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];}};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;}#ifndef HIDDEN_IN_VS // 折りたたみ用// 警告の抑制#define _CRT_SECURE_NO_WARNINGS// ライブラリの読み込み#include <bits/stdc++.h>using namespace std;// 型名の短縮using ll = long long; using ull = unsigned long long; // -2^63 ~ 2^63 = 9 * 10^18(int は -2^31 ~ 2^31 = 2 * 10^9)using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;using Graph = vvi;// 定数の定義const double PI = acos(-1);const vi DX = { 1, 0, -1, 0 }; // 4 近傍(下,右,上,左)const vi DY = { 0, 1, 0, -1 };int INF = 1001001001; ll INFL = 4004004003104004004LL; // (int)INFL = 1010931620;// 入出力高速化struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;// 汎用マクロの定義#define all(a) (a).begin(), (a).end()#define sz(x) ((int)(x).size())#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}#define YES(b) {cout << ((b) ? "YES\n" : "NO\n");}#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順#define repe(v, a) for(const auto& v : (a)) // a の全要素(変更不可能)#define repea(v, a) for(auto& v : (a)) // a の全要素(変更可能)#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d ビット全探索(昇順)#define repis(i, set) for(int i = lsb(set), bset##i = set; i >= 0; bset##i -= 1 << i, i = lsb(bset##i)) // set の全要素(昇順)#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て(昇順)#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) // 矩形内判定// 汎用関数の定義template <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新(更新されたら trueを返す)template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新(更新されたら trueを返す)template <class T> inline T get(T set, int i) { return (set >> i) & T(1); }// 演算子オーバーロードtemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }#endif // 折りたたみ用#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;#ifdef _MSC_VER#include "localACL.hpp"#endif//using mint = modint1000000007;using mint = modint998244353;//using mint = modint; // mint::set_mod(m);namespace atcoder {inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }}using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>;#endif#ifdef _MSC_VER // 手元環境(Visual Studio)#include "local.hpp"#else // 提出用(gcc)inline int popcount(int n) { return __builtin_popcount(n); }inline int popcount(ll n) { return __builtin_popcountll(n); }inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }#define dump(...)#define dumpel(v)#define dump_list(v)#define dump_mat(v)#define input_from_file(f)#define output_to_file(f)#define Assert(b) { if (!(b)) while (1) cout << "OLE"; }#endif//#include <boost/multiprecision/cpp_int.hpp>//using Bint = boost::multiprecision::cpp_int;using Bint = bigint;string s; int i = 0;Bint positive_number() {string num;while (isdigit(s[i])) {num += s[i];i++;}return Bint(move(num));}Bint number() {Bint res;if (s[i] == '0') {i++;res = 0;}else if (s[i] == '-') {i++;res = -number();}else {res = positive_number();}return res;}Bint expression();Bint factor() {Bint res;if (s[i] == '(') {i++;res = expression();i++;}else {res = number();}return res;}Bint term() {Bint res = factor();while (1) {if (s[i] == '*') {i++;res *= factor();}else break;}return res;}Bint expression() {Bint res = term();while (1) {if (s[i] == '+') {i++;res += term();}else if (s[i] == '-') {i++;res -= term();}else break;}return res;}int main() {// input_from_file("input.txt");// output_to_file("output.txt");int n;cin >> n >> s;// s = "";// rep(i, (int)1e6) s += '1';// s += '1';s.push_back('$');cout << expression() << endl;}