algorithmStudy/12933.cpp at master · judy5050/algorithmStudy · 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
82
83
84
85
//
//  12933.cpp
//  algo
//
//  Created by 박효정 on 2021/08/13.
//

#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>

using namespace std;

int main(){


    cin.tie(0);
    cout.tie(0);
    std::ios::sync_with_stdio(false);

    string s;

    cin>>s;
    int res=0;
    vector<int>vis(s.size());

    string tmp="";
    //연속 울음 확인용
    int ch=0;
    for(int i=0;i<s.size();i++){
        for(int j=i;j<s.size();j++){
            if(tmp.empty()&&s[j]=='q'&&vis[j]==0){
                tmp+='q';
                vis[j]=1;
            }else if(tmp.size()==1&&s[j]=='u'&&vis[j]==0){
                tmp+='u';
                vis[j]=1;
            }else if(tmp.size()==2&&s[j]=='a'&&vis[j]==0){
                tmp+='a';
                vis[j]=1;
            }else if(tmp.size()==3&&s[j]=='c'&&vis[j]==0){
                tmp+='c';
                vis[j]=1;
            }else if(tmp.size()==4&&s[j]=='k'&&vis[j]==0){
                tmp="";
                vis[j]=1;
                ch=1;
            }

        }

        if(ch==1){
            res++;
            ch=0;
        }
        tmp="";


    }

    ch=0;
    for(int i=0;i<s.size();i++){
        if(vis[i]==0){
            ch=1;
            break;
        }
    }


    if(res!=0&&ch==0&&s.size()%5==0){
        cout<<res<<"\n";
    }else{
        cout<<-1<<"\n";
    }


    return 0;
}