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
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>

using namespace std;

typedef long long LL;

string s;

bool sam(char c)
{
    if(c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u')
        return true;
    return false;
}

priority_queue<LL> q;

int main ()
{
    ios_base::sync_with_stdio(0);

    cin >> s;
    if(s.size() < 3)
    {
        cout << 0;
        return 0;
    }
    for(int i = 2; i < (int)s.size(); i ++)
    {
        if(sam(s[i]) && sam(s[i - 1]) && sam(s[i - 2]))
            q.push((LL)(-(i - 2)));
        if(!sam(s[i]) && !sam(s[i - 1]) && !sam(s[i - 2]))
            q.push((LL)(-(i - 2)));
    }
    if(q.empty())
    {
        cout << 0;
        return 0;
    }
    LL res = 0;
    LL n = s.size() - 1;
    for(LL i = 0; i < (int)s.size(); i ++)
    {
        if(q.empty()) break;
        res += n - (-q.top() + 1LL);
        //cout << n - (-q.top() + 1LL) << "\n";
        //cout << i << " " << q.top() << "\n";
        if((-q.top()) == i)
            q.pop();
    }
    cout << res;
    return 0;
}