結果

問題 No.457 (^^*)
ユーザー koyumeishi
提出日時 2016-12-08 00:25:11
言語 C++14
(gcc 7.2.0)
結果
AC  
実行時間 5 ms
コード長 4973 Byte
コンパイル時間 1262 ms
使用メモリ 1696 KB

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
Sample_01.txt AC 4 ms
1504 KB
Sample_02.txt AC 4 ms
1504 KB
Sample_03.txt AC 4 ms
1508 KB
Sample_04.txt AC 3 ms
1504 KB
Sample_05.txt AC 3 ms
1504 KB
Sample_06.txt AC 3 ms
1504 KB
Sample_07.txt AC 3 ms
1532 KB
Test_1_01.txt AC 3 ms
1540 KB
Test_1_02.txt AC 3 ms
1556 KB
Test_1_03.txt AC 4 ms
1576 KB
Test_1_04.txt AC 4 ms
1636 KB
Test_1_05.txt AC 4 ms
1696 KB
Test_2_01.txt AC 5 ms
1692 KB
Test_2_02.txt AC 4 ms
1688 KB
Test_2_03.txt AC 4 ms
1660 KB
Test_2_04.txt AC 4 ms
1692 KB
Test_2_05.txt AC 4 ms
1688 KB
Test_2_06.txt AC 4 ms
1688 KB
Test_2_07.txt AC 5 ms
1504 KB
Test_2_08.txt AC 5 ms
1508 KB
テストケース一括ダウンロード

ソースコード

diff #
#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

//accumulative_sum_1d acc(vec, [](char x){return x=='c';});
//long long sum = acc(lb,ub); //[lb,ub]
class accumulative_sum_1d{
  using T=long long;
 public:
  vector<T> acc;
  template<class Comp>
  accumulative_sum_1d(const string& vec, Comp comp_func) : acc(vec.size()){
    for(size_t i=0; i<vec.size(); i++) acc[i] += comp_func(vec[i]) + (i?acc[i-1]:0);
  }
  T operator () (int lb, int ub){ return acc[ub] - (lb?acc[lb-1]:0); }
};

int main(){
  string s;
  cin >> s;

  accumulative_sum_1d acc_l(s, [](char x){return x=='(';});
  long long ans_l = 0;

  deque<int> x;
  deque<int> y;
  for(int i=0; i<s.size(); i++){
    if(s[i] == '^'){
      x.push_back(i);
    }
    if(s[i] == '*'){
      y.push_back(i);
    }
    while(y.size() > 1) y.pop_front();

    if(s[i] != ')') continue;
    if(y.size() == 0) continue;
    if(x.size() < 2) continue;
    while(x.size() > 2 && x[2] < y.front() ) x.pop_front();
    if(x.size() < 2) continue;
    if(x[1] > y.front()) continue;
    ans_l += acc_l(0, x.front());
  }

  reverse(s.begin(), s.end());
  long long ans_r = 0;

  accumulative_sum_1d acc_r(s, [](char x){return x==')';});
  x.clear();
  y.clear();
  for(int i=0; i<s.size(); i++){
    if(s[i] == '^'){
      x.push_back(i);
    }
    if(s[i] == '*'){
      y.push_back(i);
    }

    if(s[i] != '(') continue;
    while(y.size() > 1) y.pop_front();
    if(y.size() == 0) continue;
    if(x.size() < 2) continue;
    while(x.size() > 2 && x[2] < y.front() ) x.pop_front();
    if(x.size() < 2) continue;
    if(x[1] > y.front()) continue;
    ans_r += acc_r(0, x.front());
  }

  println(ans_l, ans_r);


  return 0;
}
0