#include <cstdio> using namespace std; int MAXN = 200 * 1000 + 1000; using LL = long long; int main() { char s[MAXN]; scanf("%s", s); int cur_type = 0, cur_len = 0, cur_type_len = 0; LL easy_cnt = 0; int i; for (i = 0; s[i] != '\0'; ++i) { char c = s[i]; int next_type = (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' || c == 'y'); if (next_type != cur_type) { cur_type = next_type; cur_type_len = 1; ++cur_len; } else if (cur_type_len < 2) { cur_type_len++; cur_len++; } else { easy_cnt += LL(cur_len) * (cur_len - 1) / 2; cur_len = 2; } } easy_cnt += LL(cur_len) * (cur_len - 1) / 2; easy_cnt += i; // single-letter fragments were not counted earlier printf("%lld\n", LL(i) * (i + 1) / 2 - easy_cnt); 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 | #include <cstdio> using namespace std; int MAXN = 200 * 1000 + 1000; using LL = long long; int main() { char s[MAXN]; scanf("%s", s); int cur_type = 0, cur_len = 0, cur_type_len = 0; LL easy_cnt = 0; int i; for (i = 0; s[i] != '\0'; ++i) { char c = s[i]; int next_type = (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' || c == 'y'); if (next_type != cur_type) { cur_type = next_type; cur_type_len = 1; ++cur_len; } else if (cur_type_len < 2) { cur_type_len++; cur_len++; } else { easy_cnt += LL(cur_len) * (cur_len - 1) / 2; cur_len = 2; } } easy_cnt += LL(cur_len) * (cur_len - 1) / 2; easy_cnt += i; // single-letter fragments were not counted earlier printf("%lld\n", LL(i) * (i + 1) / 2 - easy_cnt); return 0; } |