Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <algorithm>
- #include <cmath>
- #include <vector>
- #include <string>
- #include <map>
- #include <cstdio>
- #include <set>
- #include <queue>
- #include <functional>
- #include <bitset>
- #include <climits>
- #include <cctype>
- #include <cassert>
- #include <deque>
- #include <time.h>
- using namespace std;
- typedef long long int64;
- #define ret0 goto end
- #define DBG;
- #ifndef LOCAL_BUILD
- #define DBG if(false)
- #define ret0 return 0
- #endif
- #define st first
- #define nd second
- #define double long double
- #define mp make_pair
- #define int int64
- #define pb push_back
- #define vint vector<int>
- #define pii pair<int,int>
- #define ALL(a) a.begin(),a.end()
- #define FILE_NAME "king2"
- ostream& operator<<(ostream& os, const vector<int>& a) {
- for(int i = 0; i < a.size(); ++i) {
- os << a[i] << ' ';
- }
- return os;
- }
- /*-------------------------------------------------------------------------*/
- bool comp(pii a1, pii a2) {
- return a1.st < a2.st;
- }
- /*-------------------------------------------------------------------------*/
- signed main() {
- ios_base::sync_with_stdio(0);
- cin.tie(0); cout.tie(0);
- #ifdef LOCAL_BUILD
- freopen("input.txt","r",stdin);
- freopen("output.txt", "w", stdout);
- clock_t tStart = clock();
- #else
- //freopen(FILE_NAME".in","r",stdin);
- //freopen(FILE_NAME".out", "w", stdout);
- #endif
- /*-------------------------------------------------------------------------*/
- string s = "";
- cin >> s;
- vint a;
- vint sum;
- int c = 0;
- for(int i = 0; i < s.length(); ++i) {
- if (s[i] == 'a')
- c++;
- else if (s[i] == 'b'){
- if(c!=0) {
- a.pb(c);
- sum.pb(c);
- if(sum.size() != 1)
- sum[sum.size() - 1] += sum[sum.size() - 2];
- c = 0;
- }
- }
- }
- if(c != 0) {
- a.pb(c);
- sum.pb(c);
- if(sum.size() != 1)
- sum[sum.size() - 1] += sum[sum.size() - 2];
- }
- int mod = 1e+9 + 7;
- if(a.size() == 0) {
- cout << 0 << endl;
- return 0;
- }
- if(s.size() == 1) {
- cout << a[0]%mod << endl;
- return 0;
- }
- if(a.size() == 2) {
- cout << sum[1]%mod + a[0]*a[1]%mod << endl;
- return 0;
- }
- int res = a[a.size()-1]%mod;
- for(int i = a.size()-2; i >= 0; --i) {
- res = res*a[i];
- res %= mod;
- if(i-1 >= 0) {
- res += sum[sum.size() - 1] - sum[i-1];
- } else {
- res += sum[sum.size() - 1];
- }
- res %= mod;
- }
- cout << res << endl;
- /*-------------------------------------------------------------------------*/end:
- #ifdef LOCAL_BUILD
- printf("\nTime taken: %.6Lfs\n", (double)(clock() - tStart)/CLOCKS_PER_SEC);
- #endif
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement