結果

問題 No.2927 Reverse Polish Equation
コンテスト
ユーザー Andrew8128
提出日時 2024-10-12 15:42:16
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 232 ms / 2,000 ms
コード長 3,422 bytes
コンパイル時間 3,357 ms
コンパイル使用メモリ 258,440 KB
実行使用メモリ 13,140 KB
最終ジャッジ日時 2024-10-16 00:23:44
合計ジャッジ時間 7,985 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 43
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, x, y) for (auto i = (x); i < (y); i++)
#define RREP(i, x, y) for (auto i = (y) - 1; (x) <= i; i--)
#define ALL(x) (x).begin(), (x).end()
#pragma GCC optimize("O3")
#define lll __int128
string to_string(lll value){
  lll tmp = value < 0 ? -value : value;
  string ret;
  do {
    ret += (tmp % 10)+'0';
    tmp /= 10;
  } while (tmp != 0);
  if(value < 0){
    ret += '-';
  }
  reverse(ret.begin(),ret.end());
  return ret;
}
ostream &operator<<(ostream &dest, lll value) {
  dest << to_string(value);
  return dest;
}
lll stolll(string &s) {
  if(s=="")return 0;
  lll ret = 0;
  for (int i = 0; i < ssize(s); i++)
    if ('0' <= s[i] && s[i] <= '9')
      ret = 10 * ret + s[i] - '0';
  if(s[0]=='-') return -ret;
  return ret;
}
istream &operator>>(istream &is, __int128_t &value){
  string s;
  is >> s;
  value = stolll(s);
  return is;
}
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  lll Q, Y;
  cin >> Q >> Y;
  vector<string> S(Q);
  REP(i, 0, Q){
    cin >> S[i];
  }
  {
    vector<lll> A;
    REP(i, 0, Q){
      if(S[i] == "X"){
        A.push_back(110000000000000ll);
      }else if(S[i] == "+"){
        lll tmp = A[ssize(A)-1] + A[ssize(A)-2];
        A.pop_back();
        A.pop_back();
        A.push_back(tmp);
      }else if(S[i] == "min"){
        lll tmp = min(A[ssize(A)-1], A[ssize(A)-2]);
        A.pop_back();
        A.pop_back();
        A.push_back(tmp);
      }else if(S[i] == "max"){
        lll tmp = max(A[ssize(A)-1], A[ssize(A)-2]);
        A.pop_back();
        A.pop_back();
        A.push_back(tmp);
      }else{
        A.push_back(stolll(S[i]));
      }
    }
    if(A[0] < Y){
      cout << -1 << "\n";
      return 0;
    }
  }
  lll l = -1, r = 110000000000000ll;
  while(1){
    if(l + 1 == r)break;
    lll c = (l + r) / 2;
    vector<lll> A;
    REP(i, 0, Q){
      if(S[i] == "X"){
        A.push_back(c);
      }else if(S[i] == "+"){
        lll tmp = A[ssize(A)-1] + A[ssize(A)-2];
        A.pop_back();
        A.pop_back();
        A.push_back(tmp);
      }else if(S[i] == "min"){
        lll tmp = min(A[ssize(A)-1], A[ssize(A)-2]);
        A.pop_back();
        A.pop_back();
        A.push_back(tmp);
      }else if(S[i] == "max"){
        lll tmp = max(A[ssize(A)-1], A[ssize(A)-2]);
        A.pop_back();
        A.pop_back();
        A.push_back(tmp);
      }else{
        A.push_back(stolll(S[i]));
      }
    }
    // cerr << c << " " << A[0] << "\n";
    if(Y <= A[0]){
      r = c;
    }else{
      l = c;
    }
    // cerr << "l " << l << " r " << r << "\n";
  }
  {
    vector<lll> A;
    REP(i, 0, Q){
      if(S[i] == "X"){
        A.push_back(r);
      }else if(S[i] == "+"){
        lll tmp = A[ssize(A)-1] + A[ssize(A)-2];
        A.pop_back();
        A.pop_back();
        A.push_back(tmp);
      }else if(S[i] == "min"){
        lll tmp = min(A[ssize(A)-1], A[ssize(A)-2]);
        A.pop_back();
        A.pop_back();
        A.push_back(tmp);
      }else if(S[i] == "max"){
        lll tmp = max(A[ssize(A)-1], A[ssize(A)-2]);
        A.pop_back();
        A.pop_back();
        A.push_back(tmp);
      }else{
        A.push_back(stolll(S[i]));
      }
    }
    if(A[0] == Y){
      cout << r << "\n";
    }else{
      cout << -1 << "\n";
    }
  }
  return 0;
}
/*
  File : ~/yukicoder/midoriika_3rd/I.cpp
  Date : 2024/10/12
  Time : 15:15:17
*/
0