# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
445488 | lohacho | Vim (BOI13_vim) | C++14 | 93 ms | 80408 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>
#define int long long
#define umi(x, y) (x = min(x, y))
#define uma(x, y) (x = max(x, y))
using namespace std;
int dp[70004][12][12], ns[70004];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
string in; cin >> in;
string s;
vector<int> must;
int cnt = 0, ans = 0;
for(auto&i:in){
if(i == 'e') ++cnt;
else{
s += i; must.push_back(!!cnt);
ans += cnt * 2;
cnt = 0;
}
}
n = (int)s.size();
for(int i = 0; i < 70004; ++i) for(int j = 0; j < 12; ++j) for(int k = 0; k < 12; ++k) dp[i][j][k] = ns[i] = (int)1e9;
for(int i = 1; i <= 11; ++i) dp[1][i][0] = 0;
for(int i = 1; i < n; ++i){
for(int j = 1; j <= 11; ++j){
for(int k = 0; k <= 11; ++k){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |