結果
問題 | No.2927 Reverse Polish Equation |
ユーザー | 横山緑 |
提出日時 | 2024-10-12 17:20:37 |
言語 | C++23(gcc13) (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 483 ms / 2,000 ms |
コード長 | 5,160 bytes |
コンパイル時間 | 7,628 ms |
コンパイル使用メモリ | 467,884 KB |
実行使用メモリ | 16,728 KB |
最終ジャッジ日時 | 2024-10-16 00:30:49 |
合計ジャッジ時間 | 16,726 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 4 ms
5,248 KB |
testcase_08 | AC | 6 ms
5,248 KB |
testcase_09 | AC | 5 ms
5,248 KB |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | AC | 6 ms
5,248 KB |
testcase_12 | AC | 141 ms
5,248 KB |
testcase_13 | AC | 238 ms
6,400 KB |
testcase_14 | AC | 165 ms
5,376 KB |
testcase_15 | AC | 228 ms
6,144 KB |
testcase_16 | AC | 75 ms
5,248 KB |
testcase_17 | AC | 306 ms
7,132 KB |
testcase_18 | AC | 381 ms
8,064 KB |
testcase_19 | AC | 25 ms
5,248 KB |
testcase_20 | AC | 301 ms
7,040 KB |
testcase_21 | AC | 469 ms
9,088 KB |
testcase_22 | AC | 44 ms
5,248 KB |
testcase_23 | AC | 2 ms
5,248 KB |
testcase_24 | AC | 2 ms
5,248 KB |
testcase_25 | AC | 2 ms
5,248 KB |
testcase_26 | AC | 2 ms
5,248 KB |
testcase_27 | AC | 403 ms
8,448 KB |
testcase_28 | AC | 338 ms
7,672 KB |
testcase_29 | AC | 45 ms
5,248 KB |
testcase_30 | AC | 386 ms
8,192 KB |
testcase_31 | AC | 28 ms
5,248 KB |
testcase_32 | AC | 85 ms
5,248 KB |
testcase_33 | AC | 164 ms
5,376 KB |
testcase_34 | AC | 206 ms
6,016 KB |
testcase_35 | AC | 2 ms
5,248 KB |
testcase_36 | AC | 384 ms
8,248 KB |
testcase_37 | AC | 129 ms
5,248 KB |
testcase_38 | AC | 451 ms
8,960 KB |
testcase_39 | AC | 181 ms
5,760 KB |
testcase_40 | AC | 376 ms
8,064 KB |
testcase_41 | AC | 308 ms
7,208 KB |
testcase_42 | AC | 455 ms
16,720 KB |
testcase_43 | AC | 483 ms
16,720 KB |
testcase_44 | AC | 482 ms
16,728 KB |
testcase_45 | AC | 430 ms
15,976 KB |
ソースコード
#line 2 "library/template.hpp" // #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; // https://xn--kst.jp/blog/2019/08/29/cpp-comp/ // debug methods // usage: debug(x,y); #define CHOOSE(a) CHOOSE2 a #define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x #define debug_1(x1) cout << #x1 << ": " << x1 << endl #define debug_2(x1, x2) \ cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl #define debug_3(x1, x2, x3) \ cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \ << x3 << endl #define debug_4(x1, x2, x3, x4) \ cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \ << x3 << ", " #x4 << ": " << x4 << endl #define debug_5(x1, x2, x3, x4, x5) \ cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \ << x3 << ", " #x4 << ": " << x4 << ", " #x5 << ": " << x5 << endl #ifdef LOCAL #define debug(...) \ CHOOSE((__VA_ARGS__, debug_5, debug_4, debug_3, debug_2, debug_1, ~)) \ (__VA_ARGS__) #else #define debug(...) #endif using ll = long long; using vl = vector<ll>; using Graph = vector<vector<ll>>; using P = pair<ll, ll>; #define all(v) v.begin(), v.end() template <typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); } template <typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); } #define rep1(i, n) for(ll i = 1; i <= ((ll)n); ++i) // https://trap.jp/post/1224/ template <class... T> constexpr auto min(T... a) { return min(initializer_list<common_type_t<T...>>{a...}); } template <class... T> constexpr auto max(T... a) { return max(initializer_list<common_type_t<T...>>{a...}); } template <class... T> void input(T &...a) { (cin >> ... >> a); } template <class T> void input(vector<T> &a) { for(T &x : a) cin >> x; } void print() { cout << '\n'; } template <class T, class... Ts> void print(const T &a, const Ts &...b) { cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } template <class T> void print(vector<T> x) { if(x.size()) { for(ll i = 0; i < x.size(); i++) { cout << x[i] << " \n"[i + 1 == x.size()]; } } } #define INT(...) \ int __VA_ARGS__; \ input(__VA_ARGS__) #define LL(...) \ long long __VA_ARGS__; \ input(__VA_ARGS__) #define STR(...) \ string __VA_ARGS__; \ input(__VA_ARGS__) #define REP1(a) for(int i = 0; i < a; i++) #define REP2(i, a) for(int i = 0; i < a; i++) #define REP3(i, a, b) for(int i = a; i < b; i++) #define REP4(i, a, b, c) for(int i = a; i < b; i += c) #define overload4(a, b, c, d, e, ...) e #define rep(...) overload4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__) ll inf = 3e18; vl dx = {1, -1, 0, 0}; vl dy = {0, 0, 1, -1}; #line 2 "yukicoder/515/a.cpp" #include <atcoder/fenwicktree> using namespace atcoder; // #include <atcoder/segtree> #include <boost/multiprecision/cpp_int.hpp> using namespace boost::multiprecision; void solve() { LL(q, y); vector<string> s(q); input(s); cpp_int ok = ll(1e15), ng = -1; auto cul = [&](cpp_int x) { vector<cpp_int> a; for(auto st : s) { if(st == "min") { cpp_int i = a.back(); a.pop_back(); cpp_int j = a.back(); a.pop_back(); a.push_back(min(i, j)); } else if(st == "max") { cpp_int i = a.back(); a.pop_back(); cpp_int j = a.back(); a.pop_back(); a.push_back(max(i, j)); } else if(st == "+") { cpp_int i = a.back(); a.pop_back(); cpp_int j = a.back(); a.pop_back(); a.push_back(i + j); } else if(st == "X") { a.push_back(x); } else { debug(st, stoll(st), cpp_int(stoll(st))); a.push_back(stoll(st)); debug("ok"); } } return a[0]; }; while(ok > ng + 1) { auto mid = (ok + ng) / 2; if(cul(mid) >= y) ok = mid; else ng = mid; } if(cul(ok) == y) { print(ok); } else print(-1); } int main() { ios::sync_with_stdio(false); std::cin.tie(nullptr); cout << std::setprecision(16); int t = 1; rep(_, t) { solve(); } }