#include <bits/stdc++.h> using namespace std; typedef long long LL; typedef pair<int, int> PII; typedef pair<LL, LL> PLL; typedef vector<int> VI; const int INF = 1000000009; const LL LINF = 1000000000000000009LL; #define FOR(i, b, e) for(int i = b; i <= e; ++i) #define FORD(i, b, e) for(int i = b; i >= e; --i) #define REP(i, n) FOR(i, 0, n-1) #define REV(i, n) FORD(i, n-1, 0) #define PB push_back #define PP pop_back #define MP make_pair #define ST first #define ND second #define SIZE(c) (int)(c).size() #define ALL(c) (c).begin(), (c).end() #define DEBUG(s) s const int N = 200005; string s; bool rmc[N]; int pref[N]; int firs[N]; int n; bool sam(char c) { return (c == 'a') || (c == 'e') || (c == 'i') || (c == 'o') || (c == 'u') || (c =='y'); } void calc() { pref[1] = 1; FOR(i, 2, n) { if(sam(s[i-1]) == sam(s[i])) { pref[i] = pref[i-1] + 1; } else { pref[i] = 1; } if(pref[i] >= 3) rmc[i] = true; } } LL res; int main() { ios::sync_with_stdio(0); cin.tie(0); cin>>s; n = s.length(); s = " " + s; calc(); int last = n+1; firs[n] = firs[n-1] = n+1; FORD(i, n-2, 1) { if(rmc[i+2]) last = i+2; firs[i] = last; } //~ FOR(i, 1, n) cout<<firs[i]<<" "; //~ cout<<"\n"; //~ FOR(i, 1, n) cout<<rmc[i]<<" "; FOR(i, 1, n-2) { res+=n+1-firs[i]; } cout<<res<<"\n"; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 | #include <bits/stdc++.h> using namespace std; typedef long long LL; typedef pair<int, int> PII; typedef pair<LL, LL> PLL; typedef vector<int> VI; const int INF = 1000000009; const LL LINF = 1000000000000000009LL; #define FOR(i, b, e) for(int i = b; i <= e; ++i) #define FORD(i, b, e) for(int i = b; i >= e; --i) #define REP(i, n) FOR(i, 0, n-1) #define REV(i, n) FORD(i, n-1, 0) #define PB push_back #define PP pop_back #define MP make_pair #define ST first #define ND second #define SIZE(c) (int)(c).size() #define ALL(c) (c).begin(), (c).end() #define DEBUG(s) s const int N = 200005; string s; bool rmc[N]; int pref[N]; int firs[N]; int n; bool sam(char c) { return (c == 'a') || (c == 'e') || (c == 'i') || (c == 'o') || (c == 'u') || (c =='y'); } void calc() { pref[1] = 1; FOR(i, 2, n) { if(sam(s[i-1]) == sam(s[i])) { pref[i] = pref[i-1] + 1; } else { pref[i] = 1; } if(pref[i] >= 3) rmc[i] = true; } } LL res; int main() { ios::sync_with_stdio(0); cin.tie(0); cin>>s; n = s.length(); s = " " + s; calc(); int last = n+1; firs[n] = firs[n-1] = n+1; FORD(i, n-2, 1) { if(rmc[i+2]) last = i+2; firs[i] = last; } //~ FOR(i, 1, n) cout<<firs[i]<<" "; //~ cout<<"\n"; //~ FOR(i, 1, n) cout<<rmc[i]<<" "; FOR(i, 1, n-2) { res+=n+1-firs[i]; } cout<<res<<"\n"; return 0; } |