# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1109312 | Kirill22 | Vim (BOI13_vim) | C++17 | 115 ms | 42588 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
const int inf = (int) 1e9, N = (int) 70000 + 22, A = 10;
int n, need[N], add = 0, ans = inf, all = 0;
string s, t = "";
vector<int> pos;
void upd(int& x, int y) {
x = min(x, y);
}
void solve() {
cin >> n >> s;
add = std::count(s.begin(), s.end(), 'e');
if (!add) {
cout << 0 << '\n';
return;
}
for (int i = 0; i < n; i++) {
if (s[i] != 'e') {
if (i && s[i - 1] == 'e') {
need[(int) t.size()] = 1;
pos.push_back((int) t.size());
}
t += s[i];
}
}
t.push_back('e');
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |