Submission #93011

---

Source Code Expand

#include <iostream>
#include <cassert>
#include <string>
#include <cctype>

using namespace std;

typedef long long ll;

ll size(const string &str, size_t &cur);
void expr(const string &str, size_t &cur, ll s, ll e);

ll Number(const string &str, size_t &cur){
  ll res = 0;
  while(cur < str.size()&&isdigit(str[cur])){
    res = res * 10 + str[cur++] - '0';
  }
  return res;
}

string String(const string &str, size_t &cur){
  ll l = cur;
  assert(isalpha(str[cur]));
  while(cur < str.size() && isalpha(str[cur])) cur++;
  return string(str.begin() + l, str.begin() + cur);
}

ll size_str(const string &str, size_t &cur){
  if(str[cur] == '('){
    ll len = size(str, ++cur);
    assert(str[cur++] == ')');
    return len * Number(str, cur);
  }else{
    return String(str, cur).size();
  }
}

ll size(const string &str, size_t &cur){
  ll s = size_str(str, cur);
  while(cur < str.size() && str[cur] != ')'){
    s += size_str(str, cur);
  }
  return s;
}

ll size(const string &str){
  size_t cur = 0;
  return size(str, cur);
}

void exp_str(const string &str, size_t &cur, ll s, ll e){
  if(s >= e) return;
  
  if(str[cur] == '('){
    size_t old_cur = ++cur;
    ll len = size(str, cur);
    assert(str[cur++] == ')');
    ll tot_len = len * Number(str, cur);
    ll start = s / len * len;
    
    while(start < e && start < tot_len){
      size_t tmp_cur = old_cur;
      ll tmp_s = max(0LL, s - start);
      ll tmp_e = max(0LL, e - start);
      expr(str, tmp_cur, tmp_s, tmp_e);
      start += len;
    }
  }else{
    string t = String(str, cur);
    ll len = t.size();
    assert(e <= len);
    cout << string(t.begin() + s, t.begin() + e);
  }
};

void expr(const string &str, size_t &cur, ll s, ll e){
  if(s >= e) return;
  
  size_t len_cur = cur;
  ll len = size_str(str, len_cur);
  if(s < len) exp_str(str, cur, s, min(len, e));
  cur = len_cur;
  
  s = max(0LL, s - len);
  e = max(0LL, e - len);
  
  while(cur < str.size() && str[cur] != ')'){
    ll len = size_str(str, len_cur);
    if(s < len) exp_str(str, cur, s, min(len, e));
    s = max(0LL, s - len);
    e = max(0LL, e - len);
    cur = len_cur;
  }
}
		
void solve(const string &str, ll s, ll e){
  size_t cur = 0;
  expr(str, cur, s, e);
}


int main(){
  ll B, L, N, M;
  string S;
  assert(N <= 100);
  cin >> B >> L >> N >> S;
  M = size(S);
  if(B < 0) B = M+ B;
  solve(S, B, B + L);
  cout << endl;
  return 0;
}

Submission Info

Judge Result