#392229 (C++14) No.265 数学のテスト

• 問題: No.265 数学のテスト
• ユーザー: fumiphys
• 提出日時: 2019-10-22 00:38:58
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 11 ms / 2,000 ms
• コード長: 4,781 bytes
• コンパイル時間: 1,619 ms
• コンパイル使用メモリ: 177,684 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-02 17:54:44
• 合計ジャッジ時間: 2,671 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	4 ms; 5,248 KB
testcase_01	AC	5 ms; 5,376 KB
testcase_02	AC	11 ms; 5,376 KB
testcase_03	AC	9 ms; 5,376 KB
testcase_04	AC	9 ms; 5,376 KB
testcase_05	AC	10 ms; 5,376 KB
testcase_06	AC	8 ms; 5,376 KB
testcase_07	AC	9 ms; 5,376 KB
testcase_08	AC	11 ms; 5,376 KB
testcase_09	AC	8 ms; 5,376 KB
testcase_10	AC	8 ms; 5,376 KB
testcase_11	AC	9 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	6 ms; 5,376 KB
testcase_14	AC	3 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	2 ms; 5,376 KB
testcase_17	AC	1 ms; 5,376 KB
testcase_18	AC	2 ms; 5,376 KB
testcase_19	AC	2 ms; 5,376 KB
testcase_20	AC	2 ms; 5,376 KB
testcase_21	AC	1 ms; 5,376 KB
testcase_22	AC	4 ms; 5,376 KB
testcase_23	AC	2 ms; 5,376 KB
testcase_24	AC	2 ms; 5,376 KB
testcase_25	AC	5 ms; 5,376 KB
testcase_26	AC	1 ms; 5,376 KB
testcase_27	AC	1 ms; 5,376 KB
testcase_28	AC	2 ms; 5,376 KB
testcase_29	AC	2 ms; 5,376 KB
testcase_30	AC	2 ms; 5,376 KB
testcase_31	AC	2 ms; 5,376 KB
testcase_32	AC	2 ms; 5,376 KB
testcase_33	AC	2 ms; 5,376 KB
testcase_34	AC	2 ms; 5,376 KB
testcase_35	AC	1 ms; 5,376 KB

ソースコード

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

vector<string> split(string s){
  vector<string> res;
  string t = "";
  rep(i, sz(s)){
    if(s[i] == '+'){
      res.pb(t);
      t = "";
    }else{
      t += s[i];
    }
  }
  if(sz(t) > 0)res.pb(t);
  return res;
}

string diff_sing(string s){
  ll coef = 1;
  int x = 0;
  string dig = "";
  rep(i, sz(s)){
    if(s[i] == 'x'){
      x++;
      if(sz(dig) > 0)coef = stoll(dig);
      dig = "";
    }else if('0' <= s[i] && s[i] <= '9'){
      dig += s[i];
    }
  }
  if(sz(dig) > 0)coef = stoll(dig);
  if(coef == 0)return "0";
  string res = to_string(coef * x);
  rep(j, x - 1)res += "*x";
  return res;
}

string diff(string s){
  vector<string> c = split(s);
  string res = "";
  for(string t: c){
    if(sz(res) > 0)res += "+";
    res += diff_sing(t);
  }
  return res;
}

string calc(string s, int k){
  if(k > 12)return "0";
  string res = "";
  int i = 0;
  while(i < sz(s)){
    if(s[i] != 'd'){
      res += s[i];
      i++;
      continue;
    }
    int curr = 1;
    int pred = i;
    string t = "";
    for(i = i + 2; i < sz(s); i++){
      if(s[i] == '}'){
        curr--;
        if(curr == 0){
          res += diff(calc(t, k + 1));
          i++;
          break;
        }
        t += s[i];
      }else if(s[i] == '{'){
        t += s[i];
        curr++;
      }else{
        t += s[i];
      }
    }
  }
  return res;
}

int main(int argc, char const* argv[])
{
  int n, d; cin >> n >> d;
  string s; cin >> s;
  string c = calc(s, 0);
  vector<ll> a(d + 1, 0);
  vector<string> sp = split(c);
  for(string t: sp){
    ll coef = 1;
    int x = 0;
    string dig = "";
    rep(i, sz(t)){
      if(t[i] == 'x'){
        x++;
        if(sz(dig) > 0){
          coef = stoll(dig);
        } 
        dig = "";
      }else if('0' <= t[i] && t[i] <= '9'){
        dig += t[i];
      }
    }
    if(sz(dig) > 0)coef = stoll(dig);
    a[x] += coef;
  }
  cout << a << endl;
  return 0;
}