competitive_programming/Frieza.cpp at master · Karthik-Ragunath/competitive_programming · GitHub

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
#include<bits/stdc++.h>
using namespace std;
#define ll long long int

int main()
{
    ll testcases;
    cin >> testcases;
    set< ll > goodValues;
    goodValues.insert((ll)('f'));
    goodValues.insert((ll)('r'));
    goodValues.insert((ll)('i'));
    goodValues.insert((ll)('e'));
    goodValues.insert((ll)('z'));
    goodValues.insert((ll)('a'));
    for(ll k = 0; k < testcases; k++)
    {
        string temp;
        cin >> temp;
        string::iterator str = temp.begin();
        ll currentCountGood = 0;
        ll currentCountBad = 0;
        string solutionString = "";
        bool previous;
        set< ll >::iterator setIterBegin = goodValues.find((ll)(*str));
        if(setIterBegin != goodValues.end())
        {
            currentCountGood++;
            previous = true;
            str++;
        }
        else
        {
            currentCountBad++;
            previous = false;
            str++;
        }

        for(; str != temp.end(); str++)
        {
            set< ll >::iterator setIter = goodValues.find((ll)(*str));
            if(setIter != goodValues.end())
            {
                if(previous == false)
                {
                    string solTemp = to_string(currentCountBad);
                    solutionString += solTemp;
                    currentCountBad = 0;
                }
                currentCountGood++;
                previous = true;
            }
            else
            {
                if(previous == true)
                {
                    string solTemp = to_string(currentCountGood);
                    solutionString += solTemp;
                    currentCountGood = 0;
                }
                currentCountBad++;
                previous = false;
            }
        }

        if(currentCountGood > 0)
        {
            string solTemp = to_string(currentCountGood);
            solutionString += solTemp;
            currentCountGood = 0;
        }
        else
        {
            string solTemp = to_string(currentCountBad);
            solutionString += solTemp;
            currentCountBad = 0;
        }
        cout << solutionString << endl;
    }
    return 0;
}