FlandreScarle7/Codeforces-SolutionsA
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

update logic of 1915D

Browse Source
This commit is contained in:
ShazidMahsrafi 2023-12-29 15:58:00 +06:00
parent 802ce4451b
commit c54ae23725
1 changed files with 7 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
Codes/1915D Unnatural Language Processing/1915D.cpp
View File

@ -56,7 +56,7 @@ template <class T, class V> void _print(unordered_map <T, V> v) {cerr << "[ "; f
bool is_v(char ch) bool is_v(char ch)
{ {
return ch=='a' || ch=='e'; return ch=='a' || ch=='e';
} }
void solve() void solve()
@ -64,27 +64,22 @@ void solve()
int n; int n;
string s,ans; string s,ans;
cin>>n>>s; cin>>n>>s;
for(int i=0; i<n; i+=2) for(int i=n-1; i>=0; --i)
{ {
if(i+3<n && is_v(s[i+3])) if(is_v(s[i]) && !is_v(s[i-1]))
{ {
ans.pb(s[i]); ans.pb(s[i]);
ans.pb(s[i+1]); ans.pb(s[i-1]);
ans.pb('.'); ans.pb('.');
--i;
} }
else else
{
ans.pb(s[i]); ans.pb(s[i]);
ans.pb(s[i+1]);
ans.pb(s[i+2]);
ans.pb('.');
i++;
}
} }
ans.pop_back(); ans.pop_back();
if(is_v(s[n-1])) reverse(all(ans));
ans.pop_back();
cout<<ans<<endl; cout<<ans<<endl;
} }
int32_t main() int32_t main()