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

using namespace std;

bool tab[200000];
int c[200000];

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	string inp;
	cin >> inp;

	long long int n = inp.length();
	long long int result = (n * (n + 1)) / 2;
	for (int i = 0; i < n; i++)
	{
		tab[i] = inp[i] == 'a' || inp[i] == 'e' || inp[i] == 'i' || inp[i] == 'o' || inp[i] == 'u' || inp[i] == 'y';
	}
	int sumed = 1;
	c[0] = 1;
	for (int i = 1; i < n; i++)
	{
		if (tab[i]==tab[i-1])
		{
			c[sumed - 1] ++;
		}
		else
		{
			c[sumed] ++;
			sumed++;
		}
	}
	long long int prevLen = 0;
	
	for (int i = 0; i < sumed; i++)
	{
		if (c[i] <= 2)
		{
			prevLen += c[i];
		}
		else
		{
			if (c[i] == 3)
			{
				result++;
			}
			prevLen += 2;
			result -= ((prevLen * (prevLen + 1)) / 2);
			prevLen = 2;
			if(c[i]>3)
			result -= (c[i] - 3+ c[i] - 4);
		}
	}
	result -= ((prevLen * (prevLen + 1)) / 2);

	cout << result;
	return 0;
}