#878925 (C++17) No.708 （＋ー）の式

• 問題: No.708 （＋ー）の式
• ユーザー: syndrome
• 提出日時: 2023-06-09 13:49:39
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 32 ms / 2,000 ms
• コード長: 2,979 bytes
• コンパイル時間: 1,884 ms
• コンパイル使用メモリ: 199,764 KB
• 最終ジャッジ日時: 2025-02-13 23:34:12
• ジャッジサーバーID （参考情報）: judge5 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 12

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
// (⁠◕⁠ᴗ⁠◕⁠✿⁠)
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint1000000007;
// using mint = modint998244353;
// using vmint = vc<mint>;using vvmint = vc<vmint>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define srep(i, s, n) for (int i = s; i < n; i++)
#define drep(i, n) for (int i = n; i >= 0; i--)
#define dsrep(i, s, n) for (int i = s; i >= n; i--)
#define len(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
using vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;
using ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int, int>;
const double pi = 3.141592653589793;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
// const int mod = 1000000007;
const int mod = 998244353;
inline bool inside(long long y, long long x, long long H, long long W) {return 0 <= y and y < H and 0 <= x and x < W; }
struct phash{
    inline size_t operator()(const pair<int,int> & p) const{
        const auto h1 = hash<int>()(p.first);
        const auto h2 = hash<int>()(p.second);
        return h1 ^ (h2 << 1);
    }
};
typedef string :: const_iterator State;
int expression(State &begin);
int factor(State &begin);
int number(State &begin);
void consume(State &begin, set<char> expected);
class ParseError {};
int number(State &begin){
    int ret = 0;
    while (isdigit(*begin)){
        ret *= 10;
        ret += *begin - '0';
        begin++;
    }
    return ret;
}
int factor(State &begin){
    int ret = 0;
    if (*begin == '('){
        begin++;
        ret += expression(begin);
        consume(begin, {')'});
    }else ret = number(begin);
    return ret;
}
int expression(State &begin){
    int ret = factor(begin);
    for (;;){
        if (*begin == '+'){
            begin++;
            ret += factor(begin);
        }else if (*begin == '-'){
            begin++;
            ret -= factor(begin);
        }
        else break;
    }
    return ret;
}
void consume(State &begin, set<char> expected){
    if (expected.count(*begin)){
        begin++;
    }else{
        cout << "Expected ";
        for (auto it = expected.begin(); it != expected.end(); it++){
            if (it != expected.begin()) cout << " or ";
            cout << *it;
        }
        cout << " but got " << *begin << endl;
        cout << "rest : ";
        while (*begin){
            cout << *begin++;
        }
        cout << endl;
        throw ParseError();
    }
}
int main(){
    string S; cin >> S;
    State begin = S.begin();
    cout << expression(begin) << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX