結果
| 問題 | No.2927 Reverse Polish Equation |
| ユーザー |
 dyktr_06
|
| 提出日時 | 2024-10-15 16:29:50 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 8,542 bytes |
| コンパイル時間 | 2,183 ms |
| コンパイル使用メモリ | 204,496 KB |
| 最終ジャッジ日時 | 2025-02-24 19:51:46 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 41 WA * 2 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define overload4(_1, _2, _3, _4, name, ...) name#define rep1(n) for(int i = 0; i < (int)(n); ++i)#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)#define ALL(a) (a).begin(), (a).end()#define Sort(a) (sort((a).begin(), (a).end()))#define RSort(a) (sort((a).rbegin(), (a).rend()))#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))typedef long long int ll;typedef unsigned long long ul;typedef long double ld;typedef vector<int> vi;typedef vector<long long> vll;typedef vector<char> vc;typedef vector<string> vst;typedef vector<double> vd;typedef vector<long double> vld;typedef pair<long long, long long> P;template<class T> long long sum(const T &a){ return accumulate(a.begin(), a.end(), 0LL); }template<class T> auto min(const T &a){ return *min_element(a.begin(), a.end()); }template<class T> auto max(const T &a){ return *max_element(a.begin(), a.end()); }const long long MINF = 0x7fffffffffff;const long long INF = 0x1fffffffffffffff;const long long MOD = 998244353;const long double EPS = 1e-9;const long double PI = acos(-1);template<class T> inline bool chmax(T &a, T b) { if(a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T &a, T b) { if(a > b) { a = b; return 1; } return 0; }template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; returnos; }template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " ";} return os; }template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr<< (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; }template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os <<*itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; }template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os<< pq.top() << " "; pq.pop(); } return os; }template <typename T>long long binary_search(long long ok, long long ng, T check){while(abs(ok - ng) > 1){long long mid = (ok + ng) / 2;if(check(mid)) ok = mid;else ng = mid;}return ok;}template <typename T>long double binary_search_real(long double ok, long double ng, T check, int iter = 100){for(int i = 0; i < iter; ++i){long double mid = (ok + ng) / 2;if(check(mid)) ok = mid;else ng = mid;}return ok;}template <typename T>long long trisum(T a, T b){long long res = ((b - a + 1) * (a + b)) / 2;return res;}template <typename T>T intpow(T x, int n){T ret = 1;while(n > 0) {if(n & 1) (ret *= x);(x *= x);n >>= 1;}return ret;}template <typename T>T getReminder(T a, T b){if(b == 0) return -1;if(a >= 0 && b > 0){return a % b;} else if(a < 0 && b > 0){return ((a % b) + b) % b;} else if(a >= 0 && b < 0){return a % b;} else{return (abs(b) - abs(a % b)) % b;}}template<class T, class U> inline T vin(T &vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }template<class... T> void in(T&... a){ (cin >> ... >> a); }void out(){ cout << '\n'; }template<class T, class... Ts> void out(const T &a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }template<class T, class U> void inGraph(vector<vector<T>> &G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b;cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }template <typename T>struct BinaryIndexedTree{int N;vector<T> BIT;BinaryIndexedTree(const int &N) : N(N), BIT(N + 1, 0){}T get(int i){return sum(i + 1) - sum(i);}void add(int i, T x){i++;while(i <= N){BIT[i] += x;i += i & -i;}}T sum(int i) const {T ans = 0;while(i > 0){ans += BIT[i];i -= i & -i;}return ans;}T sum(int L, int R) const {return sum(R) - sum(L);}int lower_bound(T x) const {if(x <= 0){return 0;} else{int v = 0, r = 1;while(r < N) r = r << 1;for(int len = r; len > 0; len = len >> 1){if(v + len < N && BIT[v + len] < x){x -= BIT[v + len];v += len;}}return v;}}int upper_bound(T x) const {if(x < 0){return 0;} else{int v = 0, r = 1;while(r <= N) r = r << 1;for(int len = r; len > 0; len = len >> 1){if(v + len <= N && BIT[v + len] <= x){x -= BIT[v + len];v += len;}}return v;}}T operator [](int i) const {return sum(i, i + 1);}};ll T;void input(){in(T);}void solve(){ll q, y; in(q, y);vst s; vin(s, q);auto fx = [&](ll x){vll a;rep(i, q){if(s[i][0] == 'X'){a.push_back(x);}else if('0' <= s[i][0] && s[i][0] <= '9'){a.push_back(stoll(s[i]));}else if(s[i][0] == '+'){ll y = a.back(); a.pop_back();ll z = a.back(); a.pop_back();a.push_back(y + z);}else if(s[i] == "min"){ll y = a.back(); a.pop_back();ll z = a.back(); a.pop_back();a.push_back(min(y, z));}else{ll y = a.back(); a.pop_back();ll z = a.back(); a.pop_back();a.push_back(max(y, z));}}return a[0] >= y;};auto fv = [&](ll x){vll a;rep(i, q){if(s[i][0] == 'X'){a.push_back(x);}else if('0' <= s[i][0] && s[i][0] <= '9'){a.push_back(stoll(s[i]));}else if(s[i][0] == '+'){ll y = a.back(); a.pop_back();ll z = a.back(); a.pop_back();a.push_back(y + z);}else if(s[i] == "min"){ll y = a.back(); a.pop_back();ll z = a.back(); a.pop_back();a.push_back(min(y, z));}else{ll y = a.back(); a.pop_back();ll z = a.back(); a.pop_back();a.push_back(max(y, z));}}return a[0];};ll init = 1e15;ll ans = binary_search(init, -1, fx);if(ans == init){out(-1);return;}if(fv(ans) == y){out(ans);}else{out(-1);}}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(20);T = 1;// input();while(T--) solve();}