-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdiv3-988.cpp
More file actions
62 lines (57 loc) · 1.1 KB
/
div3-988.cpp
File metadata and controls
62 lines (57 loc) · 1.1 KB
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<bits/stdc++.h>
using namespace std;
#define ll long long
bool isVowel(char c){
if(c=='a' || c=='e' || c=='i' || c=='o' || c=='u'){
return true;
}
return false;
}
vector<int> hasVowels(vector<string> strArr, vector<string> query){
int size = strArr.size();
vector<int>isPresent(strArr.size(),0);
for(int i=0;i<strArr.size();i++){
string s=strArr[i];
int size = s.length();
if(isVowel(s[0]) && isVowel(s[size-1])){
isPresent[i]=1;
}
}
vector<int>prefix(size+2,0);
for(int i=0;i<isPresent.size();i++){
prefix[i+1]+=prefix[i];
prefix[i+1]+=isPresent[i];
}
vector<int>ans(query.size());
for(int i=0;i<query.size();i++){
string str = query[i];
int pos = str.find('-');
int l = stoi(str.substr(0, pos));
int r = stoi(str.substr(pos + 1));
l--;
r--;
ans[i]=prefix[r+1]-prefix[l];
}
return ans;
}
int main(){
int x;
cin>>x;
vector<string>v(x);
for(int i=0;i<x;i++){
cin>>v[i];
}
int y;
cin>>y;
vector<string>query(y);
for(int i=0;i<y;i++){
string s;
cin>>s;
query[i]=s;
}
auto ans = hasVowels(v,query);
for(auto i:ans){
cout<<i<<" ";
}
return 0;
}