# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1246262 | Jer | Vim (BOI13_vim) | C++20 | 1 ms | 840 KiB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
scanf("%d", &n);
char s[n + 1];
scanf("%s", s);
vector<vector<int>> pos(10);
for (int i = 0; i < n; i++)
if (s[i] != 'e')
pos[s[i] - 'a'].push_back(i);
vector<int> epos;
for (int i = 0; i < n; i++)
if (s[i] == 'e')
epos.push_back(i);
int curr = 0, res = 0;
for (int ei = 0; ei < epos.size(); ei++)
{
int target = epos[ei];
int min_steps = abs(curr - target);
res += min_steps;
curr = target;
if (curr < n - 1)
res++;
}
printf("%d\n", res);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |