# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
503978 | qwerasdfzxcl | Vim (BOI13_vim) | C++14 | 44 ms | 29764 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>
typedef long long ll;
using namespace std;
int dp[70070][12][12], a[70070], on[70070];
int main(){
cin.tie(NULL);
ios_base::sync_with_stdio(false);
int n, pt = 1, cnt = 0;
string s;
cin >> n >> s;
for (int i=0;i<n;i++){
if (s[i]!='e') {a[pt++] = s[i] - 'a' + 1; continue;}
while(i<n && s[i]=='e') i++, cnt++;
on[pt] = 1;
a[pt++] = s[i] - 'a' + 1;
}
n = pt - 1;
//for (int i=1;i<=n;i++) printf("%c", a[i]+'a'-1);
//printf("\n");
//for (int i=1;i<=n;i++) printf("%d", on[i]);
//printf("\n");
for (int j=1;j<=10;j++){
for (int k=1;k<=10;k++) dp[1][j][k] = 4;
dp[1][j][0] = 2;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |