#include <bits/stdc++.h> using namespace std; #define PB push_back #define MP make_pair #define fst first #define snd second #define int4 int32_t #define LL long long #define int LL #define FOR(i,a,b) for (int i = (a); i != (b); i += ((a) < (b)) ? 1 : -1) #define REP(b) FOR(i, 0, b) #define ITER(b) for (auto i : (b)) #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((int)(x).size()) #define VI vector<int> #define PII pair<int,int> #define LD long double template<class C> void minu(C& a4, C b4) { a4 = min(a4, b4); } template<class C> void maxu(C& a4, C b4) { a4 = max(a4, b4); } template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<"\n";} template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) { while(*sdbg!=',')cerr<<*sdbg++;cerr<<"="<<h<<","; _dbg(sdbg+1, a...); } template<class T> ostream &operator<<(ostream &os, vector<T> V){ os<<"[";for(auto vv:V)os<<vv<<",";return os<<"]"; } template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) { return os << "(" << P.fst << "," << P.snd << ")"; } #ifdef LOCAL #define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) (__VA_ARGS__) #define cerr if(0)cout #endif const int maxn = 200005; int tab[maxn]; int bad[maxn]; map <char, bool> vowel; int32_t main() { for(char i:vector <char> ({'a', 'e', 'i', 'o', 'u', 'y'})) vowel[i] = 1; string s; cin>>s; REP(SZ(s)) { tab[i] = vowel[s[i]]; if(i >= 2) { if(tab[i] == tab[i - 1] && tab[i] == tab[i - 2]) { bad[i] = 1; } } } int wyn = 0; int last = SZ(s); FOR(i, SZ(s) - 1, -1) { if(bad[i]) { debug(i); wyn += (last - i) * (i - 1); last = i; } } cout<<wyn<<endl; }
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 | #include <bits/stdc++.h> using namespace std; #define PB push_back #define MP make_pair #define fst first #define snd second #define int4 int32_t #define LL long long #define int LL #define FOR(i,a,b) for (int i = (a); i != (b); i += ((a) < (b)) ? 1 : -1) #define REP(b) FOR(i, 0, b) #define ITER(b) for (auto i : (b)) #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((int)(x).size()) #define VI vector<int> #define PII pair<int,int> #define LD long double template<class C> void minu(C& a4, C b4) { a4 = min(a4, b4); } template<class C> void maxu(C& a4, C b4) { a4 = max(a4, b4); } template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<"\n";} template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) { while(*sdbg!=',')cerr<<*sdbg++;cerr<<"="<<h<<","; _dbg(sdbg+1, a...); } template<class T> ostream &operator<<(ostream &os, vector<T> V){ os<<"[";for(auto vv:V)os<<vv<<",";return os<<"]"; } template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) { return os << "(" << P.fst << "," << P.snd << ")"; } #ifdef LOCAL #define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) (__VA_ARGS__) #define cerr if(0)cout #endif const int maxn = 200005; int tab[maxn]; int bad[maxn]; map <char, bool> vowel; int32_t main() { for(char i:vector <char> ({'a', 'e', 'i', 'o', 'u', 'y'})) vowel[i] = 1; string s; cin>>s; REP(SZ(s)) { tab[i] = vowel[s[i]]; if(i >= 2) { if(tab[i] == tab[i - 1] && tab[i] == tab[i - 2]) { bad[i] = 1; } } } int wyn = 0; int last = SZ(s); FOR(i, SZ(s) - 1, -1) { if(bad[i]) { debug(i); wyn += (last - i) * (i - 1); last = i; } } cout<<wyn<<endl; } |